Public report of CompuMasterGmbH/CompuMaster.Data, published 29 October 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 29 October 2026, 15:23 UTC · Survey ID cd_e04e76321ffd4dcd8b123f2e61adbfe6

CompuMasterGmbH/CompuMaster.Data

Measured 29 October 2026, 15:22 UTC, at code version 155e401

No regression since the last survey Code coverage: not measured

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

Code coverage is not measured: Suite not runnable in-image and no committed report.

CAI score 47out of 100 Weak
CriticalWeakAdequateStrongExemplary
No change since the last survey

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

A small codebase: 18,098 lines of product code in 13 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Production Readiness, 38

Findings by how serious they are

20 critical 236 serious 101 minor

39 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
29 October 2026, 15:22 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

38of 38 dimensions measured by tools.
340of 357 findings point to an exact file and line, so you can open each one in the code. The other 17 concern the repository as a whole, such as missing documentation.
38dimensions across 5 lenses, read from 18,098 lines of product code in 13 projects.
Chapters

Executive summary

CompuMasterGmbH/CompuMaster.Data falls short of our standard for production, in part because we found no logging, tracing or health checks in the code. It scores 47 out of 100 and is rated Weak, and 17 of its 20 critical findings are security problems.

Production Readiness, at 38, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 9 points. Adding a diagnostic log would lift Production Readiness itself, worth about 6 points. Raising Production Readiness to 70 would lift the score to about 56.

Ten pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Five secrets can leak from the build pipeline, and two errors are caught and ignored, so failures can go unnoticed. Pinning each tool to an exact version, limiting each secret to its own step and handling or logging the ignored errors would close these risks. The package under a licence on your banned list needs replacing, or clearing with your legal team.

The product code is 18,098 lines, about €23,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Production Readiness 38 · counts for 47%Maturity 40 · counts for 26%Code Health 69 · counts for 14%Security and Compliance 69 · counts for 8%Architecture 80 · counts for 4%

If Production Readiness rose from 38 to 70, the lowest score rated Strong, the score would rise from 47 to about 56.

Code composition: what the lines of code are
Product code 75%Tests 25%
New since the last survey: 2 findings

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

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

Fixed since the last survey: 1 finding

This critical or serious finding was in the previous survey, on 15 October 2026, and is gone from this one.

  • Supply-chain Provenance & Signing REDACTED
Rebuild cost: about €23,000 · Estimate
Cost to rebuild€7,600 to €38,000, for 127 to 402 hours of work, about 0.2 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 47. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeSmall: 18,098 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 9 points · Low effort · ADR Quality
2
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Raises the score by about 7 points · Low effort · Secret Scanning
3
Resolve the 29 Orphaned file finding(s) in Knowledge Freshness — start with DataTablesTools.vb, CsvTools.vb, DataQuery.AnyIDataProvider.vb.
Raises the score by about 9 points · Medium effort · Knowledge Freshness

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €23,000 to build again, about 0.2 person-years of work. Its weakest lens is Production Readiness, at 38 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 9 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.4 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 3,418 lines over the last 90 days, which is about 13,862 lines a year. At that pace, the extra work comes to an estimated 1.4 to 8.4 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

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

arch CompuMaster.Data Data CompuMaster.Data.Controls Controls CompuMaster.Data.Controls->CompuMaster.Data CompuMaster.Data.Web Web CompuMaster.Data.Web->CompuMaster.Data DebugApp DebugApp DebugApp->CompuMaster.Data DebugApp->CompuMaster.Data.Controls FindOutOfMermoryExceptions FindOutOfMermoryExceptions FindOutOfMermoryExceptions->CompuMaster.Data

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

12 modules, with 7 dependencies between them. One loop runs through 3 of the modules, marked above the diagonal.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 FindOutOfMermoryExceptions2 FindOutOfMermoryExceptions.My3 Microsoft.VisualBasic4 Microsoft.VisualBasic.CompilerServices5 My6 NDoc.MSDN.doc7 CompuMaster.Data.CsvTables8 CompuMaster.Data.DataQuery9 CompuMaster.Data10 CompuMaster.Data.Web11 CompuMaster.Data.Windows12 (global)
1 FindOutOfMermoryExceptions
2 FindOutOfMermoryExceptions.My
3 Microsoft.VisualBasic
4 Microsoft.VisualBasic.CompilerServices
5 My
6 NDoc.MSDN.doc
7 CompuMaster.Data.CsvTables9
8 CompuMaster.Data.DataQuery1
9 CompuMaster.Data31
10 CompuMaster.Data.Web1
11 CompuMaster.Data.Windows2
12 (global)2
Uses a module listed above itPart of a loopThe module itself
1 FindOutOfMermoryExceptions2 FindOutOfMermoryExceptions.My3 Microsoft.VisualBasic4 Microsoft.VisualBasic.CompilerServices5 My6 NDoc.MSDN.doc7 CompuMaster.Data.CsvTables8 CompuMaster.Data.DataQuery9 CompuMaster.Data10 CompuMaster.Data.Web11 CompuMaster.Data.Windows12 (global)FindOutOfMermoryExceptions1FindOutOfMermoryExceptions.My2Microsoft.VisualBasic3Microsoft.VisualBasic.CompilerServices4My5NDoc.MSDN.doc6CompuMaster.Data.CsvTables7CompuMaster.Data.DataQuery8CompuMaster.Data9CompuMaster.Data.Web10CompuMaster.Data.Windows11(global)129131122

At a glance — Code Health · 69% · Adequate · gated by D2 ·

At a glance — Architecture · 80% · Strong ·

At a glance — Maturity · 40% · Weak · gated by D34, M2 ·

At a glance — Readiness · 38% · Weak · gated by P2, P3 ·

At a glance — Security · 69% · Adequate · gated by D36 ·

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 — Injection15High / Critical
A03:2025 — Software Supply Chain Failures10Medium
A07:2025 — Authentication Failures2High / Critical

Roadmap

Immediately resolve the leaked secret in REDACTED and address the single missing architecture decision record to secure the codebase and clarify design intent. Next, eliminate 29 orphaned files, prioritizing DataTablesTools.vb, CsvTools.vb, and DataQuery.AnyIDataProvider.vb, to improve code freshness. Finally, implement a diagnostic log accessible via a verbose flag, focusing first on previously silent exception handlers to enable effective bug reproduction.

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

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.+9.0 ptsLowADR Quality
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.+7.0 ptsLowSecret Scanning
Resolve the 29 Orphaned file finding(s) in Knowledge Freshness — start with DataTablesTools.vb, CsvTools.vb, DataQuery.AnyIDataProvider.vb.+8.7 ptsMediumKnowledge Freshness
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+7.5 ptsMediumArchitecture documentation
Resolve the 1 Banned license finding(s) in License Compliance.+3.1 ptsLowLicense Compliance
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the `catch` blocks that emit nothing — a discarded exception is the failure the user cannot describe and you cannot reproduce.+5.6 ptsMediumObservability
The .NET analyzers are running but not blocking — tighten them (set <AnalysisMode>All</AnalysisMode>, or treat analyzer warnings as errors on CI) so a security/quality regression fails the build rather than scrolling past as a warning.+3.2 ptsMediumSecurity & performance tooling
Resolve the 11 redundant comment finding(s) in Comment Value — start with UtilsTest.vb (3), CellCopyingContextMenu.vb (2), GridEditQuery.vb (2).+2.6 ptsMediumComment Value

File quality

Per-file score 0–10 — a quality signature. Of 27 files carrying findings, judged against the Production bar: 11% slop · 74% mixed · 15% near-clean.

FileScoreBandWorst signal
CompuMaster.Data/CsvTables/CsvTools.vb1.0SlopExplicit Debt: EmptyCatchBlock
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedSecret Scanning: Leaked secret: REDACTED
CompuMaster.Data/DataQuery.DataProvider.vb5.7MixedCognitive Complexity: DataProvider.FindIDbDataApaterType (cognitive 29)
CompuMaster.Data/DataTables.vb6.0MixedExplicit Debt: TodoComment
CompuMaster.Data/Manipulation.vb6.0MixedExplicit Debt: TodoComment
CompuMaster.Data/DataTablesTools.vb6.0MixedExplicit Debt: ObsoleteWithCallers
CompuMaster.Data.Web/GridEditQuery.vb6.0MixedExplicit Debt: TodoComment
CompuMaster.Data/TextTable.vb6.0MixedExplicit Debt: TodoComment
CompuMaster.Data/Utils.vb6.0MixedExplicit Debt: HackComment
CompuMaster.Data.Controls/CellCopyingContextMenu.vb6.0MixedExplicit Debt: TodoComment
CompuMaster.Data/Csv.vb6.0MixedExplicit Debt: ObsoleteWithCallers
CompuMaster.Data/DataQuery.AnyIDataProvider.vb6.3MixedCognitive Complexity: AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericDictionary (cognitive 24)
CompuMaster.Data/DataQuery.Connections.vb6.4MixedCyclomatic Complexity: Connections.MicrosoftAccessConnection (cyclomatic 27)
CompuMaster.Data.Controls/DataGridView.vb6.6MixedExplicit Debt: TodoComment
CompuMaster.Test.Tools.Data/DataTablesTest.vb6.7MixedExplicit Debt: TodoComment
CompuMaster.Test.Tools.Data/DataQuery.ConnectionsTest.vb7.3MixedExplicit Debt: TodoComment
CompuMaster.Data/TextRow.vb7.4MixedCyclomatic Complexity: TextRow.AppendEncodedString (cyclomatic 29)
CompuMaster.Data/CsvTables/CsvReadBaseOptions.vb7.6MixedExplicit Debt: TodoComment

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 20

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 236

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

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

Could not be resolved — 39

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. 38 of 38 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.8 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 38 dimensions across the health lenses
D1D2D3D4D5D6D13D14D15D17D18D20D24D26D27D28D29D30D34D35D36D43D44AX10AX3AX4AX5AX8GD1M1M2M3P1P2P3P4P6X28

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 340 of 357 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement—◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a18841-b16a-7473-a18e-06c819412164.

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

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The test suite couldn't be built/run in-image and no coverage report is committed, so line coverage was not measured — and it is EXCLUDED from the score rather than scored on a LoC-ratio proxy. No coverage collector was found in your CI either, so there is no existing report to hand us — add a collector to your test run and commit (or publish into the working tree) its Cobertura/OpenCover/lcov output. You can widen what we reach: optional: no coverage collector was found in your CI either, so there is no existing report to hand us — add a collector to your test run and commit (or publish into the working tree) its Cobertura/OpenCover/lcov output, or make the suite runnable in-image, and real coverage will be measured.
  • D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not scored — the test tier(s) built and ran but no tests were discovered, so reliability couldn't be exercised.
  • D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (3 contributor(s) across 399 commit(s) sampled, automation and bot accounts excluded). One of them holds 99% of the history; the other 2 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.
  • D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — 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.
  • D30 Dependency Vulnerabilities — measured, with a gap in what it reached — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan. 1 of 2 declared ecosystem(s) (nuget packages.config) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
  • 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.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: 2 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
  • C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
  • C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
  • IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M3 Folder & project structure — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Whether the tests sit apart from production code is not visible here, because the suite is not in a form this pass reads. The test-separation credit is granted rather than withheld: this is a gap in the analyzer's language coverage, not a finding about the repository's tests. You can widen what we reach: keep the test surface somewhere a reader can find it without opening a binary — an exported/checked-in test source tree beside the production code makes the suite reviewable, diffable and discoverable by tooling.
  • PF3 Async & latency hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No function of a language this check models was read, so there was no async code to examine. That is a limit of the analyzer on this repository, not a finding about it.
  • S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X6 Hand-rolled structured-format parsing — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Python, JavaScript/TypeScript, Go, Java/Kotlin/Scala, Ruby, PHP, Rust, Swift, Erlang, Elixir and Dart source only, and no C# was loaded and none of those languages was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations: 4 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

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.
  • 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.
  • 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.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity6.4 / 10Adequate✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

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

27 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was DataTables.SqlJoinTables at 58. A further 1 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 CsvTools.CsvEncode at 18 — they are counted neither in the figure above nor in this dimension's score.

DataTables.SqlJoinTables (cyclomatic 58)CompuMaster.Data/DataTables.vb:4066
CsvTools.SplitCsvLineIntoCellValues (cyclomatic 53)CompuMaster.Data/CsvTables/CsvTools.vb:384
Manipulation.AddMissingColumnsCommandText (cyclomatic 48)CompuMaster.Data/Manipulation.vb:316
DataTables.RemoveRowsWithWithoutRequiredValuesInColumn (cyclomatic 39)CompuMaster.Data/DataTables.vb:49
DataTables.CreateDataTableClone (cyclomatic 38)CompuMaster.Data/DataTables.vb:1141

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

What to do

  1. Bring the 27 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with DataTables.SqlJoinTables (cyclomatic 58), CsvTools.SplitCsvLineIntoCellValues (cyclomatic 53), Manipulation.AddMissingColumnsCommandText (cyclomatic 48). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 27 together lifts Cyclomatic Complexity from 6.4 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
  2. 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.

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

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

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

59 method(s) exceeded the cognitive complexity threshold of 15; the worst was CsvTools.SplitCsvLineIntoCellValues at 150.

CsvTools.SplitCsvLineIntoCellValues (cognitive 150)CompuMaster.Data/CsvTables/CsvTools.vb:384
DataTables.SqlJoinTables (cognitive 138)CompuMaster.Data/DataTables.vb:4066
DataTables.CreateDataTableClone (cognitive 108)CompuMaster.Data/DataTables.vb:1141
DataTables.RemoveRowsWithWithoutRequiredValuesInColumn (cognitive 104)CompuMaster.Data/DataTables.vb:49
DataTables.RemoveRowsWithColumnValues (cognitive 101)CompuMaster.Data/DataTables.vb:162

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

What to do

  1. Bring the 8 bodies over 60 down to 60 or less in Cognitive Complexity — start with CsvTools.SplitCsvLineIntoCellValues (cognitive 150), DataTables.SqlJoinTables (cognitive 138), DataTables.CreateDataTableClone (cognitive 108). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 8 together lifts Cognitive Complexity from 2.0 to about 4.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. 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.

D3 · God Classes7.8 / 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.

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

20 god class(es) detected.

FileTooLong: CompuMaster.Data/DataTables.vb · ×7CompuMaster.Data/DataTables.vb
TooManyMethods: DataTables · ×6CompuMaster.Data/DataTables.vb
MethodTooLong: CsvTools.SplitCsvLineIntoCellValues · ×5CompuMaster.Data/CsvTables/CsvTools.vb:384
ClassTooLong: Connections · ×2CompuMaster.Data/DataQuery.Connections.vb

What to do

  1. Resolve the 7 FileTooLong finding(s) in God Classes — start with DataTables.vb, Utils.vb, DataTablesTools.vb. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 6 TooManyMethods finding(s) in God Classes — start with DataTables.vb, Utils.vb, Csv.vb. — One of this dimension's main actionable groups (6 warning-level).
  3. Resolve the 5 MethodTooLong finding(s) in God Classes — start with DataTables.vb (2), CsvTools.vb, Manipulation.vb. — One of this dimension's main actionable groups (5 warning-level).
  4. 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.

D4 · Code Duplication8.5 / 10Strong✓ Tool-verified

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.

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

60 duplicated block group(s) detected. A further 7 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (9 lines × 2) · ×6CompuMaster.Data/TextTable.vb:414
Duplicated block (12 lines × 2) · ×5CompuMaster.Data/DataQuery.AnyIDataProvider.vb:130
Duplicated block (13 lines × 2) · ×4CompuMaster.Data/DataQuery.AnyIDataProvider.vb:623
Duplicated block (23 lines × 2) · ×3CompuMaster.Data/CsvTables/CsvTools.vb:809
Duplicated block (16 lines × 2) · ×3CompuMaster.Data/DataQuery.AnyIDataProvider.vb:831

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

What to do

  1. Resolve the 6 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with DataTablesTools.vb (3), TextTable.vb, Csv.vb. — One of this dimension's main actionable groups (6 warning-level).
  2. Resolve the 5 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with DataQuery.AnyIDataProvider.vb (2), DataTables.vb (2), DataQuery.Connections.vb. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 4 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with DataQuery.AnyIDataProvider.vb (2), DataTables.vb, DataTablesTools.vb. — One of this dimension's main actionable groups (4 warning-level).
  4. 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.

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)8.7 / 10Strong✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

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

5 of 45 classes have LCOM4 above 3.

Low cohesion: DataProvider (LCOM4 6)CompuMaster.Data/DataQuery.DataProvider.vb:12

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with DataQuery.DataProvider.vb. — One of this dimension's main actionable groups (1 warning-level).
  2. 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.

D13 · Secret Scanning5.0 / 10Adequate✓ Tool-verified

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

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

1 secret(s) detected.

REDACTED

What to do

  1. Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D14 · License Compliance8.0 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

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

1 of 169 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 15 direct `PackageReference`(s), and 150 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.

Banned license: EPPlus

What to do

  1. Resolve the 1 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (1 issue-level).
  2. Enforce License Compliance in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

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

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

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

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D17 · Explicit Debt7.2 / 10Adequategated by 2 critical findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

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

97 deducted debt markers + 0 dead symbols across 18098 LoC in the .NET projects (1.4/KLoC) → score 7.2.

EmptyCatchBlock · ×2CompuMaster.Data/CsvTables/CsvTools.vb:721
ObsoleteWithCallers · ×28CompuMaster.Data/Csv.vb:291
TodoComment · ×27CompuMaster.Data.Controls/CellCopyingContextMenu.vb:162
HackCommentCompuMaster.Data/Utils.vb:1680
ObsoleteWithoutCallers · ×39CompuMaster.Data/Csv.vb:326

What to do

  1. Resolve the 2 EmptyCatchBlock finding(s) in Explicit Debt — start with CsvTools.vb, DataQuery.TestFile.vb. — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 28 ObsoleteWithCallers finding(s) in Explicit Debt — start with DataTables.vb (20), Csv.vb (5), DataTablesTools.vb (2). — One of this dimension's main actionable groups (28 warning-level).
  3. Resolve the 27 TodoComment finding(s) in Explicit Debt — start with CsvTools.vb (5), DataGridView.vb (4), DataTables.vb (4). — One of this dimension's main actionable groups (27 warning-level).
  4. 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.

D18 · Solution Shape9.3 / 10Exemplary✓ Tool-verified

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

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

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

13 projects, 223 source files, 24002 hand-written lines of code (18098 production / 5904 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), plus 492 generated (machine-written code — designer, scaffolded and tool-emitted files — excluded from quality), 9 inter-project edges.

Thin analysable surface across projects: DebugApp · ×2CompuMaster.Data.Controls.Debug/DebugApp.vbproj

✓ On the Gold path — maintain.

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

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.

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

No architecture decision records were found.

No ADRs found

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

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

D24 · Comment Value7.9 7.2 / 10Strong✓ Tool-verified

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 7.2 / 10 · rule-coverage 92% · ceiling Documented

11 of 515 judged comments only repeat the code they sit on (2.1 %). 66 comment(s) in another language or script were not judged.

redundant comment · ×11CompuMaster.Data.Controls/CellCopyingContextMenu.vb:143
doc comments repeat the names · ×4CompuMaster.Data/Csv.vb:106

What to do

  1. Resolve the 11 redundant comment finding(s) in Comment Value — start with UtilsTest.vb (3), CellCopyingContextMenu.vb (2), GridEditQuery.vb (2). — One of this dimension's main actionable groups (11 recommendation-level).

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

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

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

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

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

0 of 6 projects flagged as possibly oversized/incoherent.

✓ On the Gold path — maintain.

Detailed fixes: d26_recommendation.md.

D27 · Navigability10.0 / 10Exemplary✓ Tool-verified

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)9.0 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

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

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

REDACTED

What to do

  1. Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

D29 · Static Analysis (SAST)4.2 / 10Weak✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

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

15 finding(s): 0 critical, 15 high, 0 medium, 0 low. 10 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 10 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (10 issue-level, 0 of them charged here).

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

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

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

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

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

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

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

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

Orphaned file · ×29CompuMaster.Data/DataTablesTools.vb:1
Most significant orphaned file · ×3CompuMaster.Data/DataTables.vb:1
Dormant codebase

What to do

  1. Resolve the 29 Orphaned file finding(s) in Knowledge Freshness — start with DataTablesTools.vb, CsvTools.vb, DataQuery.AnyIDataProvider.vb. — One of this dimension's main actionable groups (29 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with DataTables.vb, Csv.vb, Utils.vb. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

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

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).

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

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

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

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

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 4 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.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition4.0 / 10Weak✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

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

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

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

Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.

Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

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

Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

M1 · Documentation (README)6.7 / 10Adequate✓ Tool-verified

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

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
  • Add a README to the 6 of 6 project(s) that lack one — worth up to 2 pts.
M2 · Architecture documentation0.0 / 10Critical✓ Tool-verified

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 your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure8.0 / 10Strong✓ Tool-verified

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.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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.

P2 · Observability0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.

What to do

  • Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the `catch` blocks that emit nothing — a discarded exception is the failure the user cannot describe and you cannot reproduce.
  • 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.
P3 · Security & performance tooling3.0 / 10Weak✓ Tool-verified

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.

  • `CompuMaster.Data.Controls.Debug/DebugApp.vbproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — CompuMaster.Data.Controls.Debug/DebugApp.vbproj:177

What to do

  • The .NET analyzers are running but not blocking — tighten them (set <AnalysisMode>All</AnalysisMode>, or treat analyzer warnings as errors on CI) so a security/quality regression fails the build rather than scrolling past as a warning.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

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

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

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health69%Adequate — gated by D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture80%StrongStrongest area.
Maturity40%Weak — gated by D34, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness38%Weak — gated by P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security69%Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
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 — 4 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 77 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC7 A11y enforcement — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX6 Interface segregation — no public interfaces
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • D10 Test Quality — ~5990 lines of test source are present (.vb) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — No tests discovered
  • D12 Dependency Hygiene — Dependency hygiene not measured
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Visual Basic not measured.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — small single-context codebase (18,098 production LoC in the .NET projects) — bounded contexts are not needed at this size No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • 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) — 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.
  • 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.
  • D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured
  • D9 Test Distribution — Test source is present (.vb) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows only 1 of the 3 signals this lens looks for (2 event handler(s))
  • ED5 Idempotency — 2 mutating command handler(s)/consumer(s) detected and 4 handler method(s) walked, but no persistent write was recognised in any of them — idempotency not assessed
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • M4 Documentation accuracy — Not applicable: the 1 current-state document(s) make no claim of a kind M4 checks.
  • 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 — Not applicable: no benchmark suite was found. This check searched for a BenchmarkDotNet reference in an .fsproj or .vbproj, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not applicable: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Visual Basic code has 19,580 production line(s), 2 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
  • PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 20 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D17 · Explicit Debt · EmptyCatchBlock · ×2
  • EmptyCatchBlock CompuMaster.Data/CsvTables/CsvTools.vb:721 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock CompuMaster.Data/DataQuery.TestFile.vb:63 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
D13 · Secret Scanning · Leaked secret · ×1
  • REDACTED
D14 · License Compliance · Banned license · ×1
  • Banned license: EPPlus — `EPPlus` 4.5.3.2 resolves to SPDX id LGPL-3.0-or-later, and this run's banned set is AGPL-3.0, GPL-2.0, GPL-3.0, LGPL-3.0. The id is read as an SPDX expression: an `OR` is a choice and is charged only when every branch is banned, an `AND` binds every operand, and a `WITH` exception leaves the licence it attaches to as it is. Each licence id is then matched as a SUBSTRING that starts at a token boundary, not an exact comparison — which is how variants like `-only` and `-or-later` are caught while `LGPL-2.0-only` is not read as `GPL-2.0`, and it is the rule to apply if you re-check this by hand. The set is policy, not law: it is configurable, so a licence banned here may be acceptable in your context, and the row is then something to record an exception for rather than to fix. ★ This arm reads the resolved package list and knows nothing about dependency SCOPE — it cannot tell a runtime dependency from a build- or test-only one, so unlike the Bundler arm it is NOT claiming this ships to your users. Check where it sits before acting. ★ DEPTH: this repository's MSBuild projects declare 15 direct `PackageReference`(s), and 150 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.
D28 · Secrets (history) · High secret · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 236 finding(s)
D17 · Explicit Debt · ObsoleteWithCallers · ×28
  • ObsoleteWithCallers CompuMaster.Data/Csv.vb:291 — <Obsolete> ReadDataTableFromCsvFile
  • ObsoleteWithCallers CompuMaster.Data/Csv.vb:309 — <Obsolete> ReadDataTableFromCsvFile
  • ObsoleteWithCallers CompuMaster.Data/Csv.vb:605 — <Obsolete> ReadDataTableFromCsvFile
  • ObsoleteWithCallers CompuMaster.Data/Csv.vb:932 — <Obsolete> WriteDataTableToCsvFileStringWithTextEncoding
  • ObsoleteWithCallers CompuMaster.Data/Csv.vb:949 — <Obsolete> WriteDataTableToCsvFileStringWithTextEncoding
  • ObsoleteWithCallers CompuMaster.Data/CsvTables/CsvReadOptionsFixedColumnSize.vb:22 — <Obsolete> .ctor
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:395 — <Obsolete> FindDuplicates
  • ObsoleteWithCallers CompuMaster.Data/DataTablesTools.vb:166 — <Obsolete> FindDuplicates
  • ObsoleteWithCallers CompuMaster.Data/DataTablesTools.vb:181 — <Obsolete> FindDuplicates
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2056 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2072 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2085 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2112 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2223 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2366 — <Obsolete> SuggestColumnWidthsForFixedPlainTables
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2390 — <Obsolete> SuggestColumnWidthsForFixedPlainTables
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2495 — <Obsolete> SuggestColumnWidthsForFixedPlainTables
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2510 — <Obsolete> SuggestColumnWidthsForFixedPlainTables
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2681 — <Obsolete> ConvertToPlainTextTableWithFixedColumnWidthsInternal
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2717 — <Obsolete> ConvertToPlainTextTableWithFixedColumnWidthsInternal
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2747 — <Obsolete> ConvertToPlainTextTableWithFixedColumnWidthsInternal
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:2977 — <Obsolete> ConvertToPlainTextTable
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:3194 — <Obsolete> FullJoinTables
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:3222 — <Obsolete> FullJoinTables
  • ObsoleteWithCallers CompuMaster.Data/DataTables.vb:3238 — <Obsolete> FullJoinTables
  • + 3 more in this group — see findings.md.
D17 · Explicit Debt · TodoComment · ×27
  • TodoComment CompuMaster.Data.Controls/CellCopyingContextMenu.vb:162 — 'TODO: implement in CM.Data? — 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 CompuMaster.Data.Controls/DataGridView.vb:10 — 'TODO: implement usual clipboard commands: Ctrl+C,V,X, Ctrl+Ins/Shift+Ins/Shift-Del — 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 CompuMaster.Data.Controls/DataGridView.vb:11 — 'TODO: implement Ctrl+Space, Shift+Space, Ctrl+Shift+Space — 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 CompuMaster.Data.Controls/DataGridView.vb:12 — 'TODO: fix bug that VS designer often moves Friend WithEvents DataGridView1 As CompuMaster.Data.Windows.DataGridView into a Dim DataGridView1 As CompuMaster.Data.Windows.DataGridView in InitializeComponent method (making it private and inaccessible, leading to compiler errors); e.g. just add an additional button into the form with the DataGridView and double-click the button to add event handler code: at this time you should already find compiler errors in your existing code which refers to the DataGridView — 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 CompuMaster.Data.Controls/DataGridView.vb:13 — 'TODO: fix known bugs (ask JW) — 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 CompuMaster.Data.Web/GridEditQuery.vb:266 — 'TODO: Retrieve Checkbox Value from RequestForm data correctly (because CheckBox.Checked contains the old data before change) — 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 CompuMaster.Data/CsvTables/CsvReadBaseOptions.vb:43 — 'TODO: maybe "line" is incorrect, should be "row"? — 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 CompuMaster.Data/CsvTables/CsvTools.vb:226 — 'TODO: consider line encoding arguments and support cell line breaks by considering the cell line break encoding — 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 CompuMaster.Data/CsvTables/CsvTools.vb:492 — 'TODO: read cell line breaks correctly — 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 CompuMaster.Data/CsvTables/CsvTools.vb:524 — 'TODO: read cell line breaks correctly — 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 CompuMaster.Data/CsvTables/CsvTools.vb:554 — 'TODO: read cell line breaks correctly — 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 CompuMaster.Data/CsvTables/CsvTools.vb:586 — 'TODO: read cell line breaks correctly — 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 CompuMaster.Data/DataTables.vb:599 — ' 'ToDo: additional testings — 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 CompuMaster.Data/DataTables.vb:625 — ' 'TODO: implementation — 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 CompuMaster.Data/DataTables.vb:1282 — 'TODO: consider ignoreColumnNameCasing — 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 CompuMaster.Data/DataTables.vb:1283 — 'TODO: performance improvement proofed with 3000lines-table — 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 CompuMaster.Data/DataTablesTools.vb:1413 — 'TODO: verify/fix exceptions when left AND right table contain rows not matching to the other side (FULL OUTER JOIN situations) — 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 CompuMaster.Data/DataTablesTools.vb:1414 — 'TODO: above ToDo "verify/fix exceptions" might not be applicable here?!? --> to remove ?!? — 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 CompuMaster.Data/Manipulation.vb:629 — ' 'TODO: identify column names from WHERE clause in deleteCommandCreatedByCommandBuilder (for single-field-PKs as well as for multiple-field-PKs) — 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 CompuMaster.Data/Manipulation.vb:630 — ' 'TODO: add to result array but without duplicates (what is a duplicate - case sensitive or case insensitive? Is it the same with all database-DDLs?) — 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 CompuMaster.Data/TextTable.vb:10 — '-> TODO: DbNullText implementation oder besser TextTableRenderOptions ? — 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 CompuMaster.Data/TextTable.vb:11 — '-> TODO: ColumnFormatting nicht in TextTable-Constructor !? — 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 CompuMaster.Data/TextTable.vb:12 — '-> TODO: above changes require complete redesign of arguments lists for constructor and ToString() — 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 CompuMaster.Test.Tools.Data/DataQuery.ConnectionsTest.vb:32 — 'TODO: Unabh�ngigkeit von spezifischer Workstation mit Lw. G: — 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 CompuMaster.Test.Tools.Data/DataQuery.ConnectionsTest.vb:33 — 'TODO: Sinnvolles Testing — 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.
  • + 2 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×7
  • FileTooLong: CompuMaster.Data/DataTables.vb CompuMaster.Data/DataTables.vb — FileTooLong — 2774 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2274 over it, 5.55× 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: CompuMaster.Data/Utils.vb CompuMaster.Data/Utils.vb — FileTooLong — 1050 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 550 over it, 2.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: CompuMaster.Data/DataTablesTools.vb CompuMaster.Data/DataTablesTools.vb — FileTooLong — 1002 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 502 over it, 2.00× 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: CompuMaster.Data/DataQuery.AnyIDataProvider.vb CompuMaster.Data/DataQuery.AnyIDataProvider.vb — FileTooLong — 920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 420 over it, 1.84× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: CsvTables/CsvTools.vb CompuMaster.Data/CsvTables/CsvTools.vb — FileTooLong — 822 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 322 over it, 1.64× 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: CompuMaster.Data/DataQuery.Connections.vb CompuMaster.Data/DataQuery.Connections.vb — FileTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06× 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: CompuMaster.Data/Manipulation.vb CompuMaster.Data/Manipulation.vb — FileTooLong — 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D3 · God Classes · TooManyMethods · ×6
  • TooManyMethods: DataTables CompuMaster.Data/DataTables.vb — TooManyMethods — 2764 significant lines (blank, comment-only and punctuation-only lines excluded), 247 methods. The bar is 30 methods; this is 217 over it, 8.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Utils CompuMaster.Data/Utils.vb — TooManyMethods — 1044 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: Csv CompuMaster.Data/Csv.vb — TooManyMethods — 314 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 30 methods; this is 39 over it, 2.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: DataTablesTools CompuMaster.Data/DataTablesTools.vb — TooManyMethods — 994 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 30 methods; this is 30 over it, 2.00× 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: AnyIDataProvider CompuMaster.Data/DataQuery.AnyIDataProvider.vb — TooManyMethods — 911 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 30 methods; this is 30 over it, 2.00× 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: CsvTools CompuMaster.Data/CsvTables/CsvTools.vb — TooManyMethods — 815 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×6
  • Duplicated block (9 lines × 2) CompuMaster.Data/TextTable.vb:414 — CompuMaster.Data/TextTable.vb:414-422 | CompuMaster.Data/TextTable.vb:436-444 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) CompuMaster.Data/Csv.vb:966 — CompuMaster.Data/Csv.vb:966-974 | CompuMaster.Data/Csv.vb:989-997 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) CompuMaster.Data/DataTables.vb:2800 — CompuMaster.Data/DataTables.vb:2800-2808 | CompuMaster.Data/DataTables.vb:2843-2851 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) CompuMaster.Data/DataTablesTools.vb:1322 — CompuMaster.Data/DataTablesTools.vb:1322-1330 | CompuMaster.Data/DataTablesTools.vb:1445-1453 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) CompuMaster.Data/DataTablesTools.vb:1353 — CompuMaster.Data/DataTablesTools.vb:1353-1361 | CompuMaster.Data/DataTablesTools.vb:1474-1482 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) CompuMaster.Data/DataTablesTools.vb:1522 — CompuMaster.Data/DataTablesTools.vb:1522-1530 | CompuMaster.Data/DataTablesTools.vb:1544-1553 — both copies are in the same file, so extract the 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.
D3 · God Classes · MethodTooLong · ×5
  • MethodTooLong: CsvTools.SplitCsvLineIntoCellValues CompuMaster.Data/CsvTables/CsvTools.vb:384 — MethodTooLong — SplitCsvLineIntoCellValues runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: DataTables.SqlJoinTables CompuMaster.Data/DataTables.vb:4066 — MethodTooLong — SqlJoinTables runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× 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: DataTables.CreateDataTableClone CompuMaster.Data/DataTables.vb:1141 — MethodTooLong — CreateDataTableClone runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× 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: Manipulation.AddMissingColumnsCommandText CompuMaster.Data/Manipulation.vb:316 — MethodTooLong — AddMissingColumnsCommandText runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31× 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: TextRow.AppendEncodedString CompuMaster.Data/TextRow.vb:72 — MethodTooLong — AppendEncodedString runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×5
  • Duplicated block (12 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:130 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:130-141 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:291-302 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:123 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:123-134 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1101-1112 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:95 — CompuMaster.Data/DataQuery.Connections.vb:95-106 | CompuMaster.Data/DataQuery.Connections.vb:305-316 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) CompuMaster.Data/DataTables.vb:2548 — CompuMaster.Data/DataTables.vb:2548-2559 | CompuMaster.Data/DataTables.vb:2565-2576 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) CompuMaster.Data/DataTables.vb:2631 — CompuMaster.Data/DataTables.vb:2631-2642 | CompuMaster.Data/DataTables.vb:2648-2659 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×4
  • Duplicated block (13 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:623 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:623-635 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:684-696 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:737 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:737-749 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:789-801 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) CompuMaster.Data/DataTables.vb:2551 — CompuMaster.Data/DataTables.vb:2551-2563 | CompuMaster.Data/DataTables.vb:2634-2646 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) CompuMaster.Data/DataTablesTools.vb:935 — CompuMaster.Data/DataTablesTools.vb:935-947 | CompuMaster.Data/DataTablesTools.vb:970-982 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×3
  • Duplicated block (23 lines × 2) CompuMaster.Data/CsvTables/CsvTools.vb:809 — CompuMaster.Data/CsvTables/CsvTools.vb:809-831 | CompuMaster.Data/CsvTables/CsvTools.vb:910-932 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (23 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:331 — CompuMaster.Data/DataQuery.Connections.vb:331-353 | CompuMaster.Data/DataQuery.Connections.vb:448-470 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (23 lines × 2) CompuMaster.Data/CsvTables/CsvTools.vb:111 — CompuMaster.Data/CsvTables/CsvTools.vb:111-133 | CompuMaster.Data/CsvTables/CsvTools.vb:145-167 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×3
  • Duplicated block (16 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:831 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:831-846 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:954-969 — both copies are in the same file, so extract the block into 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) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1230 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1230-1245 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1344-1359 — both copies are in the same file, so extract the block into 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) CompuMaster.Data/DataTablesTools.vb:728 — CompuMaster.Data/DataTablesTools.vb:728-743 | CompuMaster.Data/DataTablesTools.vb:759-775 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×3
  • Duplicated block (10 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:617 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:617-626 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:731-740 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) CompuMaster.Data/DataTables.vb:2534 — CompuMaster.Data/DataTables.vb:2534-2543 | CompuMaster.Data/DataTables.vb:2617-2626 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) CompuMaster.Data/CsvTables/CsvTools.vb:1244 — CompuMaster.Data/CsvTables/CsvTools.vb:1244-1253 | CompuMaster.Data/CsvTables/CsvTools.vb:1298-1307 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CompuMaster.Data/CsvTables/CsvTools.vb:1308` calls `Write` and `CompuMaster.Data/CsvTables/CsvTools.vb:1254` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×3
  • Duplicated block (6 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:731 — CompuMaster.Data/DataQuery.Connections.vb:731-736 | CompuMaster.Data/DataQuery.Connections.vb:750-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.
  • Duplicated block (6 lines × 2) CompuMaster.Data/CsvTables/CsvTools.vb:1355 — CompuMaster.Data/CsvTables/CsvTools.vb:1355-1360 | CompuMaster.Data/CsvTables/CsvTools.vb:1364-1369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:367 — CompuMaster.Data/DataQuery.Connections.vb:367-372 | CompuMaster.Data/DataQuery.Connections.vb:413-418 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D3 · God Classes · ClassTooLong · ×2
  • ClassTooLong: Connections CompuMaster.Data/DataQuery.Connections.vb — ClassTooLong — 523 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 123 over it, 1.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: Manipulation CompuMaster.Data/Manipulation.vb — ClassTooLong — 504 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 104 over it, 1.26× 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.
D36 · Supply-chain Provenance & Signing REDACTED · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×2
  • Duplicated block (21 lines × 2) CompuMaster.Data/DataTables.vb:726 — CompuMaster.Data/DataTables.vb:726-746 | CompuMaster.Data/DataTables.vb:870-890 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (21 lines × 2) CompuMaster.Data/DataTables.vb:4470 — CompuMaster.Data/DataTables.vb:4470-4490 | CompuMaster.Data/DataTables.vb:4537-4557 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (20–21 lines × 3) · ×2
  • Duplicated block (20–21 lines × 3) CompuMaster.Data/DataTables.vb:663 — CompuMaster.Data/DataTables.vb:663-683 | CompuMaster.Data/DataTables.vb:692-711 | CompuMaster.Data/DataTables.vb:719-738 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (20–21 lines × 3) CompuMaster.Data/DataTables.vb:807 — CompuMaster.Data/DataTables.vb:807-827 | CompuMaster.Data/DataTables.vb:836-855 | CompuMaster.Data/DataTables.vb:863-882 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×2
  • Duplicated block (19 lines × 2) CompuMaster.Data/CsvTables/CsvTools.vb:971 — CompuMaster.Data/CsvTables/CsvTools.vb:971-989 | CompuMaster.Data/CsvTables/CsvTools.vb:1275-1293 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1108 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1108-1126 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1147-1165 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:973 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:973-990 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1043-1060 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (18 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:370 — CompuMaster.Data/DataQuery.Connections.vb:370-387 | CompuMaster.Data/DataQuery.Connections.vb:482-499 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×2
  • Duplicated block (11 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:75 — CompuMaster.Data/DataQuery.Connections.vb:75-85 | CompuMaster.Data/DataQuery.Connections.vb:281-291 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) CompuMaster.Data/DataTables.vb:2310 — CompuMaster.Data/DataTables.vb:2310-2320 | CompuMaster.Data/DataTables.vb:2335-2345 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×2
  • Duplicated block (8 lines × 2) CompuMaster.Data/DataTables.vb:4314 — CompuMaster.Data/DataTables.vb:4314-4321 | CompuMaster.Data/DataTables.vb:4344-4351 — both copies are in the same file, so extract the block into 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) CompuMaster.Data/Utils.vb:1665 — CompuMaster.Data/Utils.vb:1665-1672 | CompuMaster.Data/Utils.vb:1683-1690 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D1 · Cyclomatic Complexity · DataTables.SqlJoinTables (cyclomatic 58) · ×1
  • DataTables.SqlJoinTables (cyclomatic 58) CompuMaster.Data/DataTables.vb:4066 — DataTables.SqlJoinTables 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. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CsvTools.SplitCsvLineIntoCellValues (cyclomatic 53) · ×1
  • CsvTools.SplitCsvLineIntoCellValues (cyclomatic 53) CompuMaster.Data/CsvTables/CsvTools.vb:384 — CsvTools.SplitCsvLineIntoCellValues 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.
D1 · Cyclomatic Complexity · Manipulation.AddMissingColumnsCommandText (cyclomatic 48) · ×1
  • Manipulation.AddMissingColumnsCommandText (cyclomatic 48) CompuMaster.Data/Manipulation.vb:316 — Manipulation.AddMissingColumnsCommandText has cyclomatic complexity 48 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · DataTables.RemoveRowsWithWithoutRequiredValuesInColumn (cyclomatic 39) · ×1
  • DataTables.RemoveRowsWithWithoutRequiredValuesInColumn (cyclomatic 39) CompuMaster.Data/DataTables.vb:49 — DataTables.RemoveRowsWithWithoutRequiredValuesInColumn has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTables.CreateDataTableClone (cyclomatic 38) · ×1
  • DataTables.CreateDataTableClone (cyclomatic 38) CompuMaster.Data/DataTables.vb:1141 — DataTables.CreateDataTableClone has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTables.RemoveRowsWithColumnValues (cyclomatic 37) · ×1
  • DataTables.RemoveRowsWithColumnValues (cyclomatic 37) CompuMaster.Data/DataTables.vb:162 — DataTables.RemoveRowsWithColumnValues 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. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTables.ConvertToWikiTable (cyclomatic 31) · ×1
  • DataTables.ConvertToWikiTable (cyclomatic 31) CompuMaster.Data/DataTables.vb:2293 — DataTables.ConvertToWikiTable has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CsvTools.WriteCellValue (cyclomatic 29) · ×1
  • CsvTools.WriteCellValue (cyclomatic 29) CompuMaster.Data/CsvTables/CsvTools.vb:1342 — CsvTools.WriteCellValue has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · TextRow.AppendEncodedString (cyclomatic 29) · ×1
  • TextRow.AppendEncodedString (cyclomatic 29) CompuMaster.Data/TextRow.vb:72 — TextRow.AppendEncodedString has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · CsvTools.ConvertDataTableToCsv (cyclomatic 28) · ×1
  • CsvTools.ConvertDataTableToCsv (cyclomatic 28) CompuMaster.Data/CsvTables/CsvTools.vb:805 — CsvTools.ConvertDataTableToCsv has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · DataTables.FullJoinTables (cyclomatic 28) · ×1
  • DataTables.FullJoinTables (cyclomatic 28) CompuMaster.Data/DataTables.vb:3238 — DataTables.FullJoinTables 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. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · Connections.MicrosoftAccessConnection (cyclomatic 27) · ×1
  • Connections.MicrosoftAccessConnection (cyclomatic 27) CompuMaster.Data/DataQuery.Connections.vb:242 — Connections.MicrosoftAccessConnection 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.
D1 · Cyclomatic Complexity · DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable (cyclomatic 27) · ×1
  • DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable (cyclomatic 27) CompuMaster.Data/DataTables.vb:641 — DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable 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. This shape REPEATS in the file: one other method here (DataTables.RemoveRowsWithCorrespondingValueInComparisonTable) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTables.RemoveRowsWithCorrespondingValueInComparisonTable (cyclomatic 27) · ×1
  • DataTables.RemoveRowsWithCorrespondingValueInComparisonTable (cyclomatic 27) CompuMaster.Data/DataTables.vb:785 — DataTables.RemoveRowsWithCorrespondingValueInComparisonTable 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. This shape REPEATS in the file: one other method here (DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTables.CompareValuesOfUnknownType (cyclomatic 25) · ×1
  • DataTables.CompareValuesOfUnknownType (cyclomatic 25) CompuMaster.Data/DataTables.vb:3421 — DataTables.CompareValuesOfUnknownType has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTablesTools.JoinTables (cyclomatic 25) · ×1
  • DataTablesTools.JoinTables (cyclomatic 25) CompuMaster.Data/DataTablesTools.vb:1283 — DataTablesTools.JoinTables has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · Connections.MicrosoftAccessOleDbConnection (cyclomatic 21) · ×1
  • Connections.MicrosoftAccessOleDbConnection (cyclomatic 21) CompuMaster.Data/DataQuery.Connections.vb:36 — Connections.MicrosoftAccessOleDbConnection has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · Connections.MicrosoftExcelConnection (cyclomatic 21) · ×1
  • Connections.MicrosoftExcelConnection (cyclomatic 21) CompuMaster.Data/DataQuery.Connections.vb:328 — Connections.MicrosoftExcelConnection has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · DataTables.SuggestColumnWidthsForFixedPlainTables (cyclomatic 21) · ×1
  • DataTables.SuggestColumnWidthsForFixedPlainTables (cyclomatic 21) CompuMaster.Data/DataTables.vb:2529 — DataTables.SuggestColumnWidthsForFixedPlainTables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTables.SqlJoin_IsEqual (cyclomatic 19) · ×1
  • DataTables.SqlJoin_IsEqual (cyclomatic 19) CompuMaster.Data/DataTables.vb:4630 — DataTables.SqlJoin_IsEqual 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 file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DataTablesTools.ConvertToHtmlTable (cyclomatic 19) · ×1
  • DataTablesTools.ConvertToHtmlTable (cyclomatic 19) CompuMaster.Data/DataTablesTools.vb:828 — DataTablesTools.ConvertToHtmlTable has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · DataTablesTools.CrossJoinTables (cyclomatic 19) · ×1
  • DataTablesTools.CrossJoinTables (cyclomatic 19) CompuMaster.Data/DataTablesTools.vb:1411 — DataTablesTools.CrossJoinTables has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · Connections.MicrosoftExcelOleDbConnection (cyclomatic 18) · ×1
  • Connections.MicrosoftExcelOleDbConnection (cyclomatic 18) CompuMaster.Data/DataQuery.Connections.vb:445 — Connections.MicrosoftExcelOleDbConnection has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · DataTables.SuggestColumnWidthsForFixedPlainTables (cyclomatic 18) · ×1
  • DataTables.SuggestColumnWidthsForFixedPlainTables (cyclomatic 18) CompuMaster.Data/DataTables.vb:2615 — DataTables.SuggestColumnWidthsForFixedPlainTables 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 file is where this pass's cyclomatic complexity CONCENTRATES: CompuMaster.Data/DataTables.vb holds 12 of the 27 methods over the threshold — including the worst — and 188 of the 349 points over it (54%), 2.8× the next-largest file (CompuMaster.Data/CsvTables/CsvTools.vb at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · Connections.MicrosoftAccessOdbcConnection (cyclomatic 17) · ×1
  • Connections.MicrosoftAccessOdbcConnection (cyclomatic 17) CompuMaster.Data/DataQuery.Connections.vb:129 — Connections.MicrosoftAccessOdbcConnection has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · CsvTools.ConvertDataTableToCsv (cyclomatic 16) · ×1
  • CsvTools.ConvertDataTableToCsv (cyclomatic 16) CompuMaster.Data/CsvTables/CsvTools.vb:902 — CsvTools.ConvertDataTableToCsv has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: CsvTools.CsvEncode (cyclomatic 18) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Manipulation.UpdateCodeManipulatedData (cyclomatic 16) · ×1
  • Manipulation.UpdateCodeManipulatedData (cyclomatic 16) CompuMaster.Data/Manipulation.vb:745 — Manipulation.UpdateCodeManipulatedData has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D17 · Explicit Debt · HackComment · ×1
  • HackComment CompuMaster.Data/Utils.vb:1680 — 'HACK: download twice, but now with 1st response's charset encoding information — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D2 · Cognitive Complexity · CsvTools.SplitCsvLineIntoCellValues (cognitive 150) · ×1
  • CsvTools.SplitCsvLineIntoCellValues (cognitive 150) CompuMaster.Data/CsvTables/CsvTools.vb:384 — CsvTools.SplitCsvLineIntoCellValues 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.
D2 · Cognitive Complexity · DataTables.SqlJoinTables (cognitive 138) · ×1
  • DataTables.SqlJoinTables (cognitive 138) CompuMaster.Data/DataTables.vb:4066 — DataTables.SqlJoinTables has cognitive complexity 138 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.CreateDataTableClone (cognitive 108) · ×1
  • DataTables.CreateDataTableClone (cognitive 108) CompuMaster.Data/DataTables.vb:1141 — DataTables.CreateDataTableClone has cognitive complexity 108 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.RemoveRowsWithWithoutRequiredValuesInColumn (cognitive 104) · ×1
  • DataTables.RemoveRowsWithWithoutRequiredValuesInColumn (cognitive 104) CompuMaster.Data/DataTables.vb:49 — DataTables.RemoveRowsWithWithoutRequiredValuesInColumn has cognitive complexity 104 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.RemoveRowsWithColumnValues (cognitive 101) · ×1
  • DataTables.RemoveRowsWithColumnValues (cognitive 101) CompuMaster.Data/DataTables.vb:162 — DataTables.RemoveRowsWithColumnValues has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · TextRow.AppendEncodedString (cognitive 80) · ×1
  • TextRow.AppendEncodedString (cognitive 80) CompuMaster.Data/TextRow.vb:72 — TextRow.AppendEncodedString has cognitive complexity 80 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable (cognitive 79) · ×1
  • DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable (cognitive 79) CompuMaster.Data/DataTables.vb:641 — DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable has cognitive complexity 79 (threshold 15). To reduce it, flatten the nesting: invert conditions into 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 (DataTables.RemoveRowsWithCorrespondingValueInComparisonTable) 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.
D2 · Cognitive Complexity · DataTables.RemoveRowsWithCorrespondingValueInComparisonTable (cognitive 79) · ×1
  • DataTables.RemoveRowsWithCorrespondingValueInComparisonTable (cognitive 79) CompuMaster.Data/DataTables.vb:785 — DataTables.RemoveRowsWithCorrespondingValueInComparisonTable has cognitive complexity 79 (threshold 15). To reduce it, flatten the nesting: invert conditions into 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 (DataTables.RemoveRowsWithNoCorrespondingValueInComparisonTable) 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.
D2 · Cognitive Complexity · CsvTools.WriteCellValue (cognitive 57) · ×1
  • CsvTools.WriteCellValue (cognitive 57) CompuMaster.Data/CsvTables/CsvTools.vb:1342 — CsvTools.WriteCellValue has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · Manipulation.AddMissingColumnsCommandText (cognitive 57) · ×1
  • Manipulation.AddMissingColumnsCommandText (cognitive 57) CompuMaster.Data/Manipulation.vb:316 — Manipulation.AddMissingColumnsCommandText has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.FullJoinTables (cognitive 56) · ×1
  • DataTables.FullJoinTables (cognitive 56) CompuMaster.Data/DataTables.vb:3238 — DataTables.FullJoinTables 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.
D2 · Cognitive Complexity · DataTablesTools.JoinTables (cognitive 51) · ×1
  • DataTablesTools.JoinTables (cognitive 51) CompuMaster.Data/DataTablesTools.vb:1283 — DataTablesTools.JoinTables 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.
D2 · Cognitive Complexity · CsvTools.ConvertDataTableToCsv (cognitive 50) · ×1
  • CsvTools.ConvertDataTableToCsv (cognitive 50) CompuMaster.Data/CsvTables/CsvTools.vb:805 — CsvTools.ConvertDataTableToCsv has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.SuggestColumnWidthsForFixedPlainTables (cognitive 50) · ×1
  • DataTables.SuggestColumnWidthsForFixedPlainTables (cognitive 50) CompuMaster.Data/DataTables.vb:2529 — DataTables.SuggestColumnWidthsForFixedPlainTables has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.SuggestColumnWidthsForFixedPlainTables (cognitive 48) · ×1
  • DataTables.SuggestColumnWidthsForFixedPlainTables (cognitive 48) CompuMaster.Data/DataTables.vb:2615 — DataTables.SuggestColumnWidthsForFixedPlainTables 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.
D2 · Cognitive Complexity · Manipulation.UpdateCodeManipulatedData (cognitive 40) · ×1
  • Manipulation.UpdateCodeManipulatedData (cognitive 40) CompuMaster.Data/Manipulation.vb:745 — Manipulation.UpdateCodeManipulatedData has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · CsvTools.ReadDataTableFromCsvReader (cognitive 37) · ×1
  • CsvTools.ReadDataTableFromCsvReader (cognitive 37) CompuMaster.Data/CsvTables/CsvTools.vb:292 — CsvTools.ReadDataTableFromCsvReader 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.
D2 · Cognitive Complexity · DataTablesTools.CrossJoinTables (cognitive 36) · ×1
  • DataTablesTools.CrossJoinTables (cognitive 36) CompuMaster.Data/DataTablesTools.vb:1411 — DataTablesTools.CrossJoinTables has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTables.ConvertToWikiTable (cognitive 34) · ×1
  • DataTables.ConvertToWikiTable (cognitive 34) CompuMaster.Data/DataTables.vb:2293 — DataTables.ConvertToWikiTable has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · CsvTools.ReadDataTableFromCsvReader (cognitive 33) · ×1
  • CsvTools.ReadDataTableFromCsvReader (cognitive 33) CompuMaster.Data/CsvTables/CsvTools.vb:31 — CsvTools.ReadDataTableFromCsvReader 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.
D2 · Cognitive Complexity · Connections.MicrosoftAccessConnection (cognitive 33) · ×1
  • Connections.MicrosoftAccessConnection (cognitive 33) CompuMaster.Data/DataQuery.Connections.vb:242 — Connections.MicrosoftAccessConnection 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.
D2 · Cognitive Complexity · DataTables.CompareValuesOfUnknownType (cognitive 33) · ×1
  • DataTables.CompareValuesOfUnknownType (cognitive 33) CompuMaster.Data/DataTables.vb:3421 — DataTables.CompareValuesOfUnknownType 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.
D2 · Cognitive Complexity · DataTablesTools.ConvertToHtmlTable (cognitive 32) · ×1
  • DataTablesTools.ConvertToHtmlTable (cognitive 32) CompuMaster.Data/DataTablesTools.vb:828 — DataTablesTools.ConvertToHtmlTable has cognitive complexity 32 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · GridEditQuery.RowUpdating_HandleBoundFields (cognitive 30) · ×1
  • GridEditQuery.RowUpdating_HandleBoundFields (cognitive 30) CompuMaster.Data.Web/GridEditQuery.vb:226 — GridEditQuery.RowUpdating_HandleBoundFields has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataProvider.FindIDbDataApaterType (cognitive 29) · ×1
  • DataProvider.FindIDbDataApaterType (cognitive 29) CompuMaster.Data/DataQuery.DataProvider.vb:298 — DataProvider.FindIDbDataApaterType 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. This shape REPEATS in the file: one other method here (DataProvider.FindDbCommandBuilder) 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.
D2 · Cognitive Complexity · DataProvider.FindDbCommandBuilder (cognitive 29) · ×1
  • DataProvider.FindDbCommandBuilder (cognitive 29) CompuMaster.Data/DataQuery.DataProvider.vb:317 — DataProvider.FindDbCommandBuilder 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. This shape REPEATS in the file: one other method here (DataProvider.FindIDbDataApaterType) 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.
D2 · Cognitive Complexity · Connections.MicrosoftAccessOleDbConnection (cognitive 28) · ×1
  • Connections.MicrosoftAccessOleDbConnection (cognitive 28) CompuMaster.Data/DataQuery.Connections.vb:36 — Connections.MicrosoftAccessOleDbConnection has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataProvider.AvailableDataProviders (cognitive 28) · ×1
  • DataProvider.AvailableDataProviders (cognitive 28) CompuMaster.Data/DataQuery.DataProvider.vb:221 — DataProvider.AvailableDataProviders has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · Connections.MicrosoftExcelConnection (cognitive 25) · ×1
  • Connections.MicrosoftExcelConnection (cognitive 25) CompuMaster.Data/DataQuery.Connections.vb:328 — Connections.MicrosoftExcelConnection has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTablesTools.ReArrangeDataColumns (cognitive 25) · ×1
  • DataTablesTools.ReArrangeDataColumns (cognitive 25) CompuMaster.Data/DataTablesTools.vb:1679 — DataTablesTools.ReArrangeDataColumns has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · CsvTools.ConvertDataTableToCsv (cognitive 24) · ×1
  • CsvTools.ConvertDataTableToCsv (cognitive 24) CompuMaster.Data/CsvTables/CsvTools.vb:902 — CsvTools.ConvertDataTableToCsv has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericDictionary (cognitive 24) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericDictionary (cognitive 24) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:951 — AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericDictionary has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableDictionary) 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableDictionary (cognitive 24) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableDictionary (cognitive 24) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1021 — AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableDictionary has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericDictionary) 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.
D2 · Cognitive Complexity · Connections.MicrosoftExcelOleDbConnection (cognitive 22) · ×1
  • Connections.MicrosoftExcelOleDbConnection (cognitive 22) CompuMaster.Data/DataQuery.Connections.vb:445 — Connections.MicrosoftExcelOleDbConnection has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataProvider.FindIDbCommandType (cognitive 22) · ×1
  • DataProvider.FindIDbCommandType (cognitive 22) CompuMaster.Data/DataQuery.DataProvider.vb:281 — DataProvider.FindIDbCommandType has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · CsvTools.WriteDataTableToCsvMemoryStream (cognitive 21) · ×1
  • CsvTools.WriteDataTableToCsvMemoryStream (cognitive 21) CompuMaster.Data/CsvTables/CsvTools.vb:1091 — CsvTools.WriteDataTableToCsvMemoryStream has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (CsvTools.WriteDataViewToCsvFile) 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.
D2 · Cognitive Complexity · CsvTools.WriteDataViewToCsvFile (cognitive 21) · ×1
  • CsvTools.WriteDataViewToCsvFile (cognitive 21) CompuMaster.Data/CsvTables/CsvTools.vb:1215 — CsvTools.WriteDataViewToCsvFile has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (CsvTools.WriteDataTableToCsvMemoryStream) 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericKeyValuePairs (cognitive 21) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericKeyValuePairs (cognitive 21) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:828 — AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericKeyValuePairs has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableKeyValuePairs) 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableKeyValuePairs (cognitive 21) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableKeyValuePairs (cognitive 21) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:887 — AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericNullableKeyValuePairs has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoGenericKeyValuePairs) 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.
D2 · Cognitive Complexity · Connections.MicrosoftAccessOdbcConnection (cognitive 21) · ×1
  • Connections.MicrosoftAccessOdbcConnection (cognitive 21) CompuMaster.Data/DataQuery.Connections.vb:129 — Connections.MicrosoftAccessOdbcConnection has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · TextTable.ToString (cognitive 21) · ×1
  • TextTable.ToString (cognitive 21) CompuMaster.Data/TextTable.vb:394 — TextTable.ToString has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DataTablesTools.LookupUniqueColumnName (cognitive 20) · ×1
  • DataTablesTools.LookupUniqueColumnName (cognitive 20) CompuMaster.Data/DataTablesTools.vb:1579 — DataTablesTools.LookupUniqueColumnName has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · Utils.ReadStringDataFromUri (cognitive 20) · ×1
  • Utils.ReadStringDataFromUri (cognitive 20) CompuMaster.Data/Utils.vb:1656 — Utils.ReadStringDataFromUri has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericList (cognitive 19) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericList (cognitive 19) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:500 — AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericList has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericNullableList) 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericNullableList (cognitive 19) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericNullableList (cognitive 19) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:551 — AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericNullableList has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoGenericList) 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoDictionaryEntryArray (cognitive 19) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoDictionaryEntryArray (cognitive 19) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:668 — AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoDictionaryEntryArray has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoHashtable) 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoHashtable (cognitive 19) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoHashtable (cognitive 19) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:773 — AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoHashtable has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (AnyIDataProvider.ExecuteReaderAndPutFirstTwoColumnsIntoDictionaryEntryArray) 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.
D2 · Cognitive Complexity · DataTablesTools.JoinTables (cognitive 19) · ×1
  • DataTablesTools.JoinTables (cognitive 19) CompuMaster.Data/DataTablesTools.vb:1161 — DataTablesTools.JoinTables has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · TextTable.ToDataTable (cognitive 19) · ×1
  • TextTable.ToDataTable (cognitive 19) CompuMaster.Data/TextTable.vb:197 — TextTable.ToDataTable has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · CsvTools.WriteDataTableToCsvFile (cognitive 18) · ×1
  • CsvTools.WriteDataTableToCsvFile (cognitive 18) CompuMaster.Data/CsvTables/CsvTools.vb:969 — CsvTools.WriteDataTableToCsvFile 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. This shape REPEATS in the file: one other method here (CsvTools.WriteDataViewToCsvFile) 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.
D2 · Cognitive Complexity · CsvTools.WriteDataViewToCsvFile (cognitive 18) · ×1
  • CsvTools.WriteDataViewToCsvFile (cognitive 18) CompuMaster.Data/CsvTables/CsvTools.vb:1272 — CsvTools.WriteDataViewToCsvFile 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. This shape REPEATS in the file: one other method here (CsvTools.WriteDataTableToCsvFile) 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.
D2 · Cognitive Complexity · DataTablesTools.ConvertToPlainTextTableInternal (cognitive 18) · ×1
  • DataTablesTools.ConvertToPlainTextTableInternal (cognitive 18) CompuMaster.Data/DataTablesTools.vb:963 — DataTablesTools.ConvertToPlainTextTableInternal has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · CellCopyingContextMenu.CreateDataTableFromMarkedCells (cognitive 18) · ×1
  • CellCopyingContextMenu.CreateDataTableFromMarkedCells (cognitive 18) CompuMaster.Data.Controls/CellCopyingContextMenu.vb:168 — CellCopyingContextMenu.CreateDataTableFromMarkedCells has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteNonQuery (cognitive 17) · ×1
  • AnyIDataProvider.ExecuteNonQuery (cognitive 17) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:122 — AnyIDataProvider.ExecuteNonQuery has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · Ldap.Query (cognitive 17) · ×1
  • Ldap.Query (cognitive 17) CompuMaster.Data/Ldap.vb:313 — Ldap.Query has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · XlsReader.ReadDataTableFromXlsFile (cognitive 17) · ×1
  • XlsReader.ReadDataTableFromXlsFile (cognitive 17) CompuMaster.Data/XlsReader.vb:33 — XlsReader.ReadDataTableFromXlsFile has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteScalar (cognitive 16) · ×1
  • AnyIDataProvider.ExecuteScalar (cognitive 16) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:286 — AnyIDataProvider.ExecuteScalar 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.
D2 · Cognitive Complexity · AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoArrayList (cognitive 16) · ×1
  • AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoArrayList (cognitive 16) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:452 — AnyIDataProvider.ExecuteReaderAndPutFirstColumnIntoArrayList 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.
D2 · Cognitive Complexity · DataTables.SqlJoin_IsEqual (cognitive 16) · ×1
  • DataTables.SqlJoin_IsEqual (cognitive 16) CompuMaster.Data/DataTables.vb:4630 — DataTables.SqlJoin_IsEqual 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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (97 shared lines) · ×1
  • Near-duplicate member pair (97 shared lines) CompuMaster.Data/DataTables.vb:647 — CompuMaster.Data/DataTables.vb:647-754 | CompuMaster.Data/DataTables.vb:791-898 — These two members are variants of one another: 97 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (47 shared lines) · ×1
  • Near-duplicate member pair (47 shared lines) CompuMaster.Data/DataTables.vb:2531 — CompuMaster.Data/DataTables.vb:2531-2587 | CompuMaster.Data/DataTables.vb:2617-2670 — These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Edited copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) CompuMaster.Data/DataTables.vb:4743 — CompuMaster.Data/DataTables.vb:4743-4772 | CompuMaster.Data/DataTables.vb:4857-4886 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (9 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (9 members, 50+ identical tokens) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:453 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:453-482 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:616-644 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:669-705 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:730-758 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:774-810 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:829-868 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:888-927 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:952-997 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1022-1067 — These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (6 members, 50+ identical tokens) CompuMaster.Data/DataQuery.Connections.vb:39 — CompuMaster.Data/DataQuery.Connections.vb:39-106 | CompuMaster.Data/DataQuery.Connections.vb:131-178 | CompuMaster.Data/DataQuery.Connections.vb:245-316 | CompuMaster.Data/DataQuery.Connections.vb:331-387 | CompuMaster.Data/DataQuery.Connections.vb:402-433 | CompuMaster.Data/DataQuery.Connections.vb:448-499 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:123 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:123-155 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:287-317 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1101-1130 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1143-1169 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1179-1198 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:123 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:123-155 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:172-193 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:287-317 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:378-400 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (29 lines × 2) · ×1
  • Duplicated block (29 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:39 — CompuMaster.Data/DataQuery.Connections.vb:39-67 | CompuMaster.Data/DataQuery.Connections.vb:245-273 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) CompuMaster.Data/DataTables.vb:670 — CompuMaster.Data/DataTables.vb:670-697 | CompuMaster.Data/DataTables.vb:814-841 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) CompuMaster.Data/DataTables.vb:699 — CompuMaster.Data/DataTables.vb:699-724 | CompuMaster.Data/DataTables.vb:843-868 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) CompuMaster.Data/DataTables.vb:647 — CompuMaster.Data/DataTables.vb:647-668 | CompuMaster.Data/DataTables.vb:791-812 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×1
  • Duplicated block (20 lines × 2) CompuMaster.Data/DataTables.vb:2568 — CompuMaster.Data/DataTables.vb:2568-2587 | CompuMaster.Data/DataTables.vb:2651-2670 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×1
  • Duplicated block (18–19 lines × 2) CompuMaster.Data/DataTablesTools.vb:193 — CompuMaster.Data/DataTablesTools.vb:193-211 | CompuMaster.Data/DataTablesTools.vb:243-260 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (16 lines × 3) · ×1
  • Duplicated block (16 lines × 3) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:466 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:466-481 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:689-704 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:794-809 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (16 lines × 6) · ×1
  • Duplicated block (16 lines × 6) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:628 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:628-643 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:742-757 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:852-867 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:911-926 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:981-996 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1051-1066 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) CompuMaster.Data/DataQuery.Connections.vb:52 — CompuMaster.Data/DataQuery.Connections.vb:52-66 | CompuMaster.Data/DataQuery.Connections.vb:131-145 | CompuMaster.Data/DataQuery.Connections.vb:258-272 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) CompuMaster.Data/Ldap.vb:43 — CompuMaster.Data/Ldap.vb:43-57 | CompuMaster.Data/Ldap.vb:318-333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1
  • Duplicated block (14 lines × 3) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1117 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1117-1130 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1156-1169 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1185-1198 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12 lines × 4) · ×1
  • Duplicated block (12 lines × 4) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:144 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:144-155 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:182-193 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:305-316 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:388-399 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CompuMaster.Data/DataQuery.AnyIDataProvider.vb:143` calls `Dispose` and `CompuMaster.Data/DataQuery.AnyIDataProvider.vb:181` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) CompuMaster.Data/DataQuery.AnyIDataProvider.vb:830 — CompuMaster.Data/DataQuery.AnyIDataProvider.vb:830-839 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:889-898 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:953-962 | CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1023-1032 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (11 lines × 4) · ×1
  • Duplicated block (11 lines × 4) CompuMaster.Data/DataTables.vb:2549 — CompuMaster.Data/DataTables.vb:2549-2559 | CompuMaster.Data/DataTables.vb:2566-2576 | CompuMaster.Data/DataTables.vb:2632-2642 | CompuMaster.Data/DataTables.vb:2649-2659 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) CompuMaster.Data/CsvTables/CsvTools.vb:979 — CompuMaster.Data/CsvTables/CsvTools.vb:979-989 | CompuMaster.Data/CsvTables/CsvTools.vb:1229-1239 | CompuMaster.Data/CsvTables/CsvTools.vb:1283-1293 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×1
  • Duplicated block (10 lines × 3) CompuMaster.Data/DataQuery.Connections.vb:344 — CompuMaster.Data/DataQuery.Connections.vb:344-353 | CompuMaster.Data/DataQuery.Connections.vb:402-411 | CompuMaster.Data/DataQuery.Connections.vb:461-470 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1
  • Duplicated block (7 lines × 2) CompuMaster.Data/DataTables.vb:4766 — CompuMaster.Data/DataTables.vb:4766-4772 | CompuMaster.Data/DataTables.vb:4880-4886 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:355 — CompuMaster.Data/DataQuery.Connections.vb:355-362 | CompuMaster.Data/DataQuery.Connections.vb:472-478 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) CompuMaster.Data/DataQuery.Connections.vb:43 — CompuMaster.Data/DataQuery.Connections.vb:43-47 | CompuMaster.Data/DataQuery.Connections.vb:249-253 | CompuMaster.Data/DataQuery.Connections.vb:335-339 | CompuMaster.Data/DataQuery.Connections.vb:452-456 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (5–7 lines × 6) · ×1
  • Duplicated block (5–7 lines × 6) CompuMaster.Data/DataTables.vb:4745 — CompuMaster.Data/DataTables.vb:4745-4751 | CompuMaster.Data/DataTables.vb:4752-4756 | CompuMaster.Data/DataTables.vb:4757-4763 | CompuMaster.Data/DataTables.vb:4859-4865 | CompuMaster.Data/DataTables.vb:4866-4870 | CompuMaster.Data/DataTables.vb:4871-4877 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) CompuMaster.Data/DataQuery.Connections.vb:159 — CompuMaster.Data/DataQuery.Connections.vb:159-163 | CompuMaster.Data/DataQuery.Connections.vb:297-301 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: DataProvider (LCOM4 6) CompuMaster.Data/DataQuery.DataProvider.vb:12 — DataProvider's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 97 finding(s)
D17 · Explicit Debt · ObsoleteWithoutCallers · ×39
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:326 — <Obsolete> ReadDataTableFromCsvString
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:343 — <Obsolete> ReadDataTableFromCsvString
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:624 — <Obsolete> ReadDataTableFromCsvString
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:643 — <Obsolete> ReadDataTableFromCsvString
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:585 — <Obsolete> ReadDataTableFromCsvFile
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:861 — <Obsolete> ConvertDataTableToText
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:876 — <Obsolete> ConvertDataTableToText
  • ObsoleteWithoutCallers CompuMaster.Data/Csv.vb:917 — <Obsolete> WriteDataTableToCsvString
  • ObsoleteWithoutCallers CompuMaster.Data/CsvTables/CsvReadBaseOptions.vb:32 — <Obsolete> CsvContainsColumnHeadersLineCount
  • ObsoleteWithoutCallers CompuMaster.Data/CsvTables/CsvReadOptionsFixedColumnSize.vb:83 — <Obsolete> CultureFormatProvider
  • ObsoleteWithoutCallers CompuMaster.Data/CsvTables/CsvTools.vb:1076 — <Obsolete> WriteDataTableToCsvMemoryStream
  • ObsoleteWithoutCallers CompuMaster.Data/DataQuery.Connections.vb:778 — <Obsolete> AlternativeProvidersProbeResults
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:407 — <Obsolete> FindDuplicates
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:1629 — <Obsolete> GetDataTableViaODBC
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:1641 — <Obsolete> GetDataTableViaSqlClient
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:1666 — <Obsolete> LookupUnqiueColumnName
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:1862 — <Obsolete> ConvertToPlainTextTable
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:1935 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:1976 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:2013 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:2025 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:2038 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:2129 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:2148 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • ObsoleteWithoutCallers CompuMaster.Data/DataTables.vb:2172 — <Obsolete> ConvertToPlainTextTableFixedColumnWidths
  • + 14 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned file · ×29
  • Orphaned file CompuMaster.Data/DataTablesTools.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/CsvTables/CsvTools.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DataQuery.Connections.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/Manipulation.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/Ldap.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/TextTable.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data.Controls/CellCopyingContextMenu.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data.Controls/DataGridView.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DataQuery.DataProvider.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data.Web/GridEditQuery.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/TextRow.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/CsvTables/CsvReadOptionsDynamicColumnSize.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DataQuery.PlatformTools.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data.Web/GridEditDataTable.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/CsvTables/CsvFileOptions.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/Options/ConvertToPlainTextTableOptions.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DatabaseManagement.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DataManipulationResult.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/MsVisualBasicMethods.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/CsvTables/CsvReadOptionsFixedColumnSize.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/XlsReader.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/CsvTables/CsvReadBaseOptions.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/DataQuery.DataException.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file CompuMaster.Data/TextCell.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 4 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×11
  • redundant comment CompuMaster.Data.Controls/CellCopyingContextMenu.vb:143 — "InsertRowsFromClipboardToolStripMenuItem" repeats the code it sits on: 7 of its 7 words (insert, rows, clipboard, tool, strip, menu, item) are already in `Me.InsertRowsFromClipboardToolStripMenuItem.Name = "InsertRowsFromClipboardToolStripMenuItem"`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data.Controls/CellCopyingContextMenu.vb:149 — "PasteFromClipboardToolStripMenuItem" repeats the code it sits on: 6 of its 6 words (paste, clipboard, tool, strip, menu, item) are already in `Me.PasteFromClipboardToolStripMenuItem.Name = "PasteFromClipboardToolStripMenuItem"`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data.Web/GridEditQuery.vb:141 — "Show successful execution state _UpdateStatus = "Data has been successfully uploaded" & vbNewLine & "Records loaded: " & QuickEditRecordCountBefore & vbNewLine …" repeats the code it sits on: 16 of its 20 words (update, status, data, successfully, uploaded, vb, new, line, records, loaded, quick, edit, record, count, affected, changes) are already in `_UpdateStatus &= "Data has been successfully uploaded" & vbNewLine & System.Environment.StackTrace & vbNewLine & "Record …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data.Web/GridEditQuery.vb:216 — "Set the edit index." repeats the code it sits on: 3 of its 3 words (set, edit, index) are already in `Me.EditIndex = e.NewEditIndex`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1246 — "Convert the reader to a data table" repeats the code it sits on: 4 of its 4 words (convert, reader, data, table) are already in `Result = CompuMaster.Data.DataTablesTools.ConvertDataReaderToDataTable(MyReader, tableName)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data/DataQuery.AnyIDataProvider.vb:1360 — "Convert the reader to data tables" repeats the code it sits on: 4 of its 4 words (convert, reader, data, tables) are already in `Dim Result As System.Data.DataSet = CompuMaster.Data.DataTablesTools.ConvertDataReaderToDataSet(MyReader)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data/DataTables.vb:284 — "Rename the new column to the old name" repeats the code it sits on: 4 of its 5 words (new, column, old, name) are already in `newCol.ColumnName = OldColName`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Data/TextTable.vb:302 — "Create new table" repeats the code it sits on: 3 of its 3 words (create, new, table) are already in `Dim Result As TextTable = New TextTable()`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Test.Tools.Data/UtilsTest.vb:89 — "DBNull.Value" repeats the code it sits on: 3 of its 3 words (db, null, value) are already in `ClassicAssert.AreEqual(Nothing, CompuMaster.Data.Utils.NoDBNullArrayFromString(Of String)(DBNull.Value, ","c))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Test.Tools.Data/UtilsTest.vb:123 — "DBNull.Value" repeats the code it sits on: 3 of its 3 words (db, null, value) are already in `ClassicAssert.AreEqual(Nothing, CompuMaster.Data.Utils.NoDBNullArrayFromString(DBNull.Value, ","c, CType(Nothing, String …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment CompuMaster.Test.Tools.Data/UtilsTest.vb:132 — "Assert.AreEqual(New Integer?() {}, CompuMaster.Data.Utils.NoDBNullArrayFromString("", ","c, CType(Nothing, Integer?()))) Single String" repeats the code it sits on: 13 of its 16 words (assert, equal, new, compu, master, data, utils, no, db, null, array, string, nothing) are already in `ClassicAssert.AreEqual(New String() {"Test"}, CompuMaster.Data.Utils.NoDBNullArrayFromString("Test", ","c, CType(Nothing …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D34 · Knowledge Freshness · Most significant orphaned file · ×3
  • Most significant orphaned file CompuMaster.Data/DataTables.vb:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file CompuMaster.Data/Csv.vb:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file CompuMaster.Data/Utils.vb:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D18 · Solution Shape · Thin analysable surface across projects · ×2
  • Thin analysable surface across projects: DebugApp CompuMaster.Data.Controls.Debug/DebugApp.vbproj — 2 project(s) carry only a thin slice of real code; `DebugApp` has 44 significant line(s). The mean analysable-surface weight is 91 %; this project lowers Solution Shape by about 0.4 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: FindOutOfMermoryExceptions FindOutOfMermoryExceptions/FindOutOfMermoryExceptions.vbproj — 2 project(s) carry only a thin slice of real code; `FindOutOfMermoryExceptions` has 45 significant line(s). The mean analysable-surface weight is 91 %; this project lowers Solution Shape by about 0.33 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
D20 · ADR Quality · No ADRs found · ×1
  • 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/`.
D34 · Knowledge Freshness · Dormant codebase · ×1
  • Dormant codebase — 32 of 32 significant files have no living knowledge — the codebase as a whole is dormant, not 32 separate risks. Counted over 32 of the 42 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
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.
M3 · Folder & project structure · No src/ separation · ×1
  • 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'.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation CompuMaster.Data.Controls.Debug/DebugApp.vbproj:177 — `CompuMaster.Data.Controls.Debug/DebugApp.vbproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Minor — 4 finding(s)
D24 · Comment Value · doc comments repeat the names · ×4
  • doc comments repeat the names CompuMaster.Data/Csv.vb:106 — 147 of 1848 documented parameters and 70 of 783 summaries in `CompuMaster.Data(netstandard2.0)` only repeat the member or parameter name (e.g. "Read from a CSV file" for `ReadDataTableFromCsvFile`). 253 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names CompuMaster.Data.Controls/DataGridView.vb:185 — 0 of 12 documented parameters and 2 of 47 summaries in `CompuMaster.Data.Controls(net48)` only repeat the member or parameter name (e.g. "The preserved sorting column index" for `PreservedSortedColumnIndex`). 12 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names CompuMaster.Data.Web/Utils.vb:24 — 1 of 3 documented parameters and 0 of 3 summaries in `CompuMaster.Data.Web` only repeat the member or parameter name (e.g. "The value to be checked" for `CheckValueIfDBNull`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names CompuMaster.Test.Tools.Data/CsvTest.vb:427 — 0 of 2 documented parameters and 0 of 6 summaries in `CompuMaster.Test.Data(net6.0)` only repeat the member or parameter name (e.g. "" for `handler`). 1 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-01199dac9ba447fbb3aaf9af9a4ae7d1/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-01199dac9ba447fbb3aaf9af9a4ae7d1/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude NDoc .15artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnuget—nuget: not applicable — nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan0—
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: 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.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a18841-b16a-7473-a18e-06c819412164 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

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