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

tomitomi3/LibOptimization

Measured 14 November 2026, 12:26 UTC, at code version 323fb61

CAI score 49out of 100 Provisional Up 6 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: 15,074 lines of product code in 17 projects, tests not counted · Estimated rebuild effort: under 0.1 person-years · Weakest lens: Production Readiness, 33

Findings by how serious they are

14 critical 139 serious 71 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 12:26 UTC

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

The code didn't build, so the score is provisional
We couldn't build the code: the build stopped with 66 errors. The dimensions that need a working build, such as complexity, duplication and dead code, were measured on an incomplete picture of the code, so their grades and the score are provisional. Fix the build errors and run the survey again for a final score. The first errors: BC30002: Type 'TestClass' is not defined.; BC30002: Type 'TestMethod' is not defined.; BC30002: Type 'Ignore' is not defined.; BC30002: Type 'TestInitialize' is not defined.

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

36of 36 dimensions measured by tools.
215of 224 findings point to an exact file and line, so you can open each one in the code. The other 9 concern the repository as a whole, such as missing documentation.
36dimensions across 6 lenses, read from 15,074 lines of product code in 17 projects.
Chapters

Executive summary

tomitomi3/LibOptimization has a provisional result, because the code didn't build. Its score is held back because we found no working pipeline that builds or tests changes to the code and no automated security scanning of the code, its secrets or its dependencies. It scores 49 out of 100, and the ratings may change once the code builds. One of its 14 critical findings is a security problem in the packages it uses.

Production Readiness, at 33, is the weakest lens and counts most in the score. The best first step is having someone learn and document the 46 files no active contributor knows, worth about 9 points. Adding an automated build and test pipeline would lift Production Readiness itself, worth about 8 points. Raising Production Readiness to 70 would lift the score to about 60.

One known security hole in a package the code depends on can be used by attackers. Thirteen errors are caught and ignored, so failures can go unnoticed. Updating the vulnerable packages and handling or logging the ignored errors would close both risks.

The product code is 15,074 lines, about €14,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 33 · counts for 46%Maturity 44 · counts for 25%Code Health 66 · counts for 14%Security and Compliance 87 · counts for 8%Architecture 99 · counts for 4%Performance 100 · counts for 2%

If Production Readiness rose from 33 to 70, the lowest score rated Strong, the score would rise from 49 to about 60.

Code composition: what the lines of code are
Business logic 12%Supporting code 10%Tests 7%Generated by tools 71%
New since the last survey: 6 findings

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

  • Code Duplication · Edited copy of a member (137 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb
  • Code Duplication · Edited copy of a member (51 corresponding lines) TestLibOptimization/UnitTestLibOptimization.vb
  • Code Duplication · Edited copy of a member (27 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb
  • Code Duplication · Edited copy of a member (25 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb
  • Incompleteness & stubs · Unfinished branch — throws NotImplementedException SampleCSharp/RosenBrock.cs

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

Fixed since the last survey: 4 findings

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

  • Code Duplication · Duplicated block (22–23 lines × 2) TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb
  • Code Duplication · Duplicated block (18 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb
  • Code Duplication · Duplicated block (5 lines × 2) TestLibOptimization/UnitTestLibOptimization.vb
  • Code Coverage · Coverage not measured — no coverage collector is wired up
Rebuild cost: about €14,000 · Estimate
Cost to rebuild€4,700 to €24,000, for 79 to 251 hours of work, under 0.1 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 49. 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: 15,074 lines of product code
Comment linesThe estimate prices 14,956 lines. Comment lines count towards the size of 15,074 lines but aren't priced as work.
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 46 Orphaned file finding(s) in Knowledge Freshness — start with Module1.vb (2), DenseVector.vb, UnitTestLibOptimization.vb.
Raises the score by about 9 points · Medium effort · Knowledge Freshness
2
Add a CI workflow that builds and runs the test suite on every push/PR.
Raises the score by about 8 points · Medium effort · CI/CD gates
3
Resolve the 11 redundant comment finding(s) in Comment Value — start with clsOptCS.vb (2), clsOptPatternSearch.vb (2), clsOptDE.vb.
Raises the score by about 5 points · Medium effort · Comment Value

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.

If you do one thing first · First action
Fix the build. The code didn't build, so the dimensions that need a working build were measured on an incomplete picture of the code, and every grade in this report is provisional. Once the build works, the next survey gives a final score. The compiler's first errors: BC30002: Type 'TestClass' is not defined.; BC30002: Type 'TestMethod' is not defined.; BC30002: Type 'Ignore' is not defined.; BC30002: Type 'TestInitialize' is not defined.
Based on: Solution Shape
Where the investment is most exposed · Value at risk
This code would cost about €14,000 to build again, under 0.1 person-years of work. Its weakest lens is Production Readiness, at 33 (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.
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.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 10% on every change. The history of the code shows how much it changes: about 14,802 lines over the last 90 days, which is about 60,030 lines a year. At that pace, the extra work comes to an estimated 6.4 to 38.3 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — 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 LibOptimization LibOptimization LibOptimizationDotNet3.0 0 LibOptimizationDotNet3.5 5 LibOptimizationDotNet4.6 6 SampleCSharp SampleCSharp SampleCSharp->LibOptimization SampleVB SampleVB SampleVB->LibOptimization TestCode TestCode TestCode->LibOptimization TestLibOptimization TestLibOptimization TestLibOptimization->LibOptimization TestLibOptimizationDotNet3.0 0 TestLibOptimizationDotNet3.0->LibOptimizationDotNet3.0 TestLibOptimizationDotNet3.5 5 TestLibOptimizationDotNet3.5->LibOptimization

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.

11 modules, with 8 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 LibOptimization.MathTool.RNG2 LibOptimization.My3 Microsoft.VisualBasic4 Microsoft.VisualBasic.CompilerServices5 SampleVB.My6 LibOptimization.MathTool7 LibOptimization.Util8 LibOptimization.Optimization9 LibOptimization.BenchmarkFunction10 SampleCSharp11 SampleVB
1 LibOptimization.MathTool.RNG
2 LibOptimization.My
3 Microsoft.VisualBasic
4 Microsoft.VisualBasic.CompilerServices
5 SampleVB.My
6 LibOptimization.MathTool1
7 LibOptimization.Util25
8 LibOptimization.Optimization52
9 LibOptimization.BenchmarkFunction22
10 SampleCSharp5
11 SampleVB2
Uses a module listed above itPart of a loopThe module itself
1 LibOptimization.MathTool.RNG2 LibOptimization.My3 Microsoft.VisualBasic4 Microsoft.VisualBasic.CompilerServices5 SampleVB.My6 LibOptimization.MathTool7 LibOptimization.Util8 LibOptimization.Optimization9 LibOptimization.BenchmarkFunction10 SampleCSharp11 SampleVBLibOptimization.MathTool.RNG1LibOptimization.My2Microsoft.VisualBasic3Microsoft.VisualBasic.CompilerServices4SampleVB.My5LibOptimization.MathTool6LibOptimization.Util7LibOptimization.Optimization8LibOptimization.BenchmarkFunction9SampleCSharp10SampleVB11125522252

At a glance — Code Health · 66% · Adequate · gated by D2, D18 ·

At a glance — Architecture · 99% · Exemplary ·

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

At a glance — Readiness · 33% · Weak · gated by P1, P3 ·

At a glance — Security · 87% · Strong ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures1High / Critical

Roadmap

Top priorities: Resolve the 46 Orphaned file finding(s) in Knowledge Freshness — start with Module1.vb (2), DenseVector.vb, UnitTestLibOptimization.vb; Add a CI workflow that builds and runs the test suite on every push/PR; 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.

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

Do thisHelpsEffortDimension
Resolve the 46 Orphaned file finding(s) in Knowledge Freshness — start with Module1.vb (2), DenseVector.vb, UnitTestLibOptimization.vb.+8.8 ptsMediumKnowledge Freshness
Add a CI workflow that builds and runs the test suite on every push/PR.+7.7 ptsMediumCI/CD gates
Resolve the 11 redundant comment finding(s) in Comment Value — start with clsOptCS.vb (2), clsOptPatternSearch.vb (2), clsOptDE.vb.+4.9 ptsMediumComment Value
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.+6.7 ptsMediumArchitecture documentation
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.+4.3 ptsMediumRelease Hygiene
Resolve the 1 Build failed finding(s) in Solution Shape.+2.0 ptsLowSolution Shape
Resolve the 13 EmptyCatchBlock finding(s) in Explicit Debt — start with UnitTestLinearAlgebra.vb (13).+2.8 ptsMediumExplicit Debt
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with DenseMatrix.vb, UnitTestLinearAlgebra.vb, clsUtil.vb.+0.8 ptsLowKnowledge Freshness

File quality

Per-file score 0–10 — a quality signature. Of 38 files carrying findings, judged against the Production bar: 3% slop · 58% mixed · 39% near-clean.

FileScoreBandWorst signal
TestLibOptimization/UnitTestLinearAlgebra.vb2.2SlopExplicit Debt: EmptyCatchBlock
LibOptimization/MathTool/DenseMatrix.vb6.0MixedExplicit Debt: ObsoleteWithCallers
LibOptimization/MathTool/DenseVector.vb6.3MixedCognitive Complexity: DenseVector.PrintValue (cognitive 16)
LibOptimization/Optimization/clsOptDE.vb6.5MixedCyclomatic Complexity: clsOptDE.DoIteration (cyclomatic 38)
LibOptimization/Optimization/clsOptDEJADE.vb6.6MixedCyclomatic Complexity: clsOptDEJADE.DoIteration (cyclomatic 23)
TestLibOptimization/UnitTestLibOptimization.vb6.6MixedCognitive Complexity: UnitTestLibOptimization.Opt_IterationCount (cognitive 16)
LibOptimization/Optimization/clsOptCS.vb7.0MixedCyclomatic Complexity: clsOptCS.DoIteration (cyclomatic 18)
LibOptimization/Optimization/clsOptPSO.vb7.0MixedCyclomatic Complexity: clsOptPSO.DoIteration (cyclomatic 20)
TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb7.1MixedCyclomatic Complexity: TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cyclomatic 19)
LibOptimization/Optimization/clsOptNelderMead.vb7.1MixedCognitive Complexity: clsOptNelderMead.DoIteration (cognitive 32)
LibOptimization/Optimization/clsOptPSOAIW.vb7.1MixedCognitive Complexity: clsOptPSOAIW.DoIteration (cognitive 22)
LibOptimization/Util/clsUtil.vb7.2MixedCognitive Complexity: clsUtil.RandomPermutaion (cognitive 21)
SampleVB/Module1.vb7.3MixedGod Classes: MethodTooLong: Module1.Main
LibOptimization/Optimization/clsOptES.vb7.4MixedCyclomatic Complexity: clsOptES.Init (cyclomatic 20)
LibOptimization/Optimization/clsOptPSOCPSO.vb7.4MixedCyclomatic Complexity: clsOptPSOCPSO.DoIteration (cyclomatic 16)
TestCode/Module1.vb7.4MixedCognitive Complexity: clsBenchmark.DisplayStatic (cognitive 30)
LibOptimization/MathTool/MathUtil.vb7.4MixedCognitive Complexity: MathUtil.CreateRandomSymmetricMatrix (cognitive 25)
LibOptimization/Optimization/clsOptRealGABLX.vb7.4MixedCognitive Complexity: clsOptRealGABLX.DoIteration (cognitive 21)
LibOptimization/Optimization/Template/clsOptTemplate.vb7.4MixedCode Duplication: Members sharing a duplicated core (18 members, 50+ identical tokens)
LibOptimization/Optimization/clsOptNelderMeadANMS.vb7.8MixedCyclomatic Complexity: clsOptNelderMeadANMS.DoIteration (cyclomatic 16)

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

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

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

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

Could not be resolved — 8

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 36 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

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

What we checked — 36 dimensions across the health lenses
D1D2D3D4D5D6D13D14D15D17D18D19D24D26D27D28D29D30D34D35D43D44AX10AX3AX4AX5AX8GD1M1M2M3P1P10P3P6PF3

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, 215 of 224 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1da06-736d-7c09-b41a-0a73627edc96.

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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the analyzer environment could not build/run the test suite (a target framework / SDK band or targeting pack the analyzer image doesn't carry). This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. We track the analyzer-image gap so it can be closed.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (2 contributor(s) across 292 commit(s) sampled, automation and bot accounts excluded). One of them holds 100% of the history; the other 1 hold 0% 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.
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Msbuild failed when processing the file 'LibOptimization/LibOptimization.vbproj' with message: The TargetFramework value 'net8.0' was not recognized. It may be misspelled. If not, then the TargetFrameworkIdentifier and/or TargetFrameworkVersion properties must be specified explicitly.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D22 Internal API Consistency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D24 compares a comment's words with the identifiers, literals and constructs of the code it annotates, using English function-word and rationale lexicons. Comments in another script or language were left unread rather than counted as clean.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • M3 Folder & project structure — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 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.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.

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

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • 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.
  • 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 Complexity7.8 / 10Strong✓ 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 7.8 / 10 · rule-coverage 100% · ceiling Prevented

15 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was clsOptDE.DoIteration at 38.

clsOptDE.DoIteration (cyclomatic 38)LibOptimization/Optimization/clsOptDE.vb:206
UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cyclomatic 24)TestLibOptimization/UnitTestLinearAlgebra.vb:496
clsOptDEJADE.DoIteration (cyclomatic 23)LibOptimization/Optimization/clsOptDEJADE.vb:171
clsOptES.Init (cyclomatic 20)LibOptimization/Optimization/clsOptES.vb:82
clsOptPSO.DoIteration (cyclomatic 20)LibOptimization/Optimization/clsOptPSO.vb:169

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

What to do

  1. Bring the 1 body over 30 down to 30 or less in Cyclomatic Complexity — start with clsOptDE.DoIteration (cyclomatic 38). — Refactoring it lifts Cyclomatic Complexity from 7.8 to about 8.1/10.

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

D2 · Cognitive Complexity2.2 / 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.2 / 10 · rule-coverage 100% · ceiling Prevented

44 method(s) exceeded the cognitive complexity threshold of 15; the worst was clsOptDE.DoIteration at 99.

clsOptDE.DoIteration (cognitive 99)LibOptimization/Optimization/clsOptDE.vb:206
clsOptDEJADE.DoIteration (cognitive 60)LibOptimization/Optimization/clsOptDEJADE.vb:171
DenseMatrix.tred2 (cognitive 59)LibOptimization/MathTool/DenseMatrix.vb:1430
clsOptPSO.DoIteration (cognitive 52)LibOptimization/Optimization/clsOptPSO.vb:169
clsBenchRosenblock.Hessian (cognitive 43)LibOptimization/BenchmarkFunctions/clsBenchRosenblock.vb:72

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

What to do

  1. Bring the 1 body over 60 down to 60 or less in Cognitive Complexity — start with clsOptDE.DoIteration (cognitive 99). — Refactoring it lifts Cognitive Complexity from 2.2 to about 3.8/10.

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

D3 · God Classes7.7 / 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.7 / 10 · rule-coverage 100% · ceiling Prevented

15 god class(es) detected.

MethodTooLong: clsUtil.GetOptimizersForUnitTest · ×8LibOptimization/Util/clsUtil.vb:494
TooManyMethods: DenseMatrix · ×4LibOptimization/MathTool/DenseMatrix.vb
FileTooLong: TestLibOptimization/UnitTestLinearAlgebra.vb · ×3TestLibOptimization/UnitTestLinearAlgebra.vb

What to do

  1. Resolve the 8 MethodTooLong finding(s) in God Classes — start with UnitTestLinearAlgebra.vb (3), clsUtil.vb, Module1.vb. — One of this dimension's main actionable groups (8 warning-level).
  2. Resolve the 4 TooManyMethods finding(s) in God Classes — start with DenseMatrix.vb, UnitTestLinearAlgebra.vb, DenseVector.vb. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 3 FileTooLong finding(s) in God Classes — start with UnitTestLinearAlgebra.vb, DenseMatrix.vb, clsUtil.vb. — One of this dimension's main actionable groups (3 warning-level).

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

D4 · Code Duplication5.6 / 10Adequate✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

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

49 duplicated block group(s) detected. 10.9 % of the production lines (1,643 of 15,074) are in a reported copy. A further 9 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 28 of the 58 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (18 lines × 2) · ×4SampleVB/Module1.vb:42
Duplicated block (6 lines × 3) · ×3LibOptimization/Optimization/clsOptPSO.vb:307
Duplicated block (16 lines × 4) · ×2LibOptimization/Optimization/clsOptRealGABLX.vb:128
Duplicated block (13 lines × 2) · ×2LibOptimization/Optimization/clsOptNelderMead.vb:225
Duplicated block (11 lines × 2) · ×2LibOptimization/Optimization/clsOptNewtonMethod.vb:104

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

What to do

  1. Resolve the 4 Duplicated block (18 lines × 2) finding(s) in Code Duplication — start with UnitTestLinearAlgebra.vb (2), Module1.vb, clsOptNelderMead.vb. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 3 Duplicated block (6 lines × 3) finding(s) in Code Duplication — start with clsOptPSO.vb (3). — One of this dimension's main actionable groups (3 warning-level).
  3. Resolve the 2 Duplicated block (16 lines × 4) finding(s) in Code Duplication — start with clsOptRealGABLX.vb, clsOptDEJADE.vb. — One of this dimension's main actionable groups (2 warning-level).

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.5 / 10Stronggated by 2 serious findings✓ 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 9.5 / 10 · rule-coverage 100% · ceiling Verified

14 of 336 classes have LCOM4 above 3.

Low cohesion: DenseVector (LCOM4 14) · ×2LibOptimization/MathTool/DenseVector.vb:8

What to do

  1. Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with DenseVector.vb, DenseMatrix.vb. — One of this dimension's main actionable groups (2 warning-level).

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.8 / 10Stronggated by 2 serious findings✓ 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 9.8 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: LibOptimization/Optimization/clsOptES.vb (2×20=40); LibOptimization/Optimization/clsOptCS.vb (2×18=36)

Hotspot: LibOptimization/Optimization/clsOptES.vb · ×2LibOptimization/Optimization/clsOptES.vb:82

What to do

  1. Resolve the 2 Hotspot finding(s) in Churn × Complexity Hotspots — start with clsOptES.vb, clsOptCS.vb. — One of this dimension's main actionable groups (2 warning-level).

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

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

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

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

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

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

EmptyCatchBlock · ×13TestLibOptimization/UnitTestLinearAlgebra.vb:114
ObsoleteWithCallersLibOptimization/MathTool/DenseMatrix.vb:1294
CommentedOutCodeSampleCSharp/SimulatedAnnealingSample.cs:125

What to do

  1. Resolve the 13 EmptyCatchBlock finding(s) in Explicit Debt — start with UnitTestLinearAlgebra.vb (13). — One of this dimension's main actionable groups (13 issue-level).
  2. Resolve the 1 ObsoleteWithCallers finding(s) in Explicit Debt — start with DenseMatrix.vb. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 CommentedOutCode finding(s) in Explicit Debt — start with SimulatedAnnealingSample.cs. — One of this dimension's main actionable groups (1 warning-level).

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

D18 · Solution Shape3.0 / 10Weak✓ 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 3.0 / 10 · rule-coverage 100% · ceiling Documented

13 projects, 472 source files, 14829 hand-written lines of code (14733 production / 96 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 503 generated (machine-written code — designer, scaffolded and tool-emitted files — excluded from quality), 7 inter-project edges (build failed).

Build failed

What to do

  1. Resolve the 1 Build failed finding(s) in Solution Shape. — One of this dimension's main actionable groups (1 warning-level).

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

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

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

1 of 1 documentation facets pass in full. 1 document(s) read across 2 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D24 · Comment Value3.8 2.4 / 10Critical✓ 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 2.4 / 10 · rule-coverage 62% · ceiling Documented

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

redundant comment · ×11LibOptimization/Optimization/clsOptCS.vb:190
doc comments repeat the names · ×5LibOptimization/MathTool/DenseMatrix.vb:2

What to do

  1. Resolve the 11 redundant comment finding(s) in Comment Value — start with clsOptCS.vb (2), clsOptPatternSearch.vb (2), clsOptDE.vb. — 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.

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

0 of 11 projects flagged as possibly oversized/incoherent.

✓ On the Gold path — maintain.

Detailed fixes: d26_recommendation.md.

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

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

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

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

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

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

semgrep found no security issues.

✓ On the Gold path — maintain.

Detailed fixes: d29_recommendation.md.

D30 · Dependency Vulnerabilities9.4 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

Maturity: Documented → Verified → Prevented · effective 9.4 / 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 CVE finding(s) in Dependency Vulnerabilities. — One of this dimension's main actionable groups (1 issue-level).

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

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

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

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

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

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

Orphaned file · ×46LibOptimization/MathTool/DenseVector.vb:1
Most significant orphaned file · ×3LibOptimization/MathTool/DenseMatrix.vb:1
Dormant codebase

What to do

  1. Resolve the 46 Orphaned file finding(s) in Knowledge Freshness — start with Module1.vb (2), DenseVector.vb, UnitTestLibOptimization.vb. — One of this dimension's main actionable groups (46 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with DenseMatrix.vb, UnitTestLinearAlgebra.vb, clsUtil.vb. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

End-of-life runtime: .NET net5.0TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj:5

What to do

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

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

Frontend & cross-cutting dimensions

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)7.3 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • 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.
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 structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

  • No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.

What to do

  • Add a CI workflow that builds and runs the test suite on every push/PR.
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P3 · Security & performance tooling0.0 / 10Critical✓ 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.

  • No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
  • `TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.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`. — TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj:20

What to do

  • Run what this repository's stack ships: a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

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 Health66%Adequate — gated by D2, D18Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture99%ExemplarySolid.
Maturity44%Weak — gated by D34, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness33%Weak — gated by P1, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security87%StrongSolid.
Performance100%ExemplaryStrongest area.
Unscored — 1 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Not evidenced — 2 control(s) we could not find positive evidence for

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

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

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX6 Interface segregation — 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 — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • D10 Test Quality — ~87 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
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D21 Naming Consistency — Naming consistency does not read Visual Basic yet; not measured.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — small single-context codebase (15,074 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.
  • D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured — analyzer environment
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — IC1 reached only 3% of this repository's production lines — vbnet (14,634 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • M4 Documentation accuracy — Not applicable: the 1 current-state document(s) make no claim of a kind M4 checks.
  • P12 CI test-gate honesty — no CI workflow found
  • P2 Observability — This repo is a library, not a deployed service — it has no process to operate, so production observability (structured logging, tracing/metrics, health checks) is N/A. A library may log via an injected ILogger, but the absence of operational telemetry is not a defect here. If it grows a host (web API, worker), the dimension reactivates.
  • P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
  • P8 Schema migrations — no EF Core usage detected
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found by the two searches this check runs — a BenchmarkDotNet package reference in any project file (loaded, or on disk), and a script whose name contains `benchmark` that this repository's CI runs. Neither can see a suite in another ecosystem's idiom, so this is not a verdict that the repository has none. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted, and nothing is asked of a repository that has none.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch — X12 reached only 3% of this repository's production lines — vbnet (14,634 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — X16 reached only 3% of this repository's production lines — vbnet (14,634 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no async method does work a token could cancel
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X5 Nullable reference types — no NRT-eligible projects
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 14 finding(s)
D17 · Explicit Debt · EmptyCatchBlock · ×13
  • EmptyCatchBlock TestLibOptimization/UnitTestLinearAlgebra.vb:114 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:131 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:234 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:251 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:685 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:749 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1246 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1389 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1399 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1409 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1419 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1450 — 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 TestLibOptimization/UnitTestLinearAlgebra.vb:1480 — 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.
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
Serious — 139 finding(s)
D3 · God Classes · MethodTooLong · ×8
  • MethodTooLong: clsUtil.GetOptimizersForUnitTest LibOptimization/Util/clsUtil.vb:494 — MethodTooLong — GetOptimizersForUnitTest runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: UnitTestLinearAlgebra.Vec_Product_VectorMatrix TestLibOptimization/UnitTestLinearAlgebra.vb:496 — MethodTooLong — Vec_Product_VectorMatrix runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Module1.Main SampleVB/Module1.vb:13 — MethodTooLong — Main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: UnitTestLinearAlgebra.Mat_Product_MatrixVector TestLibOptimization/UnitTestLinearAlgebra.vb:274 — MethodTooLong — Mat_Product_MatrixVector runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× 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: TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:114 — MethodTooLong — Mat_Product_MatrixVectorNET30 runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× 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: clsOptDE.DoIteration LibOptimization/Optimization/clsOptDE.vb:206 — MethodTooLong — DoIteration runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: clsOptDEJADE.DoIteration LibOptimization/Optimization/clsOptDEJADE.vb:171 — MethodTooLong — DoIteration runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: UnitTestLinearAlgebra.Mat_Inverse TestLibOptimization/UnitTestLinearAlgebra.vb:960 — MethodTooLong — Mat_Inverse runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D3 · God Classes · TooManyMethods · ×4
  • TooManyMethods: DenseMatrix LibOptimization/MathTool/DenseMatrix.vb — TooManyMethods — 990 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 30 methods; this is 25 over it, 1.83× 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: UnitTestLinearAlgebra TestLibOptimization/UnitTestLinearAlgebra.vb — TooManyMethods — 1076 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: DenseVector LibOptimization/MathTool/DenseVector.vb — TooManyMethods — 308 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: clsUtil LibOptimization/Util/clsUtil.vb — TooManyMethods — 524 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 (18 lines × 2) · ×4
  • Duplicated block (18 lines × 2) SampleVB/Module1.vb:42 — SampleVB/Module1.vb:42-59 | SampleVB/Module1.vb:63-80 — 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) LibOptimization/Optimization/clsOptNelderMead.vb:128 — LibOptimization/Optimization/clsOptNelderMead.vb:128-145 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-144 — before extracting anything, compare `LibOptimization/Optimization/clsOptNelderMead.vb` and `LibOptimization/Optimization/clsOptNelderMeadWiki.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (18 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:35 — TestLibOptimization/UnitTestLinearAlgebra.vb:35-52 | TestLibOptimization/UnitTestLinearAlgebra.vb:57-74 — 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) TestLibOptimization/UnitTestLinearAlgebra.vb:671 — TestLibOptimization/UnitTestLinearAlgebra.vb:671-688 | TestLibOptimization/UnitTestLinearAlgebra.vb:735-752 — 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 · FileTooLong · ×3
  • FileTooLong: TestLibOptimization/UnitTestLinearAlgebra.vb TestLibOptimization/UnitTestLinearAlgebra.vb — FileTooLong — 1079 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 579 over it, 2.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: MathTool/DenseMatrix.vb LibOptimization/MathTool/DenseMatrix.vb — FileTooLong — 992 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 492 over it, 1.98× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Util/clsUtil.vb LibOptimization/Util/clsUtil.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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×3
  • Duplicated block (6 lines × 3) LibOptimization/Optimization/clsOptPSO.vb:307 — LibOptimization/Optimization/clsOptPSO.vb:307-312 | LibOptimization/Optimization/clsOptPSOAIW.vb:235-240 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:255-260 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSO.vb` and `LibOptimization/Optimization/clsOptPSOAIW.vb` as WHOLE FILES: 85% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 3) LibOptimization/Optimization/clsOptPSO.vb:307 — LibOptimization/Optimization/clsOptPSO.vb:307-312 | LibOptimization/Optimization/clsOptPSOAIW.vb:235-240 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:255-260 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSO.vb` and `LibOptimization/Optimization/clsOptPSOAIW.vb` as WHOLE FILES: 85% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 3) LibOptimization/Optimization/clsOptPSO.vb:307 — LibOptimization/Optimization/clsOptPSO.vb:307-312 | LibOptimization/Optimization/clsOptPSOAIW.vb:235-240 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:255-260 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSO.vb` and `LibOptimization/Optimization/clsOptPSOAIW.vb` as WHOLE FILES: 85% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D15 · Churn × Complexity Hotspots · Hotspot · ×2
  • Hotspot: LibOptimization/Optimization/clsOptES.vb LibOptimization/Optimization/clsOptES.vb:82 — LibOptimization/Optimization/clsOptES.vb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in clsOptES.Init at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2024-11-14..2025-02-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2024-11-14 16:50:46 +09:00' --until='2025-02-12 16:50:46 +09:00' --full-history --no-merges -- LibOptimization/Optimization/clsOptES.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: LibOptimization/Optimization/clsOptCS.vb LibOptimization/Optimization/clsOptCS.vb:138 — LibOptimization/Optimization/clsOptCS.vb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in clsOptCS.DoIteration at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2024-11-14..2025-02-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2024-11-14 16:50:46 +09:00' --until='2025-02-12 16:50:46 +09:00' --full-history --no-merges -- LibOptimization/Optimization/clsOptCS.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication · Duplicated block (16 lines × 4) · ×2
  • Duplicated block (16 lines × 4) LibOptimization/Optimization/clsOptRealGABLX.vb:128 — LibOptimization/Optimization/clsOptRealGABLX.vb:128-143 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-147 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-155 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-151 — before extracting anything, compare `LibOptimization/Optimization/clsOptRealGABLX.vb` and `LibOptimization/Optimization/clsOptRealGAPCX.vb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (16 lines × 4) LibOptimization/Optimization/clsOptDEJADE.vb:173 — LibOptimization/Optimization/clsOptDEJADE.vb:173-189 | LibOptimization/Optimization/clsOptHillClimbing.vb:103-118 | LibOptimization/Optimization/clsOptPatternSearch.vb:97-112 | LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:151-166 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×2
  • Duplicated block (13 lines × 2) LibOptimization/Optimization/clsOptNelderMead.vb:225 — LibOptimization/Optimization/clsOptNelderMead.vb:225-237 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:216-228 — before extracting anything, compare `LibOptimization/Optimization/clsOptNelderMead.vb` and `LibOptimization/Optimization/clsOptNelderMeadWiki.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:773 — TestLibOptimization/UnitTestLinearAlgebra.vb:773-785 | TestLibOptimization/UnitTestLinearAlgebra.vb:806-818 — 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) LibOptimization/Optimization/clsOptNewtonMethod.vb:104 — LibOptimization/Optimization/clsOptNewtonMethod.vb:104-114 | LibOptimization/Optimization/clsOptSteepestDescent.vb:105-115 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (11 lines × 2) LibOptimization/Optimization/clsOptRealGAREX.vb:190 — LibOptimization/Optimization/clsOptRealGAREX.vb:190-200 | LibOptimization/Optimization/clsOptRealGASPX.vb:187-197 — before extracting anything, compare `LibOptimization/Optimization/clsOptRealGAREX.vb` and `LibOptimization/Optimization/clsOptRealGASPX.vb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×2
  • Duplicated block (10 lines × 2) LibOptimization/Optimization/clsOptNelderMead.vb:252 — LibOptimization/Optimization/clsOptNelderMead.vb:252-261 | LibOptimization/Optimization/clsOptNelderMead.vb:300-309 — 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) TestLibOptimization/UnitTestLinearAlgebra.vb:761 — TestLibOptimization/UnitTestLinearAlgebra.vb:761-770 | TestLibOptimization/UnitTestLinearAlgebra.vb:794-803 — 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 (25–27 lines × 2) · ×2
  • Duplicated block (25–27 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:338 — TestLibOptimization/UnitTestLinearAlgebra.vb:338-362 | TestLibOptimization/UnitTestLinearAlgebra.vb:366-392 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `TestLibOptimization/UnitTestLinearAlgebra.vb:334` calls `PrintValue` and `TestLibOptimization/UnitTestLinearAlgebra.vb:362` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (25–27 lines × 2) TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:178 — TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:178-202 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:206-232 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:174` calls `PrintValue` and `TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:202` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (20 lines × 3) · ×2
  • Duplicated block (20 lines × 3) TestLibOptimization/UnitTestLinearAlgebra.vb:335 — TestLibOptimization/UnitTestLinearAlgebra.vb:335-354 | TestLibOptimization/UnitTestLinearAlgebra.vb:363-382 | TestLibOptimization/UnitTestLinearAlgebra.vb:393-412 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `TestLibOptimization/UnitTestLinearAlgebra.vb:334` calls `PrintValue` and `TestLibOptimization/UnitTestLinearAlgebra.vb:362` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (20 lines × 3) TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:175 — TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:175-194 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:203-222 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:233-252 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:174` calls `PrintValue` and `TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:202` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D6 · Cohesion (LCOM4) · Low cohesion · ×2
  • Low cohesion: DenseVector (LCOM4 14) LibOptimization/MathTool/DenseVector.vb:8 — DenseVector's methods fall into 14 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 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: DenseMatrix (LCOM4 6) LibOptimization/MathTool/DenseMatrix.vb:9 — DenseMatrix'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.
D1 · Cyclomatic Complexity · clsOptDE.DoIteration (cyclomatic 38) · ×1
  • clsOptDE.DoIteration (cyclomatic 38) LibOptimization/Optimization/clsOptDE.vb:206 — clsOptDE.DoIteration 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: LibOptimization/Optimization/clsOptDE.vb holds 2 of the 15 methods over the threshold — including the worst — and 26 of the 78 points over it (33%), 2× the next-largest file (TestLibOptimization/UnitTestLinearAlgebra.vb at 13). 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 · UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cyclomatic 24) · ×1
  • UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cyclomatic 24) TestLibOptimization/UnitTestLinearAlgebra.vb:496 — UnitTestLinearAlgebra.Vec_Product_VectorMatrix has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · clsOptDEJADE.DoIteration (cyclomatic 23) · ×1
  • clsOptDEJADE.DoIteration (cyclomatic 23) LibOptimization/Optimization/clsOptDEJADE.vb:171 — clsOptDEJADE.DoIteration has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · clsOptES.Init (cyclomatic 20) · ×1
  • clsOptES.Init (cyclomatic 20) LibOptimization/Optimization/clsOptES.vb:82 — clsOptES.Init has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · clsOptPSO.DoIteration (cyclomatic 20) · ×1
  • clsOptPSO.DoIteration (cyclomatic 20) LibOptimization/Optimization/clsOptPSO.vb:169 — clsOptPSO.DoIteration has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · UnitTestLinearAlgebra.Mat_Product_MatrixVector (cyclomatic 19) · ×1
  • UnitTestLinearAlgebra.Mat_Product_MatrixVector (cyclomatic 19) TestLibOptimization/UnitTestLinearAlgebra.vb:274 — UnitTestLinearAlgebra.Mat_Product_MatrixVector 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 · DenseMatrix.LUP (cyclomatic 19) · ×1
  • DenseMatrix.LUP (cyclomatic 19) LibOptimization/MathTool/DenseMatrix.vb:1139 — DenseMatrix.LUP 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 · TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cyclomatic 19) · ×1
  • TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cyclomatic 19) TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:114 — TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 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 · DenseMatrix.tred2 (cyclomatic 18) · ×1
  • DenseMatrix.tred2 (cyclomatic 18) LibOptimization/MathTool/DenseMatrix.vb:1430 — DenseMatrix.tred2 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 · clsOptCS.DoIteration (cyclomatic 18) · ×1
  • clsOptCS.DoIteration (cyclomatic 18) LibOptimization/Optimization/clsOptCS.vb:138 — clsOptCS.DoIteration 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 · clsOptDE.Init (cyclomatic 18) · ×1
  • clsOptDE.Init (cyclomatic 18) LibOptimization/Optimization/clsOptDE.vb:128 — clsOptDE.Init 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: LibOptimization/Optimization/clsOptDE.vb holds 2 of the 15 methods over the threshold — including the worst — and 26 of the 78 points over it (33%), 2× the next-largest file (TestLibOptimization/UnitTestLinearAlgebra.vb at 13). 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 · clsOptDEJADE.Init (cyclomatic 18) · ×1
  • clsOptDEJADE.Init (cyclomatic 18) LibOptimization/Optimization/clsOptDEJADE.vb:89 — clsOptDEJADE.Init 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 · DenseMatrix.Inverse (cyclomatic 17) · ×1
  • DenseMatrix.Inverse (cyclomatic 17) LibOptimization/MathTool/DenseMatrix.vb:1056 — DenseMatrix.Inverse 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 · clsOptNelderMeadANMS.DoIteration (cyclomatic 16) · ×1
  • clsOptNelderMeadANMS.DoIteration (cyclomatic 16) LibOptimization/Optimization/clsOptNelderMeadANMS.vb:130 — clsOptNelderMeadANMS.DoIteration has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · clsOptPSOCPSO.DoIteration (cyclomatic 16) · ×1
  • clsOptPSOCPSO.DoIteration (cyclomatic 16) LibOptimization/Optimization/clsOptPSOCPSO.vb:168 — clsOptPSOCPSO.DoIteration has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D17 · Explicit Debt · ObsoleteWithCallers · ×1
  • ObsoleteWithCallers LibOptimization/MathTool/DenseMatrix.vb:1294 — <Obsolete> EigenJacobi
D17 · Explicit Debt · CommentedOutCode · ×1
  • CommentedOutCode SampleCSharp/SimulatedAnnealingSample.cs:125 — 3 consecutive commented-code lines
D18 · Solution Shape · Build failed · ×1
  • Build failed — The target solution did not build cleanly (errors: 66), which caps Solution Shape at 3/10 — the most basic shape signal is that it compiles. First errors: BC30002: Type 'TestClass' is not defined.; BC30002: Type 'TestMethod' is not defined.; BC30002: Type 'Ignore' is not defined.; BC30002: Type 'TestInitialize' is not defined..
D2 · Cognitive Complexity · clsOptDE.DoIteration (cognitive 99) · ×1
  • clsOptDE.DoIteration (cognitive 99) LibOptimization/Optimization/clsOptDE.vb:206 — clsOptDE.DoIteration has cognitive complexity 99 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · clsOptDEJADE.DoIteration (cognitive 60) · ×1
  • clsOptDEJADE.DoIteration (cognitive 60) LibOptimization/Optimization/clsOptDEJADE.vb:171 — clsOptDEJADE.DoIteration has cognitive complexity 60 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · DenseMatrix.tred2 (cognitive 59) · ×1
  • DenseMatrix.tred2 (cognitive 59) LibOptimization/MathTool/DenseMatrix.vb:1430 — DenseMatrix.tred2 has cognitive complexity 59 (threshold 15). To reduce it, flatten the nesting: invert conditions into 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 · clsOptPSO.DoIteration (cognitive 52) · ×1
  • clsOptPSO.DoIteration (cognitive 52) LibOptimization/Optimization/clsOptPSO.vb:169 — clsOptPSO.DoIteration has cognitive complexity 52 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · clsBenchRosenblock.Hessian (cognitive 43) · ×1
  • clsBenchRosenblock.Hessian (cognitive 43) LibOptimization/BenchmarkFunctions/clsBenchRosenblock.vb:72 — clsBenchRosenblock.Hessian has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · clsOptCS.DoIteration (cognitive 40) · ×1
  • clsOptCS.DoIteration (cognitive 40) LibOptimization/Optimization/clsOptCS.vb:138 — clsOptCS.DoIteration 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 · DenseMatrix.LUP (cognitive 37) · ×1
  • DenseMatrix.LUP (cognitive 37) LibOptimization/MathTool/DenseMatrix.vb:1139 — DenseMatrix.LUP 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 · DenseMatrix.tqli (cognitive 37) · ×1
  • DenseMatrix.tqli (cognitive 37) LibOptimization/MathTool/DenseMatrix.vb:1544 — DenseMatrix.tqli 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 · clsOptPSOCPSO.DoIteration (cognitive 37) · ×1
  • clsOptPSOCPSO.DoIteration (cognitive 37) LibOptimization/Optimization/clsOptPSOCPSO.vb:168 — clsOptPSOCPSO.DoIteration 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 · clsOptNelderMeadANMS.DoIteration (cognitive 33) · ×1
  • clsOptNelderMeadANMS.DoIteration (cognitive 33) LibOptimization/Optimization/clsOptNelderMeadANMS.vb:130 — clsOptNelderMeadANMS.DoIteration 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 · DenseMatrix.Inverse (cognitive 32) · ×1
  • DenseMatrix.Inverse (cognitive 32) LibOptimization/MathTool/DenseMatrix.vb:1056 — DenseMatrix.Inverse 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 · clsOptNelderMead.DoIteration (cognitive 32) · ×1
  • clsOptNelderMead.DoIteration (cognitive 32) LibOptimization/Optimization/clsOptNelderMead.vb:126 — clsOptNelderMead.DoIteration 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 · clsOptES.Init (cognitive 31) · ×1
  • clsOptES.Init (cognitive 31) LibOptimization/Optimization/clsOptES.vb:82 — clsOptES.Init has cognitive complexity 31 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · clsBenchmark.DisplayStatic (cognitive 30) · ×1
  • clsBenchmark.DisplayStatic (cognitive 30) TestCode/Module1.vb:74 — clsBenchmark.DisplayStatic 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 · clsOptDE.Init (cognitive 29) · ×1
  • clsOptDE.Init (cognitive 29) LibOptimization/Optimization/clsOptDE.vb:128 — clsOptDE.Init 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.
D2 · Cognitive Complexity · clsOptDEJADE.Init (cognitive 29) · ×1
  • clsOptDEJADE.Init (cognitive 29) LibOptimization/Optimization/clsOptDEJADE.vb:89 — clsOptDEJADE.Init 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.
D2 · Cognitive Complexity · UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cognitive 27) · ×1
  • UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cognitive 27) TestLibOptimization/UnitTestLinearAlgebra.vb:496 — UnitTestLinearAlgebra.Vec_Product_VectorMatrix has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · Module1.BenchmarkLU (cognitive 27) · ×1
  • Module1.BenchmarkLU (cognitive 27) TestCode/Module1.vb:184 — Module1.BenchmarkLU has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · MathUtil.CreateRandomSymmetricMatrix (cognitive 25) · ×1
  • MathUtil.CreateRandomSymmetricMatrix (cognitive 25) LibOptimization/MathTool/MathUtil.vb:51 — MathUtil.CreateRandomSymmetricMatrix 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 · clsOptFA.DoIteration (cognitive 25) · ×1
  • clsOptFA.DoIteration (cognitive 25) LibOptimization/Optimization/clsOptFA.vb:147 — clsOptFA.DoIteration 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 · clsOptPSOChaoticIW.DoIteration (cognitive 25) · ×1
  • clsOptPSOChaoticIW.DoIteration (cognitive 25) LibOptimization/Optimization/clsOptPSOChaoticIW.vb:151 — clsOptPSOChaoticIW.DoIteration 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 · UnitTestLinearAlgebra.Mat_Inverse (cognitive 24) · ×1
  • UnitTestLinearAlgebra.Mat_Inverse (cognitive 24) TestLibOptimization/UnitTestLinearAlgebra.vb:960 — UnitTestLinearAlgebra.Mat_Inverse 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 · clsOptNelderMeadWiki.DoIteration (cognitive 24) · ×1
  • clsOptNelderMeadWiki.DoIteration (cognitive 24) LibOptimization/Optimization/clsOptNelderMeadWiki.vb:125 — clsOptNelderMeadWiki.DoIteration 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 · MathUtil.CreateRandomASymmetricMatrix (cognitive 22) · ×1
  • MathUtil.CreateRandomASymmetricMatrix (cognitive 22) LibOptimization/MathTool/MathUtil.vb:101 — MathUtil.CreateRandomASymmetricMatrix 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 · clsOptPSOAIW.DoIteration (cognitive 22) · ×1
  • clsOptPSOAIW.DoIteration (cognitive 22) LibOptimization/Optimization/clsOptPSOAIW.vb:140 — clsOptPSOAIW.DoIteration 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 · UnitTestLinearAlgebra.Mat_Product_MatrixVector (cognitive 21) · ×1
  • UnitTestLinearAlgebra.Mat_Product_MatrixVector (cognitive 21) TestLibOptimization/UnitTestLinearAlgebra.vb:274 — UnitTestLinearAlgebra.Mat_Product_MatrixVector 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 · clsOptPSOLDIW.DoIteration (cognitive 21) · ×1
  • clsOptPSOLDIW.DoIteration (cognitive 21) LibOptimization/Optimization/clsOptPSOLDIW.vb:149 — clsOptPSOLDIW.DoIteration 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 · clsOptRealGABLX.DoIteration (cognitive 21) · ×1
  • clsOptRealGABLX.DoIteration (cognitive 21) LibOptimization/Optimization/clsOptRealGABLX.vb:126 — clsOptRealGABLX.DoIteration 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 · clsUtil.RandomPermutaion (cognitive 21) · ×1
  • clsUtil.RandomPermutaion (cognitive 21) LibOptimization/Util/clsUtil.vb:37 — clsUtil.RandomPermutaion 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 · TestLibOptimizationDotNet30.Opt_OptimizeSphere_2D_NET35 (cognitive 21) · ×1
  • TestLibOptimizationDotNet30.Opt_OptimizeSphere_2D_NET35 (cognitive 21) TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:13 — TestLibOptimizationDotNet30.Opt_OptimizeSphere_2D_NET35 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 · TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cognitive 21) · ×1
  • TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cognitive 21) TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:114 — TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 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 · clsOptPSO.Init (cognitive 20) · ×1
  • clsOptPSO.Init (cognitive 20) LibOptimization/Optimization/clsOptPSO.vb:87 — clsOptPSO.Init 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 · clsOptPSOCPSO.Init (cognitive 20) · ×1
  • clsOptPSOCPSO.Init (cognitive 20) LibOptimization/Optimization/clsOptPSOCPSO.vb:77 — clsOptPSOCPSO.Init 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 · DenseMatrix.EigenJacobi (cognitive 19) · ×1
  • DenseMatrix.EigenJacobi (cognitive 19) LibOptimization/MathTool/DenseMatrix.vb:1294 — DenseMatrix.EigenJacobi 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 · clsOptSimulatedAnnealing.DoIteration (cognitive 19) · ×1
  • clsOptSimulatedAnnealing.DoIteration (cognitive 19) LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:149 — clsOptSimulatedAnnealing.DoIteration has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 · Cognitive Complexity · Program.Main (cognitive 18) · ×1
  • Program.Main (cognitive 18) SampleCSharp/Program.cs:79 — Program.Main has cognitive complexity 18 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · UnitTestLinearAlgebra.Mat_CreateMatrix (cognitive 18) · ×1
  • UnitTestLinearAlgebra.Mat_CreateMatrix (cognitive 18) TestLibOptimization/UnitTestLinearAlgebra.vb:28 — UnitTestLinearAlgebra.Mat_CreateMatrix 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 · clsOptRealGAPCX.CrossoverPCX (cognitive 18) · ×1
  • clsOptRealGAPCX.CrossoverPCX (cognitive 18) LibOptimization/Optimization/clsOptRealGAPCX.vb:251 — clsOptRealGAPCX.CrossoverPCX 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 · clsOptRealGAUNDX.SelectRoulette (cognitive 18) · ×1
  • clsOptRealGAUNDX.SelectRoulette (cognitive 18) LibOptimization/Optimization/clsOptRealGAUNDX.vb:205 — clsOptRealGAUNDX.SelectRoulette 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 · UnitTestLinearAlgebra.Mat_Product_MatrixMatrix (cognitive 16) · ×1
  • UnitTestLinearAlgebra.Mat_Product_MatrixMatrix (cognitive 16) TestLibOptimization/UnitTestLinearAlgebra.vb:824 — UnitTestLinearAlgebra.Mat_Product_MatrixMatrix 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 · UnitTestLibOptimization.Opt_IterationCount (cognitive 16) · ×1
  • UnitTestLibOptimization.Opt_IterationCount (cognitive 16) TestLibOptimization/UnitTestLibOptimization.vb:309 — UnitTestLibOptimization.Opt_IterationCount 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 · DenseMatrix.Cholesky (cognitive 16) · ×1
  • DenseMatrix.Cholesky (cognitive 16) LibOptimization/MathTool/DenseMatrix.vb:1245 — DenseMatrix.Cholesky 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 · DenseVector.PrintValue (cognitive 16) · ×1
  • DenseVector.PrintValue (cognitive 16) LibOptimization/MathTool/DenseVector.vb:383 — DenseVector.PrintValue 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 · clsOptES.DoIteration (cognitive 16) · ×1
  • clsOptES.DoIteration (cognitive 16) LibOptimization/Optimization/clsOptES.vb:168 — clsOptES.DoIteration has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D4 · Code Duplication · Members sharing a duplicated core (18 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (18 members, 50+ identical tokens) LibOptimization/Optimization/Template/clsOptTemplate.vb:107 — LibOptimization/Optimization/Template/clsOptTemplate.vb:107-135 | LibOptimization/Optimization/clsOptDE.vb:208-342 | LibOptimization/Optimization/clsOptDEJADE.vb:173-320 | LibOptimization/Optimization/clsOptFA.vb:149-193 | LibOptimization/Optimization/clsOptHillClimbing.vb:103-129 | LibOptimization/Optimization/clsOptNelderMead.vb:128-188 | LibOptimization/Optimization/clsOptNelderMeadANMS.vb:132-239 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-179 | LibOptimization/Optimization/clsOptPSOAIW.vb:142-202 | LibOptimization/Optimization/clsOptPSOCPSO.vb:170-269 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:153-222 | LibOptimization/Optimization/clsOptPSOLDIW.vb:151-205 | LibOptimization/Optimization/clsOptPatternSearch.vb:97-136 | LibOptimization/Optimization/clsOptRealGABLX.vb:128-187 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-187 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-179 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-176 | LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:151-202 — These 18 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 18 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 18 times.
D4 · Code Duplication · Duplicated block (26–28 lines × 3) · ×1
  • Duplicated block (26–28 lines × 3) LibOptimization/Optimization/clsOptRealGABLX.vb:130 — LibOptimization/Optimization/clsOptRealGABLX.vb:130-155 | LibOptimization/Optimization/clsOptRealGAPCX.vb:134-161 | LibOptimization/Optimization/clsOptRealGASPX.vb:138-163 — before extracting anything, compare `LibOptimization/Optimization/clsOptRealGABLX.vb` and `LibOptimization/Optimization/clsOptRealGAPCX.vb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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 (27–28 lines × 2) · ×1
  • Duplicated block (27–28 lines × 2) SampleCSharp/Program.cs:154 — SampleCSharp/Program.cs:154-180 | SampleCSharp/Program.cs:187-214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `SampleCSharp/Program.cs:154` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (17–20 lines × 2) · ×1
  • Duplicated block (17–20 lines × 2) LibOptimization/Optimization/clsOptDE.vb:219 — LibOptimization/Optimization/clsOptDE.vb:219-235 | LibOptimization/Optimization/clsOptDEJADE.vb:183-202 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `LibOptimization/Optimization/clsOptDE.vb:218` calls `clsPoint` and `LibOptimization/Optimization/clsOptDEJADE.vb:182` 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 (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) LibOptimization/Optimization/clsOptPSOAIW.vb:150 — LibOptimization/Optimization/clsOptPSOAIW.vb:150-168 | LibOptimization/Optimization/clsOptPSOLDIW.vb:159-177 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSOAIW.vb` and `LibOptimization/Optimization/clsOptPSOLDIW.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (18 lines × 4) · ×1
  • Duplicated block (18 lines × 4) LibOptimization/Optimization/clsOptPSOAIW.vb:142 — LibOptimization/Optimization/clsOptPSOAIW.vb:142-159 | LibOptimization/Optimization/clsOptPSOCPSO.vb:170-187 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:153-170 | LibOptimization/Optimization/clsOptPSOLDIW.vb:151-168 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSOAIW.vb` and `LibOptimization/Optimization/clsOptPSOCPSO.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LibOptimization/Optimization/clsOptPSOCPSO.vb:188` calls `IsCriterion`, `m_swarm` and `LibOptimization/Optimization/clsOptPSOAIW.vb:161` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (13 lines × 8) · ×1
  • Duplicated block (13 lines × 8) LibOptimization/Optimization/Template/clsOptTemplate.vb:107 — LibOptimization/Optimization/Template/clsOptTemplate.vb:107-119 | LibOptimization/Optimization/clsOptFA.vb:149-161 | LibOptimization/Optimization/clsOptNelderMead.vb:128-140 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-139 | LibOptimization/Optimization/clsOptRealGABLX.vb:128-140 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-144 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-152 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-148 — before extracting anything, compare `LibOptimization/Optimization/clsOptNelderMead.vb` and `LibOptimization/Optimization/clsOptNelderMeadWiki.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (14–15 lines × 3) · ×1
  • Duplicated block (14–15 lines × 3) LibOptimization/Optimization/clsOptPSOAIW.vb:163 — LibOptimization/Optimization/clsOptPSOAIW.vb:163-176 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:187-200 | LibOptimization/Optimization/clsOptPSOLDIW.vb:171-185 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSOAIW.vb` and `LibOptimization/Optimization/clsOptPSOChaoticIW.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1
  • Duplicated block (14 lines × 3) LibOptimization/Optimization/clsOptNelderMead.vb:138 — LibOptimization/Optimization/clsOptNelderMead.vb:138-154 | LibOptimization/Optimization/clsOptNelderMeadANMS.vb:144-157 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:137-153 — before extracting anything, compare `LibOptimization/Optimization/clsOptNelderMead.vb` and `LibOptimization/Optimization/clsOptNelderMeadWiki.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (13 lines × 16) · ×1
  • Duplicated block (13 lines × 16) LibOptimization/Optimization/Template/clsOptTemplate.vb:107 — LibOptimization/Optimization/Template/clsOptTemplate.vb:107-119 | LibOptimization/Optimization/clsOptDEJADE.vb:173-185 | LibOptimization/Optimization/clsOptFA.vb:149-161 | LibOptimization/Optimization/clsOptHillClimbing.vb:103-115 | LibOptimization/Optimization/clsOptNelderMead.vb:128-140 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-139 | LibOptimization/Optimization/clsOptPSOAIW.vb:142-154 | LibOptimization/Optimization/clsOptPSOCPSO.vb:170-182 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:153-165 | LibOptimization/Optimization/clsOptPSOLDIW.vb:151-163 | LibOptimization/Optimization/clsOptPatternSearch.vb:97-109 | LibOptimization/Optimization/clsOptRealGABLX.vb:128-140 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-144 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-152 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-148 | LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:151-163 — before extracting anything, compare `LibOptimization/Optimization/clsOptNelderMead.vb` and `LibOptimization/Optimization/clsOptNelderMeadWiki.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) LibOptimization/Optimization/clsOptNewtonMethod.vb:76 — LibOptimization/Optimization/clsOptNewtonMethod.vb:76-85 | LibOptimization/Optimization/clsOptSteepestDescent.vb:76-87 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×1
  • Duplicated block (9 lines × 2) LibOptimization/MathTool/MathUtil.vb:63 — LibOptimization/MathTool/MathUtil.vb:63-71 | LibOptimization/MathTool/MathUtil.vb:114-122 — 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, `LibOptimization/MathTool/MathUtil.vb:72` calls `matTemp` and `LibOptimization/MathTool/MathUtil.vb:123` 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 (8 lines × 3) · ×1
  • Duplicated block (8 lines × 3) LibOptimization/Optimization/clsOptDE.vb:256 — LibOptimization/Optimization/clsOptDE.vb:256-263 | LibOptimization/Optimization/clsOptDE.vb:296-303 | LibOptimization/Optimization/clsOptDE.vb:306-313 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) LibOptimization/MathTool/RNG/RandomUtil.vb:21 — LibOptimization/MathTool/RNG/RandomUtil.vb:21-26 | LibOptimization/MathTool/RNG/RandomUtil.vb:42-47 — 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) · ×1
  • Duplicated block (8 lines × 2) LibOptimization/Optimization/clsOptDE.vb:266 — LibOptimization/Optimization/clsOptDE.vb:266-273 | LibOptimization/Optimization/clsOptDE.vb:316-323 — 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 lines × 4) · ×1
  • Duplicated block (7 lines × 4) LibOptimization/Optimization/clsOptPSOAIW.vb:164 — LibOptimization/Optimization/clsOptPSOAIW.vb:164-170 | LibOptimization/Optimization/clsOptPSOCPSO.vb:198-204 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:188-194 | LibOptimization/Optimization/clsOptPSOLDIW.vb:173-179 — before extracting anything, compare `LibOptimization/Optimization/clsOptPSOAIW.vb` and `LibOptimization/Optimization/clsOptPSOCPSO.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) LibOptimization/Optimization/clsOptDE.vb:279 — LibOptimization/Optimization/clsOptDE.vb:279-283 | LibOptimization/Optimization/clsOptDE.vb:289-293 — 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) · ×1
  • Duplicated block (23 lines × 2) LibOptimization/BenchmarkFunctions/clsBenchSphere.vb:26 — LibOptimization/BenchmarkFunctions/clsBenchSphere.vb:26-71 | LibOptimization/BenchmarkFunctions/clsBenchSphereNumericDiff.vb:26-48 — before extracting anything, compare `LibOptimization/BenchmarkFunctions/clsBenchSphere.vb` and `LibOptimization/BenchmarkFunctions/clsBenchSphereNumericDiff.vb` as WHOLE FILES: 97% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (55 lines × 2) · ×1
  • Duplicated block (55 lines × 2) LibOptimization/Optimization/clsOptPSO.vb:171 — LibOptimization/Optimization/clsOptPSO.vb:171-274 | LibOptimization/Optimization/clsOptRealGAUNDX.vb:141-195 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Edited copy of a member (137 corresponding lines) · ×1
  • Edited copy of a member (137 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb:500 — TestLibOptimization/UnitTestLinearAlgebra.vb:500-664 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:118-254 — These two members are one piece of code written twice and then edited apart: 137 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (51 corresponding lines) · ×1
  • Edited copy of a member (51 corresponding lines) TestLibOptimization/UnitTestLibOptimization.vb:22 — TestLibOptimization/UnitTestLibOptimization.vb:22-72 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:14-71 — These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb:759 — TestLibOptimization/UnitTestLinearAlgebra.vb:759-785 | TestLibOptimization/UnitTestLinearAlgebra.vb:792-818 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb:124 — TestLibOptimization/UnitTestLinearAlgebra.vb:124-148 | TestLibOptimization/UnitTestLinearAlgebra.vb:244-268 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) TestLibOptimization/UnitTestLinearAlgebra.vb:155 — TestLibOptimization/UnitTestLinearAlgebra.vb:155-166 | TestLibOptimization/UnitTestLinearAlgebra.vb:173-184 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (34–55 lines × 2) · ×1
  • Duplicated block (34–55 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:278 — TestLibOptimization/UnitTestLinearAlgebra.vb:278-332 | TestLibOptimization/UnitTestLinearAlgebra.vb:500-533 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `TestLibOptimization/UnitTestLinearAlgebra.vb:500` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `TestLibOptimization/UnitTestLinearAlgebra.vb:533` calls `DenseMatrix`, `Double` and `TestLibOptimization/UnitTestLinearAlgebra.vb:332` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (48–51 lines × 2) · ×1
  • Duplicated block (48–51 lines × 2) TestLibOptimization/UnitTestLibOptimization.vb:24 — TestLibOptimization/UnitTestLibOptimization.vb:24-71 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:19-69 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
D4 · Code Duplication · Duplicated block (20–25 lines × 2) · ×1
  • Duplicated block (20–25 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:1138 — TestLibOptimization/UnitTestLinearAlgebra.vb:1138-1157 | TestLibOptimization/UnitTestLinearAlgebra.vb:1162-1186 — 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 (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) TestCode/Module1.vb:196 — TestCode/Module1.vb:196-219 | TestCode/Module1.vb:225-248 — 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 × 3) · ×1
  • Duplicated block (23 lines × 3) TestLibOptimization/UnitTestLinearAlgebra.vb:556 — TestLibOptimization/UnitTestLinearAlgebra.vb:556-578 | TestLibOptimization/UnitTestLinearAlgebra.vb:587-609 | TestLibOptimization/UnitTestLinearAlgebra.vb:617-639 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `TestLibOptimization/UnitTestLinearAlgebra.vb:556` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15–21 lines × 2) · ×1
  • Duplicated block (15–21 lines × 2) TestLibOptimization/UnitTestLibOptimization.vb:180 — TestLibOptimization/UnitTestLibOptimization.vb:180-200 | TestLibOptimization/UnitTestLibOptimization.vb:202-216 — 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) TestLibOptimization/UnitTestLibOptimization.vb:260 — TestLibOptimization/UnitTestLibOptimization.vb:260-279 | TestLibOptimization/UnitTestLibOptimization.vb:284-303 — 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 × 4) · ×1
  • Duplicated block (20 lines × 4) TestLibOptimization/UnitTestLinearAlgebra.vb:553 — TestLibOptimization/UnitTestLinearAlgebra.vb:553-572 | TestLibOptimization/UnitTestLinearAlgebra.vb:584-603 | TestLibOptimization/UnitTestLinearAlgebra.vb:614-633 | TestLibOptimization/UnitTestLinearAlgebra.vb:643-662 — 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 (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:194 — TestLibOptimization/UnitTestLinearAlgebra.vb:194-211 | TestLibOptimization/UnitTestLinearAlgebra.vb:212-228 — 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–17 lines × 3) · ×1
  • Duplicated block (10–17 lines × 3) TestLibOptimization/UnitTestLinearAlgebra.vb:428 — TestLibOptimization/UnitTestLinearAlgebra.vb:428-444 | TestLibOptimization/UnitTestLinearAlgebra.vb:451-467 | TestLibOptimization/UnitTestLinearAlgebra.vb:469-478 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (15–17 lines × 2) · ×1
  • Duplicated block (15–17 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:974 — TestLibOptimization/UnitTestLinearAlgebra.vb:974-988 | TestLibOptimization/UnitTestLinearAlgebra.vb:1000-1016 — 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 (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) TestLibOptimization/UnitTestLinearAlgebra.vb:1099 — TestLibOptimization/UnitTestLinearAlgebra.vb:1099-1112 | TestLibOptimization/UnitTestLinearAlgebra.vb:1114-1128 — 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.
D44 · Platform End-of-Life · End-of-life runtime · ×1
  • End-of-life runtime: .NET net5.0 TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj:5 — TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
P1 · CI/CD gates · No CI pipeline · ×1
  • No CI pipeline — No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 66 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×46
  • Orphaned file LibOptimization/MathTool/DenseVector.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 TestLibOptimization/UnitTestLibOptimization.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 LibOptimization/MathTool/MathUtil.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 LibOptimization/Optimization/clsOptDE.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 LibOptimization/Optimization/clsOptDEJADE.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 LibOptimization/Optimization/clsOptPSO.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 LibOptimization/Optimization/clsOptRealGAUNDX.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 LibOptimization/Optimization/clsOptPSOCPSO.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 LibOptimization/Optimization/clsOptNelderMead.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 LibOptimization/Optimization/clsOptRealGAPCX.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 LibOptimization/Optimization/clsOptNelderMeadANMS.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 LibOptimization/Optimization/clsOptPSOChaoticIW.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 LibOptimization/Optimization/clsOptRealGAREX.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 LibOptimization/Optimization/clsOptNelderMeadWiki.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 LibOptimization/Optimization/clsOptRealGASPX.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 LibOptimization/Optimization/clsOptCS.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 LibOptimization/Optimization/clsOptPSOLDIW.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 LibOptimization/Optimization/clsOptPSOAIW.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 LibOptimization/Optimization/clsOptES.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 TestCode/Module1.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 LibOptimization/Optimization/clsOptFA.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 TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.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 LibOptimization/Optimization/clsOptRealGABLX.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 LibOptimization/Optimization/clsOptPatternSearch.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 LibOptimization/Optimization/clsOptSimulatedAnnealing.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.
  • + 21 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×11
  • redundant comment LibOptimization/Optimization/clsOptCS.vb:190 — "Find current best" repeats the code it sits on: 3 of its 3 words (find, current, best) are already in `Dim candidateBest = newNests(clsUtil.FindCurrentBestIndex(newNests))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptCS.vb:220 — "Find current best" repeats the code it sits on: 3 of its 3 words (find, current, best) are already in `candidateBest = newNests(clsUtil.FindCurrentBestIndex(newNests))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptDE.vb:327 — "Limit solution space" repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in `clsUtil.LimitSolutionSpace(child, Me.LowerBounds, Me.UpperBounds)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptDEJADE.vb:279 — "Limit solution space" repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in `clsUtil.LimitSolutionSpace(child, Me.LowerBounds, Me.UpperBounds)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptHillClimbing.vb:120 — "limit solution space" repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in `clsUtil.LimitSolutionSpace(nextPoint, LowerBounds, UpperBounds)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptPatternSearch.vb:111 — "MakeExploratoryMoves" repeats the code it sits on: 3 of its 3 words (make, exploratory, moves) are already in `Dim exp As clsPoint = Me.MakeExploratoryMoves(Me.m_base, Me.m_stepLength)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptPatternSearch.vb:119 — "MakePatternMove and MakeExploratoryMoves" repeats the code it sits on: 4 of its 5 words (make, pattern, move, moves) are already in `Dim temp As clsPoint = Me.MakePatternMove(previousBasePoint, Me.m_base)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptRealGAREX.vb:244 — "rand * (xi-xg)" repeats the code it sits on: 3 of its 3 words (rand, xi, xg) are already in `childV += randVal * (xi.Value - xg)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment LibOptimization/Optimization/clsOptRealGASPX.vb:243 — "limit solution space" repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in `clsUtil.LimitSolutionSpace(tempChild, Me.LowerBounds, Me.UpperBounds)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment SampleVB/Module1.vb:183 — "objective function for LeastSquaresMethod" repeats the code it sits on: 4 of its 4 words (objective, function, squares, method) are already in `Dim objectiveFunction = New LeastSquaresMethod()`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment TestLibOptimization/UnitTestLibOptimization.vb:108 — "check iteration count" repeats the code it sits on: 3 of its 3 words (check, iteration, count) are already in `If opt.IterationCount <> 0 Then`. 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 LibOptimization/MathTool/DenseMatrix.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 TestLibOptimization/UnitTestLinearAlgebra.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 LibOptimization/Util/clsUtil.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.
D34 · Knowledge Freshness · Dormant codebase · ×1
  • Dormant codebase — 49 of 49 significant files have no living knowledge — the codebase as a whole is dormant, not 49 separate risks. Counted over 49 of the 84 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.
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.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj:20 — `TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.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 — 5 finding(s)
D24 · Comment Value · doc comments repeat the names · ×5
  • doc comments repeat the names LibOptimization/MathTool/DenseMatrix.vb:2 — 15 of 362 documented parameters and 140 of 653 summaries in `LibOptimization(net35)` only repeat the member or parameter name (e.g. "Matrix class" for `DenseMatrix`). 250 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names SampleCSharp/Program.cs:11 — 0 of 4 documented parameters and 1 of 9 summaries in `SampleCSharp` only repeat the member or parameter name (e.g. "my objective function" for `MyObjectiveFunction`). 3 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names SampleVB/LeastSquaresMethod.vb:8 — 0 of 2 documented parameters and 1 of 5 summaries in `SampleVB` only repeat the member or parameter name (e.g. "Data" for `datas`). 2 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names TestLibOptimization/UnitTestLibOptimization.vb:508 — 0 of 2 documented parameters and 0 of 12 summaries in `TestLibOptimization` only repeat the member or parameter name (e.g. "" for `ai_var`). 1 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:111 — 0 of 0 documented parameters and 1 of 3 summaries in `TestLibOptimizationDotNet3.0` only repeat the member or parameter name (e.g. "Matrix x Vector" for `Mat_Product_MatrixVectorNET30`). Delete the restating tags, or add what the name does not say.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-ce6595c3a56e46feae35c090ce1cf539/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-ce6595c3a56e46feae35c090ce1cf539/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .0artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesdotnet—dotnet list OptimizeFunction.sln package --vulnerable --include-transitive --format json1artifacts/raw/dotnet-vulnerable.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—
D36 · Supply-chain Provenance & Signingprovenance—provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-36669d098b62407d87e245c6899bcbf30artifacts/raw/osv-scanner.json

Run 01a1da06-736d-7c09-b41a-0a73627edc96 · 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