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

Neftedollar/FsLangMCP

Measured 15 November 2026, 11:29 UTC, at code version b6f2ac3

Code coverage is not measured: No coverage collector is wired up.

CAI score 56out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Down 5 since the last survey

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

A medium codebase: 28,461 lines of product code in 5 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Code Health, 43

Findings by how serious they are

1 critical 150 serious 23 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
15 November 2026, 11:29 UTC

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

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

37of 37 dimensions measured by tools.
158of 174 findings point to an exact file and line, so you can open each one in the code. The other 16 concern the repository as a whole, such as missing documentation.
37dimensions across 6 lenses, read from 28,461 lines of product code in 5 projects.
Chapters

Executive summary

Neftedollar/FsLangMCP falls short of our standard for a preview release, held back most by its Code Health lens, the quality of the code itself. It scores 56 out of 100 and is rated Adequate, and its one critical finding is a security problem in its automatic dependency updates.

Code Health, at 43, is the weakest lens and counts most in the score. The best first step is simplifying the hardest methods, worth about 10 points. Simplifying the most tangled methods comes next, worth about 6 points. Raising Code Health to 67 would lift the score to about 66.

One automatic update takes new releases before a bad one can be spotted. Setting a waiting period for automatic updates would close this risk.

The product code is 28,461 lines, about €60,000 to rebuild.

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

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

If Code Health rose from 43 to 67, the lowest score rated Strong, the score would rise from 56 to about 66.

Code composition: what the lines of code are
Product code 48%Tests 52%
New since the last survey: 6 findings

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

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: 7 findings

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

  • Cyclomatic Complexity · runtime-toolchain.require_fsac_diagnostics (cyclomatic 21) scripts/runtime-toolchain.py
  • Cyclomatic Complexity · audit-tool-descriptions.main (cyclomatic 18) scripts/audit-tool-descriptions.py
  • Cognitive Complexity · audit-tool-descriptions.main (cognitive 26) scripts/audit-tool-descriptions.py
  • Cognitive Complexity · project-evaluation-soak.validate_samples (cognitive 24) scripts/project-evaluation-soak.py
  • Cognitive Complexity · runtime-toolchain.require_fsac_diagnostics (cognitive 20) scripts/runtime-toolchain.py
  • Cognitive Complexity · verify-package-version.main (cognitive 16) scripts/verify-package-version.py
  • Churn × Complexity Hotspots · Repeated repair: RuntimeStatus.fs RuntimeStatus.fs
Rebuild cost: about €60,000 · Estimate
Cost to rebuild€20,000 to €100,000, for 333 to 1,057 hours of work, about 0.4 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 56. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 28,461 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: 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. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

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

1
Bring the 76 bodies over 15 down to 15 or less in Cognitive Complexity — start with FcsBridge.FindCoreWithinDeadline (cognitive 2736), FcsBridge.Check (cognitive 625), FcsBridge.NugetMembers (cognitive 338).
Raises the score by about 10 points · High effort · Cognitive Complexity
2
Bring the 21 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with FcsBridge.FindCoreWithinDeadline (cyclomatic 519), FcsBridge.Check (cyclomatic 258), FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110).
Raises the score by about 6 points · High effort · Cyclomatic Complexity
3
Resolve the 4 Deprecated finding(s) in Dependency Hygiene — start with packages.lock.json (4).
Raises the score by about 2 points · Low effort · Dependency Hygiene

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €60,000 to build again, about 0.4 person-years of work. Its weakest lens is Code Health, at 43 (checked 3 of 11). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Bring the 76 bodies over 15 down to 15 or less in Cognitive Complexity. Of all the actions in this report, it raises the score most for the work it takes: about 10 points for high effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 4.7 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 8% to 19% on every change. The history of the code shows how much it changes: about 55,670 lines over the last 90 days, which is about 225,773 lines a year. At that pace, the extra work comes to an estimated 47 to 282.2 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 · 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 App App Domain Domain App->Domain FsLangMcp FsLangMcp FsLangMcp.Docs Docs

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.

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

The table shows the 40 modules with the most connections; 13 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 AutoGeneratedProgram2 FsLangMcp.AnalyzerDiagnostics3 FsLangMcp.BoundedCache4 FsLangMcp.CheckDiagnostics5 FsLangMcp.ConstructorDiagnostics6 FsLangMcp.Cursor7 FsLangMcp.Docs.Site8 FsLangMcp.FcsBridge.AnalysisSnapshotKey9 FsLangMcp.FcsBridge.FieldSiteTypes10 FsLangMcp.FcsBridge.NugetPackageMap11 FsLangMcp.FcsBridge.ProjectOutlineFilter12 FsLangMcp.FcsBridge.ReviewScanner13 FsLangMcp.FindInventory14 FsLangMcp.InstallationHealth15 FsLangMcp.LspBridge.CodeActionRequest16 FsLangMcp.ProcessRunner17 FsLangMcp.ProjectFiles18 FsLangMcp.ProjectFiles.SolutionParsing19 FsLangMcp.SdkPreflight20 FsLangMcp.Types21 scripts.runtime-toolchain22 FsLangMcp.Dispatcher23 FsLangMcp.FcsBridge24 FsLangMcp.FcsBridge.EvaluatedProjectModel25 FsLangMcp.FindInput26 FsLangMcp.LspBridge27 FsLangMcp.ProjectHealth28 FsLangMcp.ProjectInspection29 FsLangMcp.RuntimeStatus30 FsLangMcp.ScriptChecking31 FsLangMcp.Tools32 scripts33 FsLangMcp.Dispatcher.CheckDispatch34 FsLangMcp.Dispatcher.FindDispatch35 FsLangMcp.FcsBridge.CheckFsacSnapshotModule36 FsLangMcp.FcsBridge.FieldFormClassifier37 FsLangMcp.FcsBridge.FindCursorContract38 FsLangMcp.FcsBridge.FindDeadlineResponse39 FsLangMcp.Program40 FsLangMcp.Program.RuntimeToolManifest
1 AutoGeneratedProgram
2 FsLangMcp.AnalyzerDiagnostics
3 FsLangMcp.BoundedCache
4 FsLangMcp.CheckDiagnostics
5 FsLangMcp.ConstructorDiagnostics
6 FsLangMcp.Cursor
7 FsLangMcp.Docs.Site
8 FsLangMcp.FcsBridge.AnalysisSnapshotKey
9 FsLangMcp.FcsBridge.FieldSiteTypes
10 FsLangMcp.FcsBridge.NugetPackageMap
11 FsLangMcp.FcsBridge.ProjectOutlineFilter
12 FsLangMcp.FcsBridge.ReviewScanner
13 FsLangMcp.FindInventory
14 FsLangMcp.InstallationHealth
15 FsLangMcp.LspBridge.CodeActionRequest
16 FsLangMcp.ProcessRunner
17 FsLangMcp.ProjectFiles
18 FsLangMcp.ProjectFiles.SolutionParsing
19 FsLangMcp.SdkPreflight
20 FsLangMcp.Types
21 scripts.runtime-toolchain
22 FsLangMcp.Dispatcher2
23 FsLangMcp.FcsBridge111
24 FsLangMcp.FcsBridge.EvaluatedProjectModel3
25 FsLangMcp.FindInput3
26 FsLangMcp.LspBridge111
27 FsLangMcp.ProjectHealth22
28 FsLangMcp.ProjectInspection31
29 FsLangMcp.RuntimeStatus2
30 FsLangMcp.ScriptChecking11
31 FsLangMcp.Tools1
32 scripts1
33 FsLangMcp.Dispatcher.CheckDispatch111
34 FsLangMcp.Dispatcher.FindDispatch1131
35 FsLangMcp.FcsBridge.CheckFsacSnapshotModule2
36 FsLangMcp.FcsBridge.FieldFormClassifier2
37 FsLangMcp.FcsBridge.FindCursorContract211
38 FsLangMcp.FcsBridge.FindDeadlineResponse11
39 FsLangMcp.Program11
40 FsLangMcp.Program.RuntimeToolManifest1
Uses a module listed above itPart of a loopThe module itself
1 AutoGeneratedProgram2 FsLangMcp.AnalyzerDiagnostics3 FsLangMcp.BoundedCache4 FsLangMcp.CheckDiagnostics5 FsLangMcp.ConstructorDiagnostics6 FsLangMcp.Cursor7 FsLangMcp.Docs.Site8 FsLangMcp.FcsBridge.AnalysisSnapshotKey9 FsLangMcp.FcsBridge.FieldSiteTypes10 FsLangMcp.FcsBridge.NugetPackageMap11 FsLangMcp.FcsBridge.ProjectOutlineFilter12 FsLangMcp.FcsBridge.ReviewScanner13 FsLangMcp.FindInventory14 FsLangMcp.InstallationHealth15 FsLangMcp.LspBridge.CodeActionRequest16 FsLangMcp.ProcessRunner17 FsLangMcp.ProjectFiles18 FsLangMcp.ProjectFiles.SolutionParsing19 FsLangMcp.SdkPreflight20 FsLangMcp.Types21 scripts.runtime-toolchain22 FsLangMcp.Dispatcher23 FsLangMcp.FcsBridge24 FsLangMcp.FcsBridge.EvaluatedProjectModel25 FsLangMcp.FindInput26 FsLangMcp.LspBridge27 FsLangMcp.ProjectHealth28 FsLangMcp.ProjectInspection29 FsLangMcp.RuntimeStatus30 FsLangMcp.ScriptChecking31 FsLangMcp.Tools32 scripts33 FsLangMcp.Dispatcher.CheckDispatch34 FsLangMcp.Dispatcher.FindDispatch35 FsLangMcp.FcsBridge.CheckFsacSnapshotModule36 FsLangMcp.FcsBridge.FieldFormClassifier37 FsLangMcp.FcsBridge.FindCursorContract38 FsLangMcp.FcsBridge.FindDeadlineResponse39 FsLangMcp.Program40 FsLangMcp.Program.RuntimeToolManifestAutoGeneratedProgram1FsLangMcp.AnalyzerDiagnostics2FsLangMcp.BoundedCache3FsLangMcp.CheckDiagnostics4FsLangMcp.ConstructorDiagnostics5FsLangMcp.Cursor6FsLangMcp.Docs.Site7FsLangMcp.FcsBridge.AnalysisSnapshotKey8FsLangMcp.FcsBridge.FieldSiteTypes9FsLangMcp.FcsBridge.NugetPackageMap10FsLangMcp.FcsBridge.ProjectOutlineFilter11FsLangMcp.FcsBridge.ReviewScanner12FsLangMcp.FindInventory13FsLangMcp.InstallationHealth14FsLangMcp.LspBridge.CodeActionRequest15FsLangMcp.ProcessRunner16FsLangMcp.ProjectFiles17FsLangMcp.ProjectFiles.SolutionParsing18FsLangMcp.SdkPreflight19FsLangMcp.Types20scripts.runtime-toolchain21FsLangMcp.Dispatcher22FsLangMcp.FcsBridge23FsLangMcp.FcsBridge.EvaluatedProjectModel24FsLangMcp.FindInput25FsLangMcp.LspBridge26FsLangMcp.ProjectHealth27FsLangMcp.ProjectInspection28FsLangMcp.RuntimeStatus29FsLangMcp.ScriptChecking30FsLangMcp.Tools31scripts32FsLangMcp.Dispatcher.CheckDispatch33FsLangMcp.Dispatcher.FindDispatch34FsLangMcp.FcsBridge.CheckFsacSnapshotModule35FsLangMcp.FcsBridge.FieldFormClassifier36FsLangMcp.FcsBridge.FindCursorContract37FsLangMcp.FcsBridge.FindDeadlineResponse38FsLangMcp.Program39FsLangMcp.Program.RuntimeToolManifest4021113311122312111111111312221111111+13 more modules (most-connected shown)

At a glance — Code Health · 43% · Checked 3 of 11 · gated by D1, D2 ·

At a glance — Architecture · 90% · Adequate · gated by D26 ·

At a glance — Maturity · 80% · Strong ·

At a glance — Readiness · 60% · Adequate · gated by P3 ·

At a glance — Security · 76% · Checked 4 of 10 · gated by D36 ·

At a glance — Performance · 70% · Strong ·

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 Failures6Medium
A05:2025 — Injection2High / Critical

Roadmap

Top priorities: Bring the 76 bodies over 15 down to 15 or less in Cognitive Complexity — start with FcsBridge.FindCoreWithinDeadline (cognitive 2736), FcsBridge.Check (cognitive 625), FcsBridge.NugetMembers (cognitive 338); Bring the 21 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with FcsBridge.FindCoreWithinDeadline (cyclomatic 519), FcsBridge.Check (cyclomatic 258), FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110); Resolve the 4 Deprecated finding(s) in Dependency Hygiene — start with packages.lock.json (4).

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

Do thisHelpsEffortDimension
Bring the 76 bodies over 15 down to 15 or less in Cognitive Complexity — start with FcsBridge.FindCoreWithinDeadline (cognitive 2736), FcsBridge.Check (cognitive 625), FcsBridge.NugetMembers (cognitive 338).+10.4 ptsHighCognitive Complexity
Bring the 21 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with FcsBridge.FindCoreWithinDeadline (cyclomatic 519), FcsBridge.Check (cyclomatic 258), FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110).+5.6 ptsHighCyclomatic Complexity
Resolve the 4 Deprecated finding(s) in Dependency Hygiene — start with packages.lock.json (4).+2.4 ptsLowDependency Hygiene
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.+2.0 ptsMediumDeployment & Rollback
F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.+1.8 ptsMediumAsync & latency hygiene
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.+1.7 ptsMediumObservability
Resolve the 7 FileTooLong finding(s) in God Classes — start with FcsBridge.fs, LspBridge.fs, Program.fs.+1.4 ptsHighGod Classes
Resolve the 1 `jobj with null value produces null in JSON` spells `JSON` where 38… finding(s) in Naming Consistency — start with TypesToolsTests.fs.+0.6 ptsLowNaming Consistency

File quality

Per-file score 0–10 — a quality signature. Of 22 files carrying findings, judged against the Preview bar: 0% slop · 5% mixed · 95% near-clean.

FileScoreBandWorst signal
REDACTED6.9MixedStatic Analysis (SAST): Medium: REDACTED
FcsBridge.fs7.0Near-cleanCyclomatic Complexity: FcsBridge.FindCoreWithinDeadline (cyclomatic 519)
LspBridge.fs7.0Near-cleanCyclomatic Complexity: FsAutoCompleteBridge.SetProjectCore (cyclomatic 38)
ProjectFiles.fs7.0Near-cleanCyclomatic Complexity: ProjectFiles.classifyFile (cyclomatic 23)
ProjectHealth.fs7.1Near-cleanCyclomatic Complexity: ProjectHealth.createReport (cyclomatic 47)
Program.fs7.1Near-cleanCyclomatic Complexity: Program.mainCore (cyclomatic 43)
ProcessRunner.fs7.1Near-cleanCyclomatic Complexity: ProcessRunner.runAsyncWithOutputLimitCore (cyclomatic 27)
REDACTED7.2Near-cleanStatic Analysis (SAST): High: REDACTED
Types.fs7.4Near-cleanCyclomatic Complexity: FindResponseBudget.planResponse (cyclomatic 23)
MetadataAccessibility.fs7.4Near-cleanCyclomatic Complexity: MetadataAccessibility.candidateAssemblyPaths (cyclomatic 17)
ConstructorDiagnostics.fs7.4Near-cleanCyclomatic Complexity: ConstructorDiagnostics.collect (cyclomatic 16)
Cursor.fs7.8Near-cleanCyclomatic Complexity: Cursor.tryDecodeFind (cyclomatic 24)
FindInput.fs7.8Near-cleanCyclomatic Complexity: FindInput.prepare (cyclomatic 22)
ScriptChecking.fs7.8Near-cleanCyclomatic Complexity: Runner.Check (cyclomatic 19)
FindInventory.fs7.8Near-cleanCyclomatic Complexity: Collector.ObserveUses (cyclomatic 16)
tests/FsLangMcp.Tests/FsLangMcp.Tests.fsproj7.8Near-cleanDependency Hygiene: Deprecated: Verify.Xunit
REDACTED7.9Near-cleanSupply-chain Provenance & Signing: REDACTED
CheckDiagnostics.fs8.5Near-cleanCognitive Complexity: CheckDiagnostics.boundResponse (cognitive 21)
AnalyzerDiagnostics.fs8.5Near-cleanCognitive Complexity: AnalyzerDiagnostics.parseSarif (cognitive 18)
tests/FsLangMcp.Tests/packages.lock.json9.1Near-cleanDependency Hygiene: Deprecated: xunit.assert

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

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

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

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

Could not be resolved — 37

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 37 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

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

What we checked — 37 dimensions across the health lenses
D1D2D3D5D6D7D12D13D14D15D21D26D27D28D29D30D34D35D36D44AX10AX3AX4AX8GD1M1M2M3M4P1P2P3P4P6PF3X27X28

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, 158 of 174 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 01a1def7-f1d7-7632-a75a-238f55ebebee.

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.

  • D4 Code Duplication — 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. Code Duplication couldn't be assessed within its 6-minute budget on a solution this large — not included in this run.
  • D8 Code Coverage — 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. Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect. You can widen what we reach: add the `coverlet.collector` package to the test projects to enable coverage (or commit the Cobertura/OpenCover/lcov report your CI produces).
  • 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 included — no test tier completed within its budget.
  • D15 Churn × Complexity Hotspots — 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. A hotspot's complexity is meant to be the worst body its churn actually touched. For Program.fs, Types.fs, FcsBridge.fs, ProcessRunner.fs, ProjectFiles.fs, … that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-contributor repository — bus factor is not applicable (1 contributor(s) across 163 commit(s) sampled, automation and bot accounts excluded). Concentration needs a team to concentrate: with one contributor there is nobody to spread the knowledge to, so there is nothing here for the owner to act on.
  • D20 ADR Quality — 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. ADR Quality couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
  • D21 Naming Consistency — 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these 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. This repository's source is written only in languages whose packages are published through a manifest, and no manifest in the tree makes a publication act: either there is no package manifest of any ecosystem (no package.json, pyproject.toml, setup.py, gemspec, Cargo.toml, pom.xml, build.gradle, composer.json, pubspec.yaml or mix.exs), or every one present declares in its package manager's own terms that it is not published (an npm package marked "private": true, a Cargo package with publish = false, a pubspec with publish_to: none, a Composer "project", a Poetry project with package-mode = false, or the "Private :: Do Not Upload" classifier). With no publication act there is no intentionally-exposed surface for API consistency to be judged over.
  • D24 Comment Value — 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D43 Malicious Dependencies — 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. Malicious Dependencies couldn't be assessed within its 20-minute budget on a solution this large — not included in this run.
  • AX1 Captive dependencies — 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 reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository's container is Microsoft.Extensions.DependencyInjection registered from F#, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • C1 Data Protection — 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. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — 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. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • C3 Audit Trail — not measured this run — 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. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
  • C4 Data Retention — not measured this run — 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. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
  • C5 Data-Subject Rights — not measured this run — 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. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
  • IC1 Incompleteness & stubs — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • S1 Web-Security Posture — 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. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X1 Async correctness — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X12 Unreachable branch — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X13 Undrained process stream — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X14 Bypassable address classification — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X15 Unvalidated length from an untrusted reader — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X16 Unfloored truncation loop — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X17 Uncapped recursion over a caller-supplied document — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X18 Disposal-pattern correctness — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X19 Unrestored process-global state — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X2 Cancellation propagation — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X21 Side-effecting pattern guard — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X22 Contradicted release guard — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X24 Document value interpolated into markup unescaped — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X25 Inert configuration knob — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X26 Unsynchronised callback handoff — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X29 Per-element action decided by a fixed element — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X3 Exception handling — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X30 Support guard that admits what it rejects — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X32 Type resolved by simple name across every loaded assembly — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X4 Structured logging — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X5 Nullable reference types — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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.
  • 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.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

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

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

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

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

49 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was FcsBridge.FindCoreWithinDeadline at 519.

FcsBridge.FindCoreWithinDeadline (cyclomatic 519)FcsBridge.fs:7124
FcsBridge.Check (cyclomatic 258)FcsBridge.fs:11188
FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110)FcsBridge.fs:13295
FcsBridge.NugetMembers (cyclomatic 89)FcsBridge.fs:14369
FcsBridge.RefactorImpact (cyclomatic 86)FcsBridge.fs:16207

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

What to do

  1. Bring the 21 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with FcsBridge.FindCoreWithinDeadline (cyclomatic 519), FcsBridge.Check (cyclomatic 258), FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 21 together lifts Cyclomatic Complexity from 2.0 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

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

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

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

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

76 method(s) exceeded the cognitive complexity threshold of 15; the worst was FcsBridge.FindCoreWithinDeadline at 2736.

FcsBridge.FindCoreWithinDeadline (cognitive 2736)FcsBridge.fs:7124
FcsBridge.Check (cognitive 625)FcsBridge.fs:11188
FcsBridge.NugetMembers (cognitive 338)FcsBridge.fs:14369
FcsBridge.TestsForSymbol (cognitive 249)FcsBridge.fs:10112
FcsBridge.SignatureStatus (cognitive 229)FcsBridge.fs:15138

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

What to do

  1. Bring the 76 bodies over 15 down to 15 or less in Cognitive Complexity — start with FcsBridge.FindCoreWithinDeadline (cognitive 2736), FcsBridge.Check (cognitive 625), FcsBridge.NugetMembers (cognitive 338). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 76 together lifts Cognitive Complexity from 2.0 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

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

9 god class(es) detected.

FileTooLong: ./FcsBridge.fs · ×7FcsBridge.fs
TooManyMethods: FcsBridge · ×2FcsBridge.fs:2957

What to do

  1. Resolve the 7 FileTooLong finding(s) in God Classes — start with FcsBridge.fs, LspBridge.fs, Program.fs. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 2 TooManyMethods finding(s) in God Classes — start with FcsBridge.fs, LspBridge.fs. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d3_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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

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

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

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

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

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

0 of 12 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D7 · Architectural Integrity6.0 / 10Adequate✓ Tool-verified

What it measures: Whether the code respects its intended layering / architecture rules.

Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.

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

No mechanizable ADR was identified, so enforcement is not measured. Cycles found: 0.

Detailed fixes: d7_recommendation.md.

D12 · Dependency Hygiene8.6 / 10Strong✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

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

8 outdated, 0 vulnerable, 2 deprecated packages.

Deprecated: Verify.Xunit · ×2tests/FsLangMcp.Tests/FsLangMcp.Tests.fsproj:105
Deprecated: xunit.assert · ×4tests/FsLangMcp.Tests/packages.lock.json:665
Outdated: FSharp.Compiler.Service · ×8

What to do

  1. Resolve the 4 Deprecated finding(s) in Dependency Hygiene — start with packages.lock.json (4). — One of this dimension's main actionable groups (4 recommendation-level).
  2. Resolve the 2 Deprecated finding(s) in Dependency Hygiene — start with FsLangMcp.Tests.fsproj (2). — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d12_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 209 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 29 direct `PackageReference`(s), and 173 further package(s) were reached beyond them by closing the graph over the committed `packages.lock.json` and 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 Hotspots5.0 / 10Weak✓ 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 5.0 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: FcsBridge.fs (29×519=15051); Program.fs (21×43=903); Types.fs (13×23=299) Repeated repair below the complexity floor: Tools.fs (3 of 3 changes were fixes)

Hotspot: FcsBridge.fs · ×7FcsBridge.fs:7124
Repeated repair: Tools.fsTools.fs:36

What to do

  1. Resolve the 7 Hotspot finding(s) in Churn × Complexity Hotspots — start with FcsBridge.fs, Program.fs, Types.fs. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with Tools.fs. — One of this dimension's main actionable groups (1 warning-level).

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

D21 · Naming Consistency5.0 / 10Adequate✓ Tool-verified

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

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

2 naming inconsistencies among 40 declarations measured against a convention their peers follow.

`tryDecode returns Error for valid Base64 but not JSON` spells `JSON` where 38 names in the project spell it `Json`tests/FsLangMcp.Tests/OutlinePaginationTests.fs:78
`jobj with null value produces null in JSON` spells `JSON` where 38 names in the project spell it `Json`tests/FsLangMcp.Tests/TypesToolsTests.fs:59

What to do

  1. Resolve the 1 `tryDecode returns Error for valid Base64 but not JSON` spells `JSON`… finding(s) in Naming Consistency — start with OutlinePaginationTests.fs. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 `jobj with null value produces null in JSON` spells `JSON` where 38… finding(s) in Naming Consistency — start with TypesToolsTests.fs. — One of this dimension's main actionable groups (1 recommendation-level).

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

D26 · Project Cohesion0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 2 build units (MSBuild) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

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

D27 · Navigability7.4 / 10Strong✓ 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 7.4 / 10 · rule-coverage 100% · ceiling Documented

94 % of calls cross a namespace and 1 % go through an interface, but 45 % of collaborators are co-located — so following a call takes several hops. Baseline: small — navigation cost is tolerated.

Scattered collaborators

What to do

  1. Resolve the 1 Scattered collaborators finding(s) in Navigability. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d27_recommendation.md · top locations in Appendix A, every location in findings.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)8.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

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

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

2 finding(s): 0 critical, 1 high, 1 medium, 0 low. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

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

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

D34 · Knowledge Freshness10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 27 of the 29 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code 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. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

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

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

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.

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 in this repository's F#: bindings whose whole body still raises a "not implemented" error (NotImplementedException, failwith "not implemented"), and placeholder text (lorem ipsum, changeme/replace_me…) left in string literals of 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)8.0 / 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.

M2 · Architecture documentation8.0 / 10Strong✓ 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.

M3 · Folder & project structure8.0 / 10Strong✓ Tool-verified

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

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

  • Production code is mixed at the repository root with everything else the repository holds, so nothing marks which files are the product.
M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

P2 · Observability5.5 / 10Adequate✓ Tool-verified

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

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

  • Only 1/2 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `docs`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
P3 · Security & performance tooling3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

  • No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 5 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. — REDACTED:6

What to do

  • Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — so a security regression fails the build instead of landing.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

What to do

  • Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
P6 · Release Hygiene10.0 / 10Exemplary✓ 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.

PF3 · Async & latency hygiene7.0 / 10Strong✓ 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.

  • `RecordFieldAudit` is async and calls Async.RunSynchronously — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — FcsBridge.fs:6547
  • `FindCoreWithinDeadline` is async and calls Async.RunSynchronously — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — FcsBridge.fs:8128

What to do

  • F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for … in` loop leaves the mutable .NET collection it is walking alone — F#'s own lists, arrays, maps and sets cannot be changed by a loop body, but a `ResizeArray`, `Dictionary`, `Queue` or other BCL collection walked by `for x in c do` is walked through its enumerator, so a body that adds to or removes from `c` makes the next `MoveNext` throw `InvalidOperationException` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

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

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

Reference — by lens

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

LensScoreRatingImpact
Code Health43%Checked 3 of 11Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture90%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity80%StrongStrongest area.
Readiness60%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security76%Checked 4 of 10Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance70%StrongSolid.
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.

  • X10 Duplicated predicate — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 control(s) we could not find positive evidence for

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

  • C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 75 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 — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No F# function in this code takes an ASP.NET Core or Suave HttpContext (a Giraffe, Saturn, Falco, Oxpecker or Suave handler) and no F# class is an ASP.NET Core controller, so no request handler shares module state between request threads. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • D10 Test Quality — ~30801 lines of test source are present (.fs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included
  • D16 Bus Factor — single-contributor repository — bus factor is not applicable
  • D17 Explicit Debt — the C# workspace loaded 0 projects, so explicit-debt density could not be measured
  • D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution; this repository's .NET projects are all F# (.fsproj), which the C#/VB workspace does not load, so the dimension does not apply.
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D20 ADR Quality — ADR Quality not included (time budget)
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — 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"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .fs, .py source were not judged.
  • D25 ADR Conformance — None of 1 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D4 Code Duplication — Code Duplication not included (time budget)
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D43 Malicious Dependencies — Malicious Dependencies not included (time budget)
  • D8 Code Coverage — Coverage not measured — no coverage collector is wired up
  • DM1 Domain Modelling — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 100 value object(s); 3 domain event(s); its domain events are published by services or handlers — no domain entity raises one; a Domain/Aggregates/ValueObjects layer; a domain structure with no aggregate, domain event or strongly-typed id in it: a CRUD / clean-architecture model, measured but not claimed as DDD; a top-level examples/ tree: a library or framework whose examples are its consumers — these types are building blocks, not a domain
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • 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. This check searched for a BenchmarkDotNet reference in an .fsproj or .vbproj, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not 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 — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X20 Mistyped argument guard — 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 — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X23 Unguarded diagnostic materialisation — 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 — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — 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 — 1 finding(s)
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 150 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×7
  • Hotspot: FcsBridge.fs FcsBridge.fs:7124 — FcsBridge.fs changed 29 times in last 90 days, max cyclomatic complexity 519 in FcsBridge.FindCoreWithinDeadline at line 7124. 21 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- FcsBridge.fs`: 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: Program.fs Program.fs:621 — Program.fs changed 21 times in last 90 days, max cyclomatic complexity 43 in Program.mainCore at line 621. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- Program.fs`: 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: Types.fs Types.fs:967 — Types.fs changed 13 times in last 90 days, max cyclomatic complexity 23 in FindResponseBudget.planResponse at line 967. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- Types.fs`: 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: ProjectHealth.fs ProjectHealth.fs:639 — ProjectHealth.fs changed 5 times in last 90 days, max cyclomatic complexity 47 in ProjectHealth.createReport at line 639. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- ProjectHealth.fs`: 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: LspBridge.fs LspBridge.fs:1951 — LspBridge.fs changed 5 times in last 90 days, max cyclomatic complexity 38 in FsAutoCompleteBridge.SetProjectCore at line 1951. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- LspBridge.fs`: 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: ProjectFiles.fs ProjectFiles.fs:335 — ProjectFiles.fs changed 8 times in last 90 days, max cyclomatic complexity 23 in ProjectFiles.classifyFile at line 335. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- ProjectFiles.fs`: 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: ProcessRunner.fs ProcessRunner.fs:702 — ProcessRunner.fs changed 4 times in last 90 days, max cyclomatic complexity 27 in ProcessRunner.runAsyncWithOutputLimitCore at line 702. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- ProcessRunner.fs`: 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.
D3 · God Classes · FileTooLong · ×7
  • FileTooLong: ./FcsBridge.fs FcsBridge.fs — FileTooLong — 13346 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12846 over it, 26.69× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: ./LspBridge.fs LspBridge.fs — FileTooLong — 2620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2120 over it, 5.24× 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: ./Program.fs Program.fs — FileTooLong — 1069 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 569 over it, 2.14× 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: ./ProjectHealth.fs ProjectHealth.fs — FileTooLong — 1011 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 42 functions. The bar is 500 significant lines; this is 511 over it, 2.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: ./ProcessRunner.fs ProcessRunner.fs — FileTooLong — 758 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 38 functions. The bar is 500 significant lines; this is 258 over it, 1.52× 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: ./Types.fs Types.fs — FileTooLong — 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24× 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: ./ProjectFiles.fs ProjectFiles.fs — FileTooLong — 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24× 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.
D12 · Dependency Hygiene · Deprecated · ×2
  • Deprecated: Verify.Xunit tests/FsLangMcp.Tests/FsLangMcp.Tests.fsproj:105 — Verify.Xunit 31.12.5 — Legacy — the publisher's replacement is `Verify.XunitV3`; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump — budget for API changes in the code that uses it, not only the reference swap.
  • Deprecated: xunit tests/FsLangMcp.Tests/FsLangMcp.Tests.fsproj:92 — xunit 2.9.3 — Legacy — the publisher's replacement is `xunit.v3`; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump — budget for API changes in the code that uses it, not only the reference swap.
D3 · God Classes · TooManyMethods · ×2
  • TooManyMethods: FcsBridge FcsBridge.fs:2957 — TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× 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: FsAutoCompleteBridge LspBridge.fs:1230 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×2
  • Sync-over-async blocking FcsBridge.fs:6547 — `RecordFieldAudit` is async and calls Async.RunSynchronously — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs.
  • Sync-over-async blocking FcsBridge.fs:8128 — `FindCoreWithinDeadline` is async and calls Async.RunSynchronously — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs.
D1 · Cyclomatic Complexity · FcsBridge.FindCoreWithinDeadline (cyclomatic 519) · ×1
  • FcsBridge.FindCoreWithinDeadline (cyclomatic 519) FcsBridge.fs:7124 — FcsBridge.FindCoreWithinDeadline has cyclomatic complexity 519 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.Check (cyclomatic 258) · ×1
  • FcsBridge.Check (cyclomatic 258) FcsBridge.fs:11188 — FcsBridge.Check has cyclomatic complexity 258 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110) · ×1
  • FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110) FcsBridge.fs:13295 — FcsBridge.ProjectOutlineWithinDeadline has cyclomatic complexity 110 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.NugetMembers (cyclomatic 89) · ×1
  • FcsBridge.NugetMembers (cyclomatic 89) FcsBridge.fs:14369 — FcsBridge.NugetMembers has cyclomatic complexity 89 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.RefactorImpact (cyclomatic 86) · ×1
  • FcsBridge.RefactorImpact (cyclomatic 86) FcsBridge.fs:16207 — FcsBridge.RefactorImpact has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.TestsForSymbol (cyclomatic 83) · ×1
  • FcsBridge.TestsForSymbol (cyclomatic 83) FcsBridge.fs:10112 — FcsBridge.TestsForSymbol has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.BuildFilePlan (cyclomatic 77) · ×1
  • FcsBridge.BuildFilePlan (cyclomatic 77) FcsBridge.fs:16920 — FcsBridge.BuildFilePlan has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.PublicApi (cyclomatic 76) · ×1
  • FcsBridge.PublicApi (cyclomatic 76) FcsBridge.fs:14754 — FcsBridge.PublicApi has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.SignatureStatus (cyclomatic 68) · ×1
  • FcsBridge.SignatureStatus (cyclomatic 68) FcsBridge.fs:15138 — FcsBridge.SignatureStatus has cyclomatic complexity 68 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.ResolveFastCheckExpectation (cyclomatic 62) · ×1
  • FcsBridge.ResolveFastCheckExpectation (cyclomatic 62) FcsBridge.fs:10858 — FcsBridge.ResolveFastCheckExpectation has cyclomatic complexity 62 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.DeadCode (cyclomatic 49) · ×1
  • FcsBridge.DeadCode (cyclomatic 49) FcsBridge.fs:17441 — FcsBridge.DeadCode has cyclomatic complexity 49 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · ProjectHealth.createReport (cyclomatic 47) · ×1
  • ProjectHealth.createReport (cyclomatic 47) ProjectHealth.fs:639 — ProjectHealth.createReport has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FcsBridge.RecordFieldAudit (cyclomatic 46) · ×1
  • FcsBridge.RecordFieldAudit (cyclomatic 46) FcsBridge.fs:6364 — FcsBridge.RecordFieldAudit has cyclomatic complexity 46 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · Program.mainCore (cyclomatic 43) · ×1
  • Program.mainCore (cyclomatic 43) Program.fs:621 — Program.mainCore has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FcsBridge.PositionIsUnsafe (cyclomatic 41) · ×1
  • FcsBridge.PositionIsUnsafe (cyclomatic 41) FcsBridge.fs:12889 — FcsBridge.PositionIsUnsafe has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FsAutoCompleteBridge.SetProjectCore (cyclomatic 38) · ×1
  • FsAutoCompleteBridge.SetProjectCore (cyclomatic 38) LspBridge.fs:1951 — FsAutoCompleteBridge.SetProjectCore has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CheckFsacSnapshotModule.ofDiagnosticsResponse (cyclomatic 35) · ×1
  • CheckFsacSnapshotModule.ofDiagnosticsResponse (cyclomatic 35) FcsBridge.fs:1045 — CheckFsacSnapshotModule.ofDiagnosticsResponse has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.SuggestOpen (cyclomatic 34) · ×1
  • FcsBridge.SuggestOpen (cyclomatic 34) FcsBridge.fs:15702 — FcsBridge.SuggestOpen has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.FileOutlineCore (cyclomatic 33) · ×1
  • FcsBridge.FileOutlineCore (cyclomatic 33) FcsBridge.fs:5705 — FcsBridge.FileOutlineCore has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.CheckCompileOrder (cyclomatic 32) · ×1
  • FcsBridge.CheckCompileOrder (cyclomatic 32) FcsBridge.fs:16005 — FcsBridge.CheckCompileOrder has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FsAutoCompleteBridge.DiagnosticsForContext (cyclomatic 31) · ×1
  • FsAutoCompleteBridge.DiagnosticsForContext (cyclomatic 31) LspBridge.fs:2709 — FsAutoCompleteBridge.DiagnosticsForContext has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · FcsBridge.TypeAtPosition (cyclomatic 29) · ×1
  • FcsBridge.TypeAtPosition (cyclomatic 29) FcsBridge.fs:12720 — FcsBridge.TypeAtPosition has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · ProcessRunner.runAsyncWithOutputLimitCore (cyclomatic 27) · ×1
  • ProcessRunner.runAsyncWithOutputLimitCore (cyclomatic 27) ProcessRunner.fs:702 — ProcessRunner.runAsyncWithOutputLimitCore has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FcsBridge.FindMemberUsages (cyclomatic 26) · ×1
  • FcsBridge.FindMemberUsages (cyclomatic 26) FcsBridge.fs:6203 — FcsBridge.FindMemberUsages has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.ReviewScan (cyclomatic 25) · ×1
  • FcsBridge.ReviewScan (cyclomatic 25) FcsBridge.fs:17259 — FcsBridge.ReviewScan has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · ReviewScanner.scan (cyclomatic 24) · ×1
  • ReviewScanner.scan (cyclomatic 24) FcsBridge.fs:1738 — ReviewScanner.scan has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FsAutoCompleteBridge.DiagnosticFixes (cyclomatic 24) · ×1
  • FsAutoCompleteBridge.DiagnosticFixes (cyclomatic 24) LspBridge.fs:3251 — FsAutoCompleteBridge.DiagnosticFixes has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Cursor.tryDecodeFind (cyclomatic 24) · ×1
  • Cursor.tryDecodeFind (cyclomatic 24) Cursor.fs:197 — Cursor.tryDecodeFind has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ProjectHealth.analyzerSetupPreview (cyclomatic 23) · ×1
  • ProjectHealth.analyzerSetupPreview (cyclomatic 23) ProjectHealth.fs:1153 — ProjectHealth.analyzerSetupPreview has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ProjectFiles.classifyFile (cyclomatic 23) · ×1
  • ProjectFiles.classifyFile (cyclomatic 23) ProjectFiles.fs:335 — ProjectFiles.classifyFile has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · FindResponseBudget.planResponse (cyclomatic 23) · ×1
  • FindResponseBudget.planResponse (cyclomatic 23) Types.fs:967 — FindResponseBudget.planResponse has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · FcsBridge.FindPrivateSpan (cyclomatic 22) · ×1
  • FcsBridge.FindPrivateSpan (cyclomatic 22) FcsBridge.fs:12978 — FcsBridge.FindPrivateSpan has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FindInput.prepare (cyclomatic 22) · ×1
  • FindInput.prepare (cyclomatic 22) FindInput.fs:44 — FindInput.prepare has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · FcsBridge.FreshProjectCheck (cyclomatic 21) · ×1
  • FcsBridge.FreshProjectCheck (cyclomatic 21) FcsBridge.fs:10642 — FcsBridge.FreshProjectCheck has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.ReferencedSymbols (cyclomatic 21) · ×1
  • FcsBridge.ReferencedSymbols (cyclomatic 21) FcsBridge.fs:14163 — FcsBridge.ReferencedSymbols has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.ResolvePositionInFile (cyclomatic 21) · ×1
  • FcsBridge.ResolvePositionInFile (cyclomatic 21) FcsBridge.fs:6831 — FcsBridge.ResolvePositionInFile has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · FcsBridge.SymbolAtWord (cyclomatic 21) · ×1
  • FcsBridge.SymbolAtWord (cyclomatic 21) FcsBridge.fs:13146 — FcsBridge.SymbolAtWord has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · Runner.Check (cyclomatic 19) · ×1
  • Runner.Check (cyclomatic 19) ScriptChecking.fs:36 — Runner.Check has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · RenamePreviewShape.validateWorkspaceEdit (cyclomatic 19) · ×1
  • RenamePreviewShape.validateWorkspaceEdit (cyclomatic 19) LspBridge.fs:1018 — RenamePreviewShape.validateWorkspaceEdit has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FcsBridge.FindSymbol (cyclomatic 18) · ×1
  • FcsBridge.FindSymbol (cyclomatic 18) FcsBridge.fs:6653 — FcsBridge.FindSymbol has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · SolutionParsing.discoverProjectsForFind (cyclomatic 18) · ×1
  • SolutionParsing.discoverProjectsForFind (cyclomatic 18) ProjectFiles.fs:664 — SolutionParsing.discoverProjectsForFind has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FcsBridge.NugetTypes (cyclomatic 17) · ×1
  • FcsBridge.NugetTypes (cyclomatic 17) FcsBridge.fs:14260 — FcsBridge.NugetTypes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass's cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold — including the worst — and 1523 of the 1704 points over it (89%), 27.2× the next-largest file (LspBridge.fs at 56). 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 · MetadataAccessibility.candidateAssemblyPaths (cyclomatic 17) · ×1
  • MetadataAccessibility.candidateAssemblyPaths (cyclomatic 17) MetadataAccessibility.fs:61 — MetadataAccessibility.candidateAssemblyPaths has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FsAutoCompleteBridge.RenamePreview (cyclomatic 17) · ×1
  • FsAutoCompleteBridge.RenamePreview (cyclomatic 17) LspBridge.fs:3393 — FsAutoCompleteBridge.RenamePreview has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · ProcessContainment.Start (cyclomatic 17) · ×1
  • ProcessContainment.Start (cyclomatic 17) ProcessRunner.fs:459 — ProcessContainment.Start has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ConstructorDiagnostics.collect (cyclomatic 16) · ×1
  • ConstructorDiagnostics.collect (cyclomatic 16) ConstructorDiagnostics.fs:94 — ConstructorDiagnostics.collect has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Collector.ObserveUses (cyclomatic 16) · ×1
  • Collector.ObserveUses (cyclomatic 16) FindInventory.fs:185 — Collector.ObserveUses has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · DiagnosticIdentity.tryCanonicalFileKeyFromUri (cyclomatic 16) · ×1
  • DiagnosticIdentity.tryCanonicalFileKeyFromUri (cyclomatic 16) LspBridge.fs:135 — DiagnosticIdentity.tryCanonicalFileKeyFromUri has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · FsAutoCompleteBridge.StartLspUnsafe (cyclomatic 16) · ×1
  • FsAutoCompleteBridge.StartLspUnsafe (cyclomatic 16) LspBridge.fs:2206 — FsAutoCompleteBridge.StartLspUnsafe has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: Tools.fs Tools.fs:36 — Tools.fs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is Tools.toolResultWithHealthCheck at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: address bounded agent UX failures (#232)”; “fix: budget public_api and file_outline pages by rendered size; hint the narrowing in-band (#212)”; “fix: return a typed sdk_not_found error instead of a lost transport on unsatisfiable SDK pins (#200)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 13:50:50 +03:00' --until='2026-11-12 13:50:50 +03:00' --full-history --no-merges -- Tools.fs`: 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.
D2 · Cognitive Complexity · FcsBridge.FindCoreWithinDeadline (cognitive 2736) · ×1
  • FcsBridge.FindCoreWithinDeadline (cognitive 2736) FcsBridge.fs:7124 — FcsBridge.FindCoreWithinDeadline has cognitive complexity 2736 (threshold 15). Drivers by points: if/else 275 (1532 pts), match/switch 73 (645 pts), error handling 28 (239 pts), loops 22 (228 pts), boolean chains 92 (nesting depth added 2246). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.Check (cognitive 625) · ×1
  • FcsBridge.Check (cognitive 625) FcsBridge.fs:11188 — FcsBridge.Check has cognitive complexity 625 (threshold 15). Drivers by points: if/else 122 (290 pts), match/switch 54 (207 pts), error handling 17 (93 pts), boolean chains 25, loops 2 (10 pts) (nesting depth added 405). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.NugetMembers (cognitive 338) · ×1
  • FcsBridge.NugetMembers (cognitive 338) FcsBridge.fs:14369 — FcsBridge.NugetMembers has cognitive complexity 338 (threshold 15). Drivers by points: if/else 33 (120 pts), error handling 21 (119 pts), match/switch 11 (49 pts), loops 6 (36 pts), boolean chains 14 (nesting depth added 253). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.TestsForSymbol (cognitive 249) · ×1
  • FcsBridge.TestsForSymbol (cognitive 249) FcsBridge.fs:10112 — FcsBridge.TestsForSymbol has cognitive complexity 249 (threshold 15). Drivers by points: if/else 48 (154 pts), match/switch 10 (37 pts), loops 6 (31 pts), boolean chains 17, error handling 2 (10 pts) (nesting depth added 166). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.SignatureStatus (cognitive 229) · ×1
  • FcsBridge.SignatureStatus (cognitive 229) FcsBridge.fs:15138 — FcsBridge.SignatureStatus has cognitive complexity 229 (threshold 15). Drivers by points: error handling 15 (90 pts), if/else 33 (89 pts), match/switch 10 (39 pts), boolean chains 11 (nesting depth added 160). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.RefactorImpact (cognitive 221) · ×1
  • FcsBridge.RefactorImpact (cognitive 221) FcsBridge.fs:16207 — FcsBridge.RefactorImpact has cognitive complexity 221 (threshold 15). Drivers by points: if/else 56 (129 pts), match/switch 20 (59 pts), boolean chains 13, loops 2 (11 pts), error handling 5 (9 pts) (nesting depth added 125). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.PublicApi (cognitive 212) · ×1
  • FcsBridge.PublicApi (cognitive 212) FcsBridge.fs:14754 — FcsBridge.PublicApi has cognitive complexity 212 (threshold 15). Drivers by points: if/else 48 (102 pts), error handling 24 (83 pts), match/switch 5 (15 pts), boolean chains 12 (nesting depth added 123). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.ProjectOutlineWithinDeadline (cognitive 163) · ×1
  • FcsBridge.ProjectOutlineWithinDeadline (cognitive 163) FcsBridge.fs:13295 — FcsBridge.ProjectOutlineWithinDeadline has cognitive complexity 163 (threshold 15). Drivers by points: match/switch 29 (61 pts), if/else 44 (59 pts), error handling 10 (18 pts), boolean chains 15, loops 5 (10 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.BuildFilePlan (cognitive 141) · ×1
  • FcsBridge.BuildFilePlan (cognitive 141) FcsBridge.fs:16920 — FcsBridge.BuildFilePlan has cognitive complexity 141 (threshold 15). Drivers by points: if/else 46 (85 pts), match/switch 15 (34 pts), boolean chains 9, loops 4 (9 pts), error handling 2 (4 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.RecordFieldAudit (cognitive 137) · ×1
  • FcsBridge.RecordFieldAudit (cognitive 137) FcsBridge.fs:6364 — FcsBridge.RecordFieldAudit has cognitive complexity 137 (threshold 15). Drivers by points: match/switch 17 (64 pts), if/else 15 (48 pts), error handling 3 (15 pts), boolean chains 5, loops 1 (5 pts) (nesting depth added 96). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.SuggestOpen (cognitive 135) · ×1
  • FcsBridge.SuggestOpen (cognitive 135) FcsBridge.fs:15702 — FcsBridge.SuggestOpen has cognitive complexity 135 (threshold 15). Drivers by points: error handling 16 (79 pts), if/else 10 (27 pts), loops 4 (18 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 100). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.CheckCompileOrder (cognitive 134) · ×1
  • FcsBridge.CheckCompileOrder (cognitive 134) FcsBridge.fs:16005 — FcsBridge.CheckCompileOrder has cognitive complexity 134 (threshold 15). Drivers by points: match/switch 9 (56 pts), if/else 16 (55 pts), loops 3 (11 pts), error handling 2 (8 pts), boolean chains 4 (nesting depth added 100). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · ProjectHealth.createReport (cognitive 133) · ×1
  • ProjectHealth.createReport (cognitive 133) ProjectHealth.fs:639 — ProjectHealth.createReport has cognitive complexity 133 (threshold 15). Drivers by points: if/else 41 (100 pts), match/switch 7 (22 pts), boolean chains 7, error handling 1 (4 pts) (nesting depth added 77). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FsAutoCompleteBridge.SetProjectCore (cognitive 128) · ×1
  • FsAutoCompleteBridge.SetProjectCore (cognitive 128) LspBridge.fs:1951 — FsAutoCompleteBridge.SetProjectCore has cognitive complexity 128 (threshold 15). Drivers by points: if/else 25 (102 pts), match/switch 4 (12 pts), boolean chains 9, loops 1 (5 pts) (nesting depth added 89). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FcsBridge.ResolveFastCheckExpectation (cognitive 110) · ×1
  • FcsBridge.ResolveFastCheckExpectation (cognitive 110) FcsBridge.fs:10858 — FcsBridge.ResolveFastCheckExpectation has cognitive complexity 110 (threshold 15). Drivers by points: if/else 29 (50 pts), match/switch 13 (32 pts), error handling 5 (19 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · Program.mainCore (cognitive 103) · ×1
  • Program.mainCore (cognitive 103) Program.fs:621 — Program.mainCore has cognitive complexity 103 (threshold 15). Drivers by points: match/switch 17 (58 pts), if/else 14 (36 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 67). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FcsBridge.DeadCode (cognitive 98) · ×1
  • FcsBridge.DeadCode (cognitive 98) FcsBridge.fs:17441 — FcsBridge.DeadCode has cognitive complexity 98 (threshold 15). Drivers by points: match/switch 8 (32 pts), if/else 10 (31 pts), error handling 7 (22 pts), loops 2 (7 pts), boolean chains 6 (nesting depth added 65). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.SymbolAtWord (cognitive 86) · ×1
  • FcsBridge.SymbolAtWord (cognitive 86) FcsBridge.fs:13146 — FcsBridge.SymbolAtWord has cognitive complexity 86 (threshold 15). Drivers by points: match/switch 8 (46 pts), if/else 13 (38 pts), boolean chains 2 (nesting depth added 63). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.TypeAtPosition (cognitive 67) · ×1
  • FcsBridge.TypeAtPosition (cognitive 67) FcsBridge.fs:12720 — FcsBridge.TypeAtPosition has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 10 (33 pts), if/else 8 (17 pts), loops 3 (13 pts), boolean chains 4 (nesting depth added 42). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.FileOutlineCore (cognitive 65) · ×1
  • FcsBridge.FileOutlineCore (cognitive 65) FcsBridge.fs:5705 — FcsBridge.FileOutlineCore has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (39 pts), match/switch 5 (12 pts), boolean chains 8, loops 2 (6 pts) (nesting depth added 29). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.FindPrivateSpan (cognitive 57) · ×1
  • FcsBridge.FindPrivateSpan (cognitive 57) FcsBridge.fs:12978 — FcsBridge.FindPrivateSpan has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 3 (11 pts), boolean chains 7, match/switch 1 (6 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · NugetPackageMap.packageAssembliesFromAssets (cognitive 56) · ×1
  • NugetPackageMap.packageAssembliesFromAssets (cognitive 56) FcsBridge.fs:2686 — NugetPackageMap.packageAssembliesFromAssets has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 6 (31 pts), loops 4 (24 pts), error handling 1 (nesting depth added 45). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.ReviewScan (cognitive 55) · ×1
  • FcsBridge.ReviewScan (cognitive 55) FcsBridge.fs:17259 — FcsBridge.ReviewScan has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 7 (17 pts), loops 2 (7 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 32). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · CheckFsacSnapshotModule.ofDiagnosticsResponse (cognitive 54) · ×1
  • CheckFsacSnapshotModule.ofDiagnosticsResponse (cognitive 54) FcsBridge.fs:1045 — CheckFsacSnapshotModule.ofDiagnosticsResponse has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 18 (29 pts), if/else 12 (19 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.ReferencedSymbols (cognitive 54) · ×1
  • FcsBridge.ReferencedSymbols (cognitive 54) FcsBridge.fs:14163 — FcsBridge.ReferencedSymbols has cognitive complexity 54 (threshold 15). Drivers by points: error handling 4 (17 pts), if/else 5 (14 pts), match/switch 4 (11 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 36). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.PositionIsUnsafe (cognitive 53) · ×1
  • FcsBridge.PositionIsUnsafe (cognitive 53) FcsBridge.fs:12889 — FcsBridge.PositionIsUnsafe has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 12, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · ProjectHealth.analyzerSetupPreview (cognitive 52) · ×1
  • ProjectHealth.analyzerSetupPreview (cognitive 52) ProjectHealth.fs:1153 — ProjectHealth.analyzerSetupPreview has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 7 (20 pts), error handling 1 (5 pts), loops 1 (3 pts) (nesting depth added 35). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FsAutoCompleteBridge.DiagnosticsForContext (cognitive 51) · ×1
  • FsAutoCompleteBridge.DiagnosticsForContext (cognitive 51) LspBridge.fs:2709 — FsAutoCompleteBridge.DiagnosticsForContext has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 4 (13 pts), loops 4 (10 pts), error handling 5, boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FcsBridge.FindMemberUsages (cognitive 45) · ×1
  • FcsBridge.FindMemberUsages (cognitive 45) FcsBridge.fs:6203 — FcsBridge.FindMemberUsages has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 6 (10 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.ResolvePositionInFile (cognitive 45) · ×1
  • FcsBridge.ResolvePositionInFile (cognitive 45) FcsBridge.fs:6831 — FcsBridge.ResolvePositionInFile has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 5 (19 pts), error handling 1 (5 pts), boolean chains 2 (nesting depth added 29). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · SolutionParsing.discoverProjectsForFind (cognitive 45) · ×1
  • SolutionParsing.discoverProjectsForFind (cognitive 45) ProjectFiles.fs:664 — SolutionParsing.discoverProjectsForFind has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (8 pts), error handling 2 (6 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · FcsBridge.NugetTypes (cognitive 44) · ×1
  • FcsBridge.NugetTypes (cognitive 44) FcsBridge.fs:14260 — FcsBridge.NugetTypes has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (11 pts), loops 2 (9 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 29). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FsAutoCompleteBridge.DiagnosticFixes (cognitive 41) · ×1
  • FsAutoCompleteBridge.DiagnosticFixes (cognitive 41) LspBridge.fs:3251 — FsAutoCompleteBridge.DiagnosticFixes has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 10 (26 pts), if/else 7 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FcsBridge.AnalyzerDiagnostics (cognitive 40) · ×1
  • FcsBridge.AnalyzerDiagnostics (cognitive 40) FcsBridge.fs:17725 — FcsBridge.AnalyzerDiagnostics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (15 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 27). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.FreshProjectCheck (cognitive 40) · ×1
  • FcsBridge.FreshProjectCheck (cognitive 40) FcsBridge.fs:10642 — FcsBridge.FreshProjectCheck has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (11 pts), error handling 6, boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · Cursor.tryDecodeFind (cognitive 40) · ×1
  • Cursor.tryDecodeFind (cognitive 40) Cursor.fs:197 — Cursor.tryDecodeFind has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 6 (14 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RenamePreviewShape.validateWorkspaceEdit (cognitive 39) · ×1
  • RenamePreviewShape.validateWorkspaceEdit (cognitive 39) LspBridge.fs:1018 — RenamePreviewShape.validateWorkspaceEdit has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 9 (37 pts), if/else 2 (nesting depth added 28). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · LspResponseShape.codeActionEdits (cognitive 36) · ×1
  • LspResponseShape.codeActionEdits (cognitive 36) LspBridge.fs:819 — LspResponseShape.codeActionEdits has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 7 (27 pts), loops 2 (9 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · MetadataAccessibility.tryCreateMemberResolver (cognitive 34) · ×1
  • MetadataAccessibility.tryCreateMemberResolver (cognitive 34) MetadataAccessibility.fs:127 — MetadataAccessibility.tryCreateMemberResolver has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (12 pts), match/switch 2 (6 pts), boolean chains 1, error handling 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RenamePreviewShape.extractFileEdits (cognitive 33) · ×1
  • RenamePreviewShape.extractFileEdits (cognitive 33) LspBridge.fs:1071 — RenamePreviewShape.extractFileEdits has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 7 (26 pts), loops 2 (7 pts) (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FcsBridge.ValidateSnippet (cognitive 31) · ×1
  • FcsBridge.ValidateSnippet (cognitive 31) FcsBridge.fs:5444 — FcsBridge.ValidateSnippet has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (7 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · ProjectFiles.classifyFile (cognitive 31) · ×1
  • ProjectFiles.classifyFile (cognitive 31) ProjectFiles.fs:335 — ProjectFiles.classifyFile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 6 (nesting depth added 4). 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 · FindResponseBudget.planResponse (cognitive 31) · ×1
  • FindResponseBudget.planResponse (cognitive 31) Types.fs:967 — FindResponseBudget.planResponse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 7). 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 · Runner.Check (cognitive 30) · ×1
  • Runner.Check (cognitive 30) ScriptChecking.fs:36 — Runner.Check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 5 (10 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FsAutoCompleteBridge.RenamePreview (cognitive 28) · ×1
  • FsAutoCompleteBridge.RenamePreview (cognitive 28) LspBridge.fs:3393 — FsAutoCompleteBridge.RenamePreview has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 6 (9 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). 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 · ProcessContainment.Start (cognitive 28) · ×1
  • ProcessContainment.Start (cognitive 28) ProcessRunner.fs:459 — ProcessContainment.Start has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (9 pts), boolean chains 1 (nesting depth added 11). 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 · WorkspaceDirectoryDiscovery.filesBelowWithContinuation (cognitive 27) · ×1
  • WorkspaceDirectoryDiscovery.filesBelowWithContinuation (cognitive 27) ProjectFiles.fs:449 — WorkspaceDirectoryDiscovery.filesBelowWithContinuation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), error handling 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FsAutoCompleteBridge.Formatting (cognitive 25) · ×1
  • FsAutoCompleteBridge.Formatting (cognitive 25) LspBridge.fs:3125 — FsAutoCompleteBridge.Formatting has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FcsBridge.FindSymbol (cognitive 24) · ×1
  • FcsBridge.FindSymbol (cognitive 24) FcsBridge.fs:6653 — FcsBridge.FindSymbol has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (8 pts), boolean chains 3 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.ProjectSymbolUses (cognitive 24) · ×1
  • FcsBridge.ProjectSymbolUses (cognitive 24) FcsBridge.fs:6111 — FcsBridge.ProjectSymbolUses has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.ResolveProjectOptions (cognitive 24) · ×1
  • FcsBridge.ResolveProjectOptions (cognitive 24) FcsBridge.fs:5199 — FcsBridge.ResolveProjectOptions has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (14 pts), error handling 4 (10 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · Collector.ObserveUses (cognitive 24) · ×1
  • Collector.ObserveUses (cognitive 24) FindInventory.fs:185 — Collector.ObserveUses has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MetadataAccessibility.candidateAssemblyPaths (cognitive 23) · ×1
  • MetadataAccessibility.candidateAssemblyPaths (cognitive 23) MetadataAccessibility.fs:61 — MetadataAccessibility.candidateAssemblyPaths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · ProcessRunner.unixProcessGroupHasLiveMembers (cognitive 23) · ×1
  • ProcessRunner.unixProcessGroupHasLiveMembers (cognitive 23) ProcessRunner.fs:256 — ProcessRunner.unixProcessGroupHasLiveMembers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LspResponseShape.globToRegex (cognitive 22) · ×1
  • LspResponseShape.globToRegex (cognitive 22) LspBridge.fs:548 — LspResponseShape.globToRegex has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CheckDiagnostics.boundResponse (cognitive 21) · ×1
  • CheckDiagnostics.boundResponse (cognitive 21) CheckDiagnostics.fs:83 — CheckDiagnostics.boundResponse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (8 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DiagnosticsTarget.PublishDiagnostics (cognitive 21) · ×1
  • DiagnosticsTarget.PublishDiagnostics (cognitive 21) LspBridge.fs:222 — DiagnosticsTarget.PublishDiagnostics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProcessRunner.runAsyncWithOutputLimitCore (cognitive 21) · ×1
  • ProcessRunner.runAsyncWithOutputLimitCore (cognitive 21) ProcessRunner.fs:702 — ProcessRunner.runAsyncWithOutputLimitCore has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (11 pts), error handling 3 (4 pts), if/else 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FcsBridge.CreateFilePlan (cognitive 20) · ×1
  • FcsBridge.CreateFilePlan (cognitive 20) FcsBridge.fs:16865 — FcsBridge.CreateFilePlan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (5 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FindInput.prepare (cognitive 20) · ×1
  • FindInput.prepare (cognitive 20) FindInput.fs:44 — FindInput.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 3). 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 · ConstructorDiagnostics.fromProjectResults (cognitive 19) · ×1
  • ConstructorDiagnostics.fromProjectResults (cognitive 19) ConstructorDiagnostics.fs:213 — ConstructorDiagnostics.fromProjectResults has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Program.runLimitedWithFindDeadlineRetainedCore (cognitive 18) · ×1
  • Program.runLimitedWithFindDeadlineRetainedCore (cognitive 18) Program.fs:278 — Program.runLimitedWithFindDeadlineRetainedCore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Program.main (cognitive 18) · ×1
  • Program.main (cognitive 18) Program.fs:1343 — Program.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). 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 · AnalysisSnapshotKey.create (cognitive 18) · ×1
  • AnalysisSnapshotKey.create (cognitive 18) FcsBridge.fs:2016 — AnalysisSnapshotKey.create has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), loops 3 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · ConstructorDiagnostics.collect (cognitive 18) · ×1
  • ConstructorDiagnostics.collect (cognitive 18) ConstructorDiagnostics.fs:94 — ConstructorDiagnostics.collect has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (7 pts), if/else 4, loops 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FsAutoCompleteBridge.Diagnostics (cognitive 18) · ×1
  • FsAutoCompleteBridge.Diagnostics (cognitive 18) LspBridge.fs:3040 — FsAutoCompleteBridge.Diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 3 (6 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FsAutoCompleteBridge.StartLspUnsafe (cognitive 18) · ×1
  • FsAutoCompleteBridge.StartLspUnsafe (cognitive 18) LspBridge.fs:2206 — FsAutoCompleteBridge.StartLspUnsafe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 2, loops 2, match/switch 1 (nesting depth added 3). 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 · AnalyzerDiagnostics.parseSarif (cognitive 18) · ×1
  • AnalyzerDiagnostics.parseSarif (cognitive 18) AnalyzerDiagnostics.fs:104 — AnalyzerDiagnostics.parseSarif has cognitive complexity 18 (threshold 15). Drivers by points: loops 2 (7 pts), match/switch 2 (7 pts), error handling 1 (2 pts), if/else 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FindDeadlineResponse.beforeDiscovery (cognitive 17) · ×1
  • FindDeadlineResponse.beforeDiscovery (cognitive 17) FcsBridge.fs:742 — FindDeadlineResponse.beforeDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · ReviewScanner.scan (cognitive 17) · ×1
  • ReviewScanner.scan (cognitive 17) FcsBridge.fs:1738 — ReviewScanner.scan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (6 pts), loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · Program.applyCliOverrides (cognitive 16) · ×1
  • Program.applyCliOverrides (cognitive 16) Program.fs:555 — Program.applyCliOverrides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NugetPackageMap.candidates (cognitive 16) · ×1
  • NugetPackageMap.candidates (cognitive 16) FcsBridge.fs:2881 — NugetPackageMap.candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). 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. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · FcsBridge.BuildSignatureHelpResult (cognitive 16) · ×1
  • FcsBridge.BuildSignatureHelpResult (cognitive 16) FcsBridge.fs:15593 — FcsBridge.BuildSignatureHelpResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), match/switch 3 (6 pts), error handling 1 (4 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold — including the worst — and 5926 of the 6657 points over it (89%), 21.1× the next-largest file (LspBridge.fs at 281). 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.
D2 · Cognitive Complexity · LspResponseShape.filterDiagnosticsBySeverity (cognitive 16) · ×1
  • LspResponseShape.filterDiagnosticsBySeverity (cognitive 16) LspBridge.fs:647 — LspResponseShape.filterDiagnosticsBySeverity has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ProjectHealth.listSolutionProjects (cognitive 16) · ×1
  • ProjectHealth.listSolutionProjects (cognitive 16) ProjectHealth.fs:608 — ProjectHealth.listSolutionProjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · WorkspaceDirectoryDiscovery.filesBelow (cognitive 16) · ×1
  • WorkspaceDirectoryDiscovery.filesBelow (cognitive 16) ProjectFiles.fs:415 — WorkspaceDirectoryDiscovery.filesBelow has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), error handling 2 (5 pts), if/else 1 (3 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
Minor — 15 finding(s)
D12 · Dependency Hygiene · Deprecated · ×4
  • Deprecated: xunit.assert tests/FsLangMcp.Tests/packages.lock.json:665 — xunit.assert 2.9.3 — Legacy — the publisher's replacement is `xunit.v3.assert`; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in.
  • Deprecated: xunit.core tests/FsLangMcp.Tests/packages.lock.json:670 — xunit.core 2.9.3 — Legacy — the publisher's replacement is `xunit.v3.core`; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in.
  • Deprecated: xunit.extensibility.core tests/FsLangMcp.Tests/packages.lock.json:679 — xunit.extensibility.core 2.9.3 — Legacy — the publisher's replacement is `xunit.v3.extensibility.core`; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in.
  • Deprecated: xunit.extensibility.execution tests/FsLangMcp.Tests/packages.lock.json:687 — xunit.extensibility.execution 2.9.3 — Legacy — the publisher's replacement is `xunit.v3.extensibility.core`; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in.
D21 · Naming Consistency · `tryDecode returns Error for valid Base64 but not JSON` spells `JSON` where 38 names in the project spell it `Json` · ×1
  • `tryDecode returns Error for valid Base64 but not JSON` spells `JSON` where 38 names in the project spell it `Json` tests/FsLangMcp.Tests/OutlinePaginationTests.fs:78 — 38 of 40 names in project FsLangMcp spell the token `Json` (38 of 40; unit: names in project FsLangMcp containing `Json`). Peers: AnalyzerDiagnostics.diagnosticToJson (AnalyzerDiagnostics.fs:178); AnalyzerDiagnostics.configuredNotRunResponse(packagesJson) (AnalyzerDiagnostics.fs:241); AnalyzerDiagnostics.runFailedResponse(packagesJson) (AnalyzerDiagnostics.fs:256); AnalyzerDiagnostics.okResponse(packagesJson) (AnalyzerDiagnostics.fs:268); Cursor.writeCanonicalJson (Cursor.fs:342). Rename to `tryDecode returns Error for valid Base64 but not Json`. [rule N6]
D21 · Naming Consistency · `jobj with null value produces null in JSON` spells `JSON` where 38 names in the project spell it `Json` · ×1
  • `jobj with null value produces null in JSON` spells `JSON` where 38 names in the project spell it `Json` tests/FsLangMcp.Tests/TypesToolsTests.fs:59 — 38 of 40 names in project FsLangMcp spell the token `Json` (38 of 40; unit: names in project FsLangMcp containing `Json`). Peers: AnalyzerDiagnostics.diagnosticToJson (AnalyzerDiagnostics.fs:178); AnalyzerDiagnostics.configuredNotRunResponse(packagesJson) (AnalyzerDiagnostics.fs:241); AnalyzerDiagnostics.runFailedResponse(packagesJson) (AnalyzerDiagnostics.fs:256); AnalyzerDiagnostics.okResponse(packagesJson) (AnalyzerDiagnostics.fs:268); Cursor.writeCanonicalJson (Cursor.fs:342). Rename to `jobj with null value produces null in Json`. [rule N6]
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (28267 LoC, 175 module-visible types across 2 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D27 · Navigability · Scattered collaborators · ×1
  • Scattered collaborators — 94 % of calls cross a namespace and only 45 % of collaborators are co-located — group each feature's code into a vertical slice so a call's collaborators sit together.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Production code is mixed at the repository root with everything else the repository holds, so nothing marks which files are the product.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 1/2 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `docs`.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:6 — No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 5 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.
X10 · Duplicated predicate · Duplicated predicate · ×1
  • Duplicated predicate ProjectFiles.fs:164 — `String.Equals(ext, ".fs", StringComparison.OrdinalIgnoreCase) || String.Equals(ext, ".fsi", StringComparison.OrdinalIgnoreCase)` appears character-identically in 2 files — ProjectFiles.fs, ProjectHealth.fs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Minor — 8 finding(s)
D12 · Dependency Hygiene · Outdated · ×8
  • Outdated: FSharp.Compiler.Service — FSharp.Compiler.Service 43.12.400 → 43.13.404 available (referenced by FsLangMcp).
  • Outdated: FSharp.Core — FSharp.Core 10.1.400 → 11.0.101 available (referenced by FsLangMcp).
  • Outdated: G-Research.FSharp.Analyzers — G-Research.FSharp.Analyzers 0.23.0 → 0.27.0 available (referenced by FsLangMcp).
  • Outdated: Ionide.Analyzers — Ionide.Analyzers 0.16.0 → 0.20.0 available (referenced by FsLangMcp).
  • Outdated: Microsoft.NET.StringTools — Microsoft.NET.StringTools 18.9.6 → 18.12.2 available (referenced by FsLangMcp).
  • Outdated: Microsoft.VisualStudio.Threading.Only — Microsoft.VisualStudio.Threading.Only 18.7.23 → 18.12.1 available (referenced by FsLangMcp).
  • Outdated: Nerdbank.MessagePack — Nerdbank.MessagePack 1.3.88 → 1.4.104 available (referenced by FsLangMcp).
  • Outdated: Microsoft.NET.Test.Sdk — Microsoft.NET.Test.Sdk 18.11.0 → 18.12.0 available (referenced by FsLangMcp.Tests).

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-ee6c8e0ab90a4a05b7a9a3e40a3d5a7e/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-ee6c8e0ab90a4a05b7a9a3e40a3d5a7e/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 .2artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesdotnet—dotnet list FsLangMcp.slnx package --vulnerable --include-transitive --format json0artifacts/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—
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—

Run 01a1def7-f1d7-7632-a75a-238f55ebebee · 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