fsprojects/FSharp.Data.GraphQL

Executive summary

fsprojects/FSharp.Data.GraphQL scores 62 out of 100 and is rated Adequate, while four of its six lenses score higher still: Performance at 94, rated Exemplary, Architecture at 79 and Code Health at 74, both rated Strong, and Production Readiness at 63, rated Adequate.

The score is lower than those four because the weakest lens counts most, and here that is Security and Compliance, which scores 58 and is rated Adequate. Its Supply-chain Provenance & Signing dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life and to resolve the 19 REDACTED finding(s) in Static Analysis (SAST). The weakest lenses score close to each other, so improving any of them moves the score.

34 findings are critical: 33 in Static Analysis (SAST) and one in Knowledge Freshness.

Watchdog couldn't measure 35 dimensions in this code, among them Dependency Hygiene, Explicit Debt and Internal API Consistency, so they are left out of the score. The product code is 27,842 lines, which would take an estimated 0.4 person-years, around €60,000, to rebuild.

Code Health 74 Strong Architecture 79 Strong Maturity 60 Adequate, capped by Architecture documentation Production Readiness 63 Adequate, capped by Security & performance tooling Security and Compliance 58 Adequate, capped by Static Analysis (SAST) and Supply-chain Provenance & Signing Performance 94 ★ Exemplary

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.

Security and Compliance 58 · counts for 46%Maturity 60 · counts for 25%Production Readiness 63 · counts for 14%Code Health 74 · counts for 8%Architecture 79 · counts for 4%Performance 94 · counts for 2%

The weakest lenses score close to each other, so improving any of them moves the score.

Code composition: what the lines of code are

Product code 52%Tests 48%

New since the last survey: 17 findings

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

Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/Output.fs src/FSharp.Data.GraphQL.Shared/Output.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/GQLRequest.fs src/FSharp.Data.GraphQL.Shared/GQLRequest.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/Extensions.fs src/FSharp.Data.GraphQL.Shared/Helpers/Extensions.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/CollectionExtensions.fs src/FSharp.Data.GraphQL.Shared/Helpers/CollectionExtensions.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/ObjAndStructConversions.fs src/FSharp.Data.GraphQL.Shared/Helpers/ObjAndStructConversions.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/Diagnostics.fs src/FSharp.Data.GraphQL.Shared/Helpers/Diagnostics.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server.Middleware/TypeSystemExtensions.fs src/FSharp.Data.GraphQL.Server.Middleware/TypeSystemExtensions.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server/DefineExtensions.fs src/FSharp.Data.GraphQL.Server/DefineExtensions.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server/ErrorMessages.fs src/FSharp.Data.GraphQL.Server/ErrorMessages.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/RequestExecutionContext.fs src/FSharp.Data.GraphQL.Server.AspNetCore/RequestExecutionContext.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLWebsocketMiddleware.fs src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLWebsocketMiddleware.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/HttpContext.fs src/FSharp.Data.GraphQL.Server.AspNetCore/HttpContext.fs
Code Coverage · Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/Helpers.fs src/FSharp.Data.GraphQL.Server.AspNetCore/Helpers.fs
Supply-chain Provenance & Signing · REDACTED
Supply-chain Provenance & Signing · REDACTED

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

Fixed since the last survey: 2 findings

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

Code Coverage · Coverage not measured — no coverage collector is wired up
Supply-chain Provenance & Signing REDACTED

Rebuild cost: about €60,000 · Estimate

Cost to rebuild	€20,000 to €99,000, for 330 to 1,046 hours of work, about 0.4 person-years for one engineer
Difficulty of the problem	Standard, 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.9 at a score of 62. 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.
Size	Medium: 27,842 lines of product code

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

Top priorities

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

Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with FSharp.Data.GraphQL.ProjectTemplates.fsproj.

Raises the score by about 2 points · Low effort · Platform End-of-Life

Resolve the 19 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (10), REDACTED (9).

Raises the score by about 3 points · Medium effort · Static Analysis (SAST)

Record your significant design decisions.

Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.

Raises the score by about 3 points · Medium effort · Architecture documentation

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 Security and Compliance, at 58 (Adequate). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.

Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts

What to do: Start with the Security and Compliance actions in Top priorities.

If you do one thing first · First action

Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life. Of all the actions in this report, it raises the score most for the work it takes: about 2 points for low effort, because it clears the 1 Platform End-of-Life findings. The next survey will show the change in the score.

Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — bounded-context dependency graph

Each box is a bounded context (its layer projects grouped, or a project count when large); arrows show dependencies between contexts. A shared kernel is where many arrows converge.

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.

321 modules, with 204 dependencies between them. 2 loops run through 6 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 281 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 FSharp.Data.GraphQL.Ast	3 FSharp.Data.GraphQL.IntegrationTests.Helpers	7 FSharp.Data.GraphQL.Tests.OptionalsNormalizationTests	8 Fake.DotNet	9 FSharp.Data.GraphQL.Types	10 Fake.DotNet.MSBuild	11 FSharp.Data.GraphQL.Types.Introspection	13 FSharp.Data.GraphQL.Client	14 FSharp.Data.GraphQL	30 FSharp.Data.GraphQL.Shared.WebSockets	35 FSharp.Data.GraphQL.Validation	36 FSharp.Data.GraphQL.Values	39 FSharp.Data.GraphQL.Shared
1 FSharp.Data.GraphQL.Ast
2 FSharp.Data.GraphQL.Benchmarks
3 FSharp.Data.GraphQL.IntegrationTests.Helpers
4 FSharp.Data.GraphQL.Samples.ChatApp
5 FSharp.Data.GraphQL.Samples.RelayBookStore
6 FSharp.Data.GraphQL.Server.Relay
7 FSharp.Data.GraphQL.Tests.OptionalsNormalizationTests
8 Fake.DotNet
9 FSharp.Data.GraphQL.Types	6						1		8
10 Fake.DotNet.MSBuild				5
11 FSharp.Data.GraphQL.Types.Introspection					1
12 Fake.DotNet.DotNet						7
13 FSharp.Data.GraphQL.Client							1
14 FSharp.Data.GraphQL							1	3
15 FSharp.Data.GraphQL.Client.Serialization							1	1
16 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.OptionalMultipleOptionalUploadOperation		1							1
17 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.OptionalMultipleUploadOperation		1							1
18 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.RequiredMultipleUploadOperation		1							1
19 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.SingleOptionalUploadOperation		1							1
20 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.SingleRequiredUploadOperation		1							1
21 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.UploadComplexOperation		1							1
22 FSharp.Data.GraphQL.IntegrationTests.LocalProviderTests.UploadRequestOperation		1							1
23 FSharp.Data.GraphQL.IntegrationTests.LocalProviderWithOptionalParametersOnlyTests.OptionalMultipleOptionalUploadOperation		1							1
24 FSharp.Data.GraphQL.IntegrationTests.LocalProviderWithOptionalParametersOnlyTests.OptionalMultipleUploadOperation		1							1
25 FSharp.Data.GraphQL.IntegrationTests.LocalProviderWithOptionalParametersOnlyTests.RequiredMultipleUploadOperation		1							1
26 FSharp.Data.GraphQL.ProvidedOperation	1						1		1
27 FSharp.Data.GraphQL.Provider							3		1
28 FSharp.Data.GraphQL.Server.AspNetCore									5
29 FSharp.Data.GraphQL.Server.Middleware									3
30 FSharp.Data.GraphQL.Shared.WebSockets									5				1
31 FSharp.Data.GraphQL.Tests.InputScalarAndAutoFieldScalarTests			1						2
32 FSharp.Data.GraphQL.Tests.OptionalsNormalizationTestsModule			3						1
33 FSharp.Data.GraphQL.Tests.SkippablesNormalizationTestsModule			3						1
34 FSharp.Data.GraphQL.Types.SchemaDefinitions	1				31				3
35 FSharp.Data.GraphQL.Validation									3
36 FSharp.Data.GraphQL.Values									3
37 StarWars.AppModule									1
38 FSharp.Data.GraphQL.Execution									3			1
39 FSharp.Data.GraphQL.Shared	2									2
40 FSharp.Data.GraphQL.Validation.Ast	26				1		13		1		1

Uses a module listed above itPart of a loopThe module itself

At a glance — Code Health · 74% · Strong ·

The Good

D3 · .NET / C# God Classes 8.7 D4 · .NET / C# Code Duplication 9.0 GD1 · Repo Unfinished & placeholder code 10.0 X20 · Repo Mistyped argument guard 10.0 X23 · Repo Unguarded diagnostic materialisation 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0

The Bad

D1 · .NET / C# Cyclomatic Complexity 6.2 D2 · .NET / C# Cognitive Complexity 5.6

At a glance — Architecture · 79% · Strong ·

The Good

D5 · .NET / C# Coupling 10.0 D6 · .NET / C# Cohesion (LCOM4) 10.0 D26 · .NET / C# Project Cohesion 8.1 D27 · .NET / C# Navigability 9.9 D35 · .NET / C# Change Coupling 10.0 AX2 · Repo Stateful singletons 10.0 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX8 · Repo Test isolation 10.0

The Ugly

AX10 · Repo Code composition 4.0

At a glance — Maturity · 60% · Adequate · gated by M2 ·

The Good

D15 · .NET / C# Churn × Complexity Hotspots 9.3 D19 · .NET / C# Documentation Quality 9.0 D21 · .NET / C# Naming Consistency 10.0 D34 · .NET / C# Knowledge Freshness 9.1 M1 · Repo Documentation (README) 7.3 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Bad

D16 · .NET / C# Bus Factor 6.2

The Ugly

M2 · Repo Architecture documentation 2.0

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

The Good

D8 · .NET / C# Code Coverage 9.8 D13 · .NET / C# Secret Scanning 10.0 D14 · .NET / C# License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P10 · Repo Library API & versioning 10.0 P6 · Repo Release Hygiene 10.0

The Bad

P4 · Repo Deployment & Rollback 5.0

The Ugly

P3 · Repo Security & performance tooling 1.0

At a glance — Security · 58% · Adequate · gated by D29, D36 ·

The Good

D28 · .NET / C# Secrets (history) 10.0 D30 · .NET / C# Dependency Vulnerabilities 10.0 D43 · .NET / C# Malicious Dependencies 10.0

The Bad

D44 · .NET / C# Platform End-of-Life 6.0

The Ugly

D29 · .NET / C# Static Analysis (SAST) 0.3 D36 · .NET / C# Supply-chain Provenance & Signing 0.0

At a glance — Performance · 94% · Exemplary ·

The Good

PF1 · Repo Benchmark discipline 8.5 PF2 · Repo Allocation hygiene 10.0 PF3 · Repo Async & latency hygiene 10.0

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 category	Findings	Severity
A05:2025 — Injection	33	High / Critical
A03:2025 — Software Supply Chain Failures	9	Medium

Roadmap

Begin by resolving the 19 static analysis findings in CI workflows and the single end-of-life runtime warning in project templates to address immediate security and stability risks. Simultaneously, document significant design decisions in a dedicated folder to preserve architectural context and update the single orphaned knowledge file to ensure information accuracy. Finally, implement a draft release or manual gate to prevent bad builds from reaching users, ensuring a safe deployment process.

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

Do this	Helps	Effort	Dimension
Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with FSharp.Data.GraphQL.ProjectTemplates.fsproj.	+1.8 pts	Low	Platform End-of-Life
Resolve the 19 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (10), REDACTED (9).	+3.1 pts	Medium	Static Analysis (SAST)
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.	+3.0 pts	Medium	Architecture documentation
Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with MimeTypes.fs.	+1.3 pts	Low	Knowledge Freshness
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor.	+1.3 pts	Low	Bus Factor
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.	+1.3 pts	Low	Bus Factor
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.	+1.2 pts	Low	Static Analysis (SAST)
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.	+0.8 pts	Low	Supply-chain Provenance & Signing

File quality

Per-file score 0–10 — a quality signature. Of 55 files carrying findings, judged against the Production bar: 4% slop · 54% mixed · 42% near-clean.

File	Score	Band	Worst signal
REDACTED	2.3	Slop	Static Analysis (SAST): High: REDACTED
REDACTED	2.3	Slop	Static Analysis (SAST): High: REDACTED
REDACTED	4.8	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	4.8	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.8	Mixed	Static Analysis (SAST): High: REDACTED
src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs	7.0	Mixed	Cyclomatic Complexity: Provider.makeProvidedType (cyclomatic 60)
src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs	7.0	Mixed	Cognitive Complexity: GraphQLRequestHandler`1.CheckOperationType (cognitive 18)
src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs	7.0	Mixed	God Classes: FileTooLong: FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs
src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs	7.0	Mixed	Code Duplication: Duplicated block (6 lines × 2)
src/FSharp.Data.GraphQL.Server/Values.fs	7.0	Mixed	Cyclomatic Complexity: Values.compileByType (cyclomatic 67)
src/FSharp.Data.GraphQL.Server/Execution.fs	7.0	Mixed	Cyclomatic Complexity: Execution.streamed (cyclomatic 32)
src/FSharp.Data.GraphQL.Shared/TypeSystem.fs	7.0	Mixed	Cyclomatic Complexity: TypeMap.AddType (cyclomatic 19)
src/FSharp.Data.GraphQL.Shared/Validation.fs	7.1	Mixed	Cyclomatic Complexity: Ast.checkInputValue (cyclomatic 32)
src/FSharp.Data.GraphQL.Server/Linq.fs	7.1	Mixed	Cognitive Complexity: Linq.merge (cognitive 20)
src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs	7.2	Mixed	Cyclomatic Complexity: ObjectListFilterModule.buildFilterExpr (cyclomatic 65)
src/FSharp.Data.GraphQL.Shared/AstExtensions.fs	7.4	Mixed	Cyclomatic Complexity: Extensions.Document.ToQueryString (cyclomatic 49)
src/FSharp.Data.GraphQL.Client/JsonValue.fs	7.4	Mixed	Cyclomatic Complexity: JsonValue.WriteTo (cyclomatic 16)
src/FSharp.Data.GraphQL.Shared/AsyncVal.fs	7.4	Mixed	Cognitive Complexity: AsyncVal.collectSequential (cognitive 17)
src/FSharp.Data.GraphQL.Server/Planning.fs	7.4	Mixed	Cognitive Complexity: Planning.planSelection (cognitive 17)
samples/star-wars-api/AuthorizationMiddleware.fs	7.4	Mixed	Code Duplication: Duplicated block (13–16 lines × 2)

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

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

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

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

Could not be resolved — 36

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

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 42 of 45 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

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

What we checked — 45 dimensions across the health lenses

D1D2D3D4D5D6D8D13D14D15D16D19D21D26D27D28D29D30D34D35D36D43D44AX10AX2AX3AX4AX8GD1M1M2M3M4P1P10P3P4P6PF1PF2PF3X20X23X27X28

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

How to trust any code-health report — three questions

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

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

Tools & methods

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

Method	Backs	Version	Evaluator
Roslyn static analysis	Complexity, cohesion, coupling, dead code, API surface, layering	5.3.0	✓ deterministic
Native secret scanner	Hardcoded secrets / credentials	1.0.0	✓ deterministic
Watchdog duplication detector (in-process)	Code duplication	1.0.0	✓ deterministic
Coverage (coverlet / dotnet-coverage)	Line & branch coverage	10.0.400	✓ deterministic
NuGet / dotnet	Outdated, vulnerable & deprecated dependencies	10.0.400	✓ deterministic
git / LibGit2Sharp	Churn hotspots, knowledge concentration, history	2.43.0 · 0.31.0	✓ deterministic
gitleaks · semgrep · trivy	Secrets in history, SAST, CVEs, IaC & container, PII / GDPR	1.86.0 · 0.69.3	✓ deterministic
LLM (sampled · advisory)	Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement	Local LLM	◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a16a91-a117-72b5-8fc8-013670a67c50.

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.

D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: error: The imported project "/usr/share/dotnet/sdk/10.0.400/Xamarin/Android/Xamarin.Android.FSharp.targets" was not found. Confirm that the expression in the Import declaration "$(MSBuildExtensionsPath)/Xamarin/Android/Xamarin.Android.FSharp.targets", which evaluated to "/usr/share/dotnet/sdk/10.0.4….
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/FSharp.Data.GraphQL.Server/Execution.fs, src/FSharp.Data.GraphQL.Server/Planning.fs, src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs, src/FSharp.Data.GraphQL.Server/Linq.fs, src/FSharp.Data.GraphQL.Shared/TypeSystem.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.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (samples/FSharp.Data.GraphQL.ProjectTemplates.fsproj), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
D30 Dependency Vulnerabilities — measured, with a gap in what it reached — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan. 2 of 3 declared ecosystem(s) (npm,osv) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
D39 IL Efficiency — not measured this run — 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. `dotnet build` exited 1 with a compiler/MSBuild diagnostic, so there were no assemblies to read IL from. The build itself is D18's row, with the ask; nothing further is charged here.
AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is 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.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (start). the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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 none applies: this repository publishes a library and deploys nothing (no container, IaC or deployment manifest), so it holds no runtime state of its own. Any data-access dependency it declares is the store it is a CLIENT for, not one it operates. The DR control belongs to whoever runs that data.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X6 Hand-rolled structured-format parsing — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Python, JavaScript/TypeScript, Go, Java/Kotlin/Scala, Ruby, PHP, Rust, Swift, Erlang, Elixir and Dart source only, and no C# was loaded and none of those languages was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
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.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.

The LLM boundary

LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

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

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

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

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

23 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was SchemaDefinitions.coerceObjectListFilterInput at 99. A further 4 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being Linq.track at 38 — they are counted neither in the figure above nor in this dimension's score. 3 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/FSharp.Data.GraphQL.Server/Linq.fs (Linq.track at 38), src/FSharp.Data.GraphQL.Client/Serialization.fs (Serialization.toJsonValue at 19), src/FSharp.Data.GraphQL.Server.AspNetCore/IncrementalDelivery.fs (IncrementalDelivery.Apply at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

SchemaDefinitions.coerceObjectListFilterInput (cyclomatic 99)src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs:23

Values.compileByType (cyclomatic 67)src/FSharp.Data.GraphQL.Server/Values.fs:96

ObjectListFilterModule.buildFilterExpr (cyclomatic 65)src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:296

MSBuild.fromCliArguments (cyclomatic 61)build/MSBuild.fs:733

Provider.makeProvidedType (cyclomatic 60)src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:708

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

What to do

Bring the 23 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with SchemaDefinitions.coerceObjectListFilterInput (cyclomatic 99), Values.compileByType (cyclomatic 67), ObjectListFilterModule.buildFilterExpr (cyclomatic 65). — 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 23 together lifts Cyclomatic Complexity from 6.2 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D2 · Cognitive Complexity5.6 / 10Adequate✓ 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 5.6 / 10 · rule-coverage 100% · ceiling Prevented

34 method(s) exceeded the cognitive complexity threshold of 15; the worst was Values.compileByType at 145.

Values.compileByType (cognitive 145)src/FSharp.Data.GraphQL.Server/Values.fs:96

Values.coerceVariableValue (cognitive 74)src/FSharp.Data.GraphQL.Server/Values.fs:432

ObjectListFilterModule.buildFilterExpr (cognitive 70)src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:296

Provider.makeProvidedType (cognitive 58)src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:708

JsonValueHelper.getFieldValue (cognitive 54)src/FSharp.Data.GraphQL.Client/BaseTypes.fs:318

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

What to do

Bring the 3 bodies over 60 down to 60 or less in Cognitive Complexity — start with Values.compileByType (cognitive 145), Values.coerceVariableValue (cognitive 74), ObjectListFilterModule.buildFilterExpr (cognitive 70). — 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 3 together lifts Cognitive Complexity from 5.6 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D3 · God Classes8.7 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

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

9 god class(es) detected.

FileTooLong: FSharp.Data.GraphQL.Shared/TypeSystem.fs · ×6src/FSharp.Data.GraphQL.Shared/TypeSystem.fs

TooManyFunctions: Linq · ×2src/FSharp.Data.GraphQL.Server/Linq.fs:3

TooManyMethods: Definesrc/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:713

What to do

Resolve the 6 FileTooLong finding(s) in God Classes — start with TypeSystem.fs, Validation.fs, SchemaDefinitions.fs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 2 TooManyFunctions finding(s) in God Classes — start with Linq.fs, Planning.fs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 TooManyMethods finding(s) in God Classes — start with SchemaDefinitions.fs. — One of this dimension's main actionable groups (1 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D4 · Code Duplication9.0 / 10Strong✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

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

60 duplicated block group(s) detected. 5 of the 60 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (6 lines × 2) · ×14src/FSharp.Data.GraphQL.Client/JsonValue.fs:245

Duplicated block (8 lines × 2) · ×7src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs:21

Duplicated block (7 lines × 2) · ×4src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:44

Duplicated block (17 lines × 2) · ×3src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1119

Duplicated block (11 lines × 2) · ×3src/FSharp.Data.GraphQL.Client/GraphQLClient.fs:64

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

What to do

Resolve the 14 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with SchemaDefinitions.fs (7), Linq.fs (2), JsonValue.fs. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 7 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with SchemaDefinitions.fs (6), ErrorsProcessing.fs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 4 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with SchemaDefinitions.fs (2), ServiceCollectionExtensions.fs, TypeSystem.fs. — One of this dimension's main actionable groups (4 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

D5 · 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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

Do you agree with this assessment?

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 14 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

Do you agree with this assessment?

D8 · Code Coverage9.8 / 10Stronggated by 15 serious findings✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.

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

Line coverage 75.7% — 15 file(s) below 50%.

Low coverage: src/FSharp.Data.GraphQL.Shared/Output.fs · ×15src/FSharp.Data.GraphQL.Shared/Output.fs:1

What to do

Resolve the 15 Low coverage finding(s) in Code Coverage — start with Output.fs, SchemaDefinitionsExtensions.fs, GQLRequest.fs. — One of this dimension's main actionable groups (15 warning-level).
Enforce Code Coverage in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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 253 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 52 direct `PackageReference`(s), and 233 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots9.3 / 10Stronggated by 11 serious findings✓ Tool-verified

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

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

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

Top hotspots: src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs (4×99=396); src/FSharp.Data.GraphQL.Server/Execution.fs (10×32=320); src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs (3×60=180)

Hotspot: src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs · ×11src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs:23

What to do

Resolve the 11 Hotspot finding(s) in Churn × Complexity Hotspots — start with SchemaDefinitions.fs, Execution.fs, ProvidedTypesHelper.fs. — One of this dimension's main actionable groups (11 warning-level).

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

Do you agree with this assessment?

D16 · Bus Factor6.2 / 10Adequate✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

21 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/FSharp.Data.GraphQL.Server/Execution.fs. Counted over 55 of the 86 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1

Further sole-owners (lower concentration)

What to do

Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D19 · Documentation QualityExemplary◐ Sampled · advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

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

The repository's root README (FSharp.Data.GraphQL) is a clear project description plus installation and usage for the main package. The samples directories each document their own subdirectories with exhaustive table-of-contents coverage of setup, features, commands, and reproduction steps. A dedicated architecture/design doc exists (docs/execution-pipeline.md). All visible documents are well structured with headings; the only unshown element is a root README licence section. The repository is well documented: the READMEs cover each project's purpose and usage (FSharp.Data.GraphQL server/client quick start, type coercion guide), plus architecture/design docs for GraphQL parsing whitespace rejection, a release notes doc, and an exhaustive type-system reference. The documentation is complete, well-structured, and clear.

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

Do you agree with this assessment?

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

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

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

Do you agree with this assessment?

D26 · Project Cohesion8.1 / 10Strong✓ Tool-verified

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

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

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

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

Projects may be oversized for their cohesion

What to do

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

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

Do you agree with this assessment?

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

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

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

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

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

88 % of calls cross a namespace and 3 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

Do you agree with this assessment?

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.

Do you agree with this assessment?

D29 · Static Analysis (SAST)0.3 / 10Critical✓ 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 0.3 / 10 · rule-coverage 100% · ceiling Documented

33 finding(s): 0 critical, 33 high, 0 medium, 0 low. 13 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. Separately, one or more rules could not re-parse an embedded snippet in 4 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

What to do

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

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

Do you agree with this assessment?

D34 · Knowledge Freshness9.1 / 10Adequategated by 1 critical finding✓ 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 9.1 / 10 · rule-coverage 100% · ceiling Documented

5 of 55 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/FSharp.Data.GraphQL.Client/MimeTypes.fs. Counted over 55 of the 86 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgesrc/FSharp.Data.GraphQL.Client/MimeTypes.fs:1

Orphaned file · ×4src/FSharp.Data.GraphQL.Client/JsonValue.fs:1

Further orphaned files (smaller)

What to do

Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with MimeTypes.fs. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 4 Orphaned file finding(s) in Knowledge Freshness — start with JsonValue.fs, JsonConverters.fs, MemoryCache.fs. — One of this dimension's main actionable groups (4 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

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

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

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

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

REDACTED

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

What to do

Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
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).
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).

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Do you agree with this assessment?

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

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

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

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

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

End-of-life runtime: .NET net6.0samples/FSharp.Data.GraphQL.ProjectTemplates.fsproj:11

What to do

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

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

Do you agree with this assessment?

Frontend & cross-cutting dimensions

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

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

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

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

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

What to do

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

Do you agree with this assessment?

AX2 · Stateful singletons10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.

Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

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

What to do

Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 2 of 3 project(s) that lack one — worth up to 1.3 pts.

Do you agree with this assessment?

M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.

Do you agree with this assessment?

M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

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

Do you agree with this assessment?

M4 · Documentation accuracy10.0 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

Do you agree with this assessment?

P1 · CI/CD 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.

Do you agree with this assessment?

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

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

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

Do you agree with this assessment?

P3 · Security & performance tooling1.0 / 10Critical✓ Tool-verified

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

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

No static application security testing detected. For this repository's stack, add `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 18244 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

Add a SAST step to CI running what this repository's stack ships: `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.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

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.

The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

What to do

Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

Do you agree with this assessment?

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.

Do you agree with this assessment?

PF1 · Benchmark discipline8.5 / 10Strong✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

A F#/VB BenchmarkDotNet suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured. — tests/FSharp.Data.GraphQL.Benchmarks/ParsingBenchmark.fs

What to do

Add [<MemoryDiagnoser>] to the benchmarks so allocation regressions are visible, not just time.

Do you agree with this assessment?

PF2 · Allocation hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.

Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.

Do you agree with this assessment?

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

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

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language 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.

Do you agree with this assessment?

X20 · Mistyped argument guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `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.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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.

Lens	Score	Rating	Impact
Code Health	74%	Strong	Solid.
Architecture	79%	Strong	Solid.
Maturity	60%	Adequate — gated by M2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness	63%	Adequate — gated by P3	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security	58%	Adequate — gated by D29, D36	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance	94%	Exemplary	Strongest area.

Unscored — 1 check(s) recorded observations but carry no score

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

SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Not evidenced — 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 — 71 check(s) not relevant to this codebase

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

AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — 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
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
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
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 — ~25565 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 MEASURED: this repository did not build in our analyzer environment (a C#/MSBuild compiler error), so no test ever ran and flakiness could not be exercised. It is excluded from the score rather than counted as a defect. We did not read WHERE the failing diagnostic is, so this does not claim the fault is in your test code — a repository written for an older SDK band can compile for you and not for us. Run `dotnet build` on this commit: if it succeeds, the gap is ours and nothing here is a defect in your code.
D12 Dependency Hygiene — Dependency hygiene not measured
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.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
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+ projects each declaring an entity of their own. 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 — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — IL not measured — the target did not build
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D9 Test Distribution — Test source is 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 its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
DM1 Domain Modelling — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 6 strongly-typed id(s); 281 value object(s); 6 domain event(s); its domain events are published by services or handlers — no domain entity raises one; no aggregate is declared and no domain structure surrounds the state-guarding types: not claimed as DDD
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 — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — This repository's F# source (9 module(s), 86 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
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 — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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.
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 — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 34 finding(s)

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D34 · Knowledge Freshness · Orphaned knowledge · ×1

Orphaned knowledge src/FSharp.Data.GraphQL.Client/MimeTypes.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.

Serious — 159 finding(s)

D8 · Code Coverage · Low coverage · ×15

Low coverage: src/FSharp.Data.GraphQL.Shared/Output.fs src/FSharp.Data.GraphQL.Shared/Output.fs:1 — 35.2% line coverage (32/91).
Low coverage: src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:1 — 43.8% line coverage (35/80).
Low coverage: src/FSharp.Data.GraphQL.Shared/GQLRequest.fs src/FSharp.Data.GraphQL.Shared/GQLRequest.fs:1 — 0.0% line coverage (0/5).
Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/Extensions.fs src/FSharp.Data.GraphQL.Shared/Helpers/Extensions.fs:1 — 42.9% line coverage (6/14).
Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/CollectionExtensions.fs src/FSharp.Data.GraphQL.Shared/Helpers/CollectionExtensions.fs:1 — 48.4% line coverage (44/91).
Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/ObjAndStructConversions.fs src/FSharp.Data.GraphQL.Shared/Helpers/ObjAndStructConversions.fs:1 — 40.7% line coverage (11/27).
Low coverage: src/FSharp.Data.GraphQL.Shared/Helpers/Diagnostics.fs src/FSharp.Data.GraphQL.Shared/Helpers/Diagnostics.fs:1 — 0.0% line coverage (0/15).
Low coverage: src/FSharp.Data.GraphQL.Server.Middleware/TypeSystemExtensions.fs src/FSharp.Data.GraphQL.Server.Middleware/TypeSystemExtensions.fs:1 — 30.4% line coverage (7/23).
Low coverage: src/FSharp.Data.GraphQL.Server/DefineExtensions.fs src/FSharp.Data.GraphQL.Server/DefineExtensions.fs:1 — 0.0% line coverage (0/5).
Low coverage: src/FSharp.Data.GraphQL.Server/ErrorMessages.fs src/FSharp.Data.GraphQL.Server/ErrorMessages.fs:1 — 0.0% line coverage (0/2).
Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/RequestExecutionContext.fs src/FSharp.Data.GraphQL.Server.AspNetCore/RequestExecutionContext.fs:1 — 0.0% line coverage (0/17).
Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLWebsocketMiddleware.fs src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLWebsocketMiddleware.fs:1 — 0.0% line coverage (0/20).
Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs:1 — 43.8% line coverage (71/162).
Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/HttpContext.fs src/FSharp.Data.GraphQL.Server.AspNetCore/HttpContext.fs:1 — 32.5% line coverage (13/40).
Low coverage: src/FSharp.Data.GraphQL.Server.AspNetCore/Helpers.fs src/FSharp.Data.GraphQL.Server.AspNetCore/Helpers.fs:1 — 0.0% line coverage (0/15).

D4 · Code Duplication · Duplicated block (6 lines × 2) · ×14

Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Client/JsonValue.fs:245 — src/FSharp.Data.GraphQL.Client/JsonValue.fs:245-250 | src/FSharp.Data.GraphQL.Client/JsonValue.fs:262-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:298 — src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:298-303 | src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:318-323 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Server/Linq.fs:218 — src/FSharp.Data.GraphQL.Server/Linq.fs:218-223 | src/FSharp.Data.GraphQL.Server/Linq.fs:243-248 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Server/Linq.fs:225 — src/FSharp.Data.GraphQL.Server/Linq.fs:225-230 | src/FSharp.Data.GraphQL.Server/Linq.fs:250-255 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Server/Planning.fs:425 — src/FSharp.Data.GraphQL.Server/Planning.fs:425-430 | src/FSharp.Data.GraphQL.Server/Planning.fs:479-484 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:962 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:962-967 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1001-1006 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:962` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1038 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1038-1043 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1076-1081 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1038` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1057 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1057-1062 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1097-1102 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1057` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1133 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1133-1138 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1209-1214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1133` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1171 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1171-1176 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1248-1253 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1171` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1627 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1627-1632 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1673-1678 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1627` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1811 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1811-1816 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1857-1862 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1811` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:84 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:84-89 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:100-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) samples/chat-app/server/Schema.fs:707 — samples/chat-app/server/Schema.fs:707-712 | samples/chat-app/server/Schema.fs:747-752 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `samples/chat-app/server/Schema.fs:707` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `samples/chat-app/server/Schema.fs:753` calls `MessageId`, `Arg` and `samples/chat-app/server/Schema.fs:713` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D15 · Churn × Complexity Hotspots · Hotspot · ×11

Hotspot: src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs:23 — src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs changed 4 times in last 90 days, max cyclomatic complexity 99 in SchemaDefinitions.coerceObjectListFilterInput at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.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: src/FSharp.Data.GraphQL.Server/Execution.fs src/FSharp.Data.GraphQL.Server/Execution.fs:540 — src/FSharp.Data.GraphQL.Server/Execution.fs changed 10 times in last 90 days, max cyclomatic complexity 32 in Execution.streamed at line 540. 1 of those changes was a fix/bug commit, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Server/Execution.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: src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:708 — src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs changed 3 times in last 90 days, max cyclomatic complexity 60 in Provider.makeProvidedType at line 708. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.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: src/FSharp.Data.GraphQL.Client/BaseTypes.fs src/FSharp.Data.GraphQL.Client/BaseTypes.fs:318 — src/FSharp.Data.GraphQL.Client/BaseTypes.fs changed 3 times in last 90 days, max cyclomatic complexity 57 in JsonValueHelper.getFieldValue at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Client/BaseTypes.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: src/FSharp.Data.GraphQL.Shared/Validation.fs src/FSharp.Data.GraphQL.Shared/Validation.fs:967 — src/FSharp.Data.GraphQL.Shared/Validation.fs changed 5 times in last 90 days, max cyclomatic complexity 32 in Ast.checkInputValue at line 967. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Shared/Validation.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: src/FSharp.Data.GraphQL.Shared/TypeSystem.fs src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:2132 — src/FSharp.Data.GraphQL.Shared/TypeSystem.fs changed 8 times in last 90 days, max cyclomatic complexity 19 in TypeMap.AddType at line 2132. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Shared/TypeSystem.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: src/FSharp.Data.GraphQL.Server/ObservableExtensions.fs src/FSharp.Data.GraphQL.Server/ObservableExtensions.fs:146 — src/FSharp.Data.GraphQL.Server/ObservableExtensions.fs changed 4 times in last 90 days, max cyclomatic complexity 31 in Observable.ofAsyncEnumerableResolved at line 146. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Server/ObservableExtensions.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: src/FSharp.Data.GraphQL.Server/Planning.fs src/FSharp.Data.GraphQL.Server/Planning.fs:447 — src/FSharp.Data.GraphQL.Server/Planning.fs changed 7 times in last 90 days, max cyclomatic complexity 15 in Planning.planAbstraction at line 447. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Server/Planning.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: src/FSharp.Data.GraphQL.Server/Linq.fs src/FSharp.Data.GraphQL.Server/Linq.fs:278 — src/FSharp.Data.GraphQL.Server/Linq.fs changed 2 times in last 90 days, max cyclomatic complexity 38 in Linq.track at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Server/Linq.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: src/FSharp.Data.GraphQL.Client/Serialization.fs src/FSharp.Data.GraphQL.Client/Serialization.fs:164 — src/FSharp.Data.GraphQL.Client/Serialization.fs changed 3 times in last 90 days, max cyclomatic complexity 19 in Serialization.toJsonValue at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Client/Serialization.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: src/FSharp.Data.GraphQL.Shared/Ast.fs src/FSharp.Data.GraphQL.Shared/Ast.fs:118 — src/FSharp.Data.GraphQL.Shared/Ast.fs changed 2 times in last 90 days, max cyclomatic complexity 19 in InputValue.OfObject at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:15:24 +02:00' --until='2026-10-02 22:15:24 +02:00' --full-history --no-merges -- src/FSharp.Data.GraphQL.Shared/Ast.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.

D4 · Code Duplication · Duplicated block (8 lines × 2) · ×7

Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs:21 — src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs:21-28 | src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs:49-56 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1586 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1586-1593 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1607-1614 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1586` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1628 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1628-1635 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1651-1658 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1628` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1674 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1674-1681 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1699-1706 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1674` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1770 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1770-1777 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1791-1798 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1770` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1812 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1812-1819 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1835-1842 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1812` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1858 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1858-1865 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1883-1890 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1858` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D3 · God Classes · FileTooLong · ×6

FileTooLong: FSharp.Data.GraphQL.Shared/TypeSystem.fs src/FSharp.Data.GraphQL.Shared/TypeSystem.fs — FileTooLong — 1740 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 31 functions. The bar is 500 significant lines; this is 1240 over it, 3.48× 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: FSharp.Data.GraphQL.Shared/Validation.fs src/FSharp.Data.GraphQL.Shared/Validation.fs — FileTooLong — 1549 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 75 functions. The bar is 500 significant lines; this is 1049 over it, 3.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs — FileTooLong — 1153 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 653 over it, 2.31× 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: FSharp.Data.GraphQL.Server/Execution.fs src/FSharp.Data.GraphQL.Server/Execution.fs — FileTooLong — 1002 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 45 functions. The bar is 500 significant lines; this is 502 over it, 2.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs — FileTooLong — 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79× 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: FSharp.Data.GraphQL.Server/Values.fs src/FSharp.Data.GraphQL.Server/Values.fs — FileTooLong — 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.

D4 · Code Duplication · Duplicated block (7 lines × 2) · ×4

Duplicated block (7 lines × 2) src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:44 — src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:44-50 | src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:99-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1649 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1649-1655 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1697-1703 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1649` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1833 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1833-1839 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1881-1887 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1833` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1683 — src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1683-1689 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1722-1728 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (17 lines × 2) · ×3

Duplicated block (17 lines × 2) src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1119 — src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1119-1135 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1972-1988 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) samples/chat-app/server/Schema.fs:623 — samples/chat-app/server/Schema.fs:623-639 | samples/chat-app/server/Schema.fs:667-683 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `samples/chat-app/server/Schema.fs:623` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) samples/star-wars-fabulous-client/StarWars.Android/Properties/AssemblyInfo.fs:19 — samples/star-wars-fabulous-client/StarWars.Android/Properties/AssemblyInfo.fs:19-35 | samples/star-wars-fabulous-client/StarWars.iOS/Properties/AssemblyInfo.fs:14-31 — before extracting anything, compare `samples/star-wars-fabulous-client/StarWars.Android/Properties/AssemblyInfo.fs` and `samples/star-wars-fabulous-client/StarWars.iOS/Properties/AssemblyInfo.fs` as WHOLE FILES: 86% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3

Duplicated block (11 lines × 2) src/FSharp.Data.GraphQL.Client/GraphQLClient.fs:64 — src/FSharp.Data.GraphQL.Client/GraphQLClient.fs:64-74 | src/FSharp.Data.GraphQL.Client/GraphQLClient.fs:152-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.GraphQL.Shared/Introspection.fs:95 — src/FSharp.Data.GraphQL.Shared/Introspection.fs:95-105 | src/FSharp.Data.GraphQL.Shared/Introspection.fs:133-143 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/Introspection.fs:95` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) samples/chat-app/server/Schema.fs:756 — samples/chat-app/server/Schema.fs:756-766 | samples/chat-app/server/Schema.fs:799-809 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `samples/chat-app/server/Schema.fs:756` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `samples/chat-app/server/Schema.fs:754` calls `Arg` and `samples/chat-app/server/Schema.fs:797` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (7 lines × 3) · ×3

Duplicated block (7 lines × 3) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1136 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1136-1142 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1288-1294 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1440-1446 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1174 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1174-1180 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1326-1332 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1478-1484 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1212 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1212-1218 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1364-1370 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1516-1522 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (5 lines × 2) · ×3

Duplicated block (5 lines × 2) samples/star-wars-api/AuthorizationMiddleware.fs:64 — samples/star-wars-api/AuthorizationMiddleware.fs:64-70 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:63-67 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:62` calls `raise` and `samples/star-wars-api/AuthorizationMiddleware.fs:63` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) samples/star-wars-api/AuthorizationMiddleware.fs:67 — samples/star-wars-api/AuthorizationMiddleware.fs:67-71 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:103-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `samples/star-wars-api/AuthorizationMiddleware.fs:71` calls `ToString` and `src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:109` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) src/FSharp.Data.GraphQL.Server/Linq.fs:186 — src/FSharp.Data.GraphQL.Server/Linq.fs:186-190 | src/FSharp.Data.GraphQL.Server/Linq.fs:196-200 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D3 · God Classes · TooManyFunctions · ×2

TooManyFunctions: Linq src/FSharp.Data.GraphQL.Server/Linq.fs:3 — TooManyFunctions — 38 functions. The bar is 30 functions; this is 8 over it, 1.27× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: Planning src/FSharp.Data.GraphQL.Server/Planning.fs:4 — TooManyFunctions — 31 functions. The bar is 30 functions; this is 1 over it, 1.03× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.

D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2

Duplicated block (16 lines × 2) src/FSharp.Data.GraphQL.Server/Values.fs:479 — src/FSharp.Data.GraphQL.Server/Values.fs:479-494 | src/FSharp.Data.GraphQL.Server/Values.fs:610-625 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1665 — src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1665-1680 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1704-1719 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1665` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.

D4 · Code Duplication · Duplicated block (12 lines × 2) · ×2

Duplicated block (12 lines × 2) src/FSharp.Data.GraphQL.Shared/Errors.fs:219 — src/FSharp.Data.GraphQL.Shared/Errors.fs:219-230 | src/FSharp.Data.GraphQL.Shared/Errors.fs:236-247 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/FSharp.Data.GraphQL.Shared/AstExtensions.fs:147 — src/FSharp.Data.GraphQL.Shared/AstExtensions.fs:147-158 | src/FSharp.Data.GraphQL.Shared/AstExtensions.fs:164-175 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (10 lines × 2) · ×2

Duplicated block (10 lines × 2) src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:324 — src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:324-333 | src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:360-369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:334` calls `Not` and `src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:370` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:24 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:24-33 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:37-46 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×2

Duplicated block (9–10 lines × 2) src/FSharp.Data.GraphQL.Server/Linq.fs:234 — src/FSharp.Data.GraphQL.Server/Linq.fs:234-242 | src/FSharp.Data.GraphQL.Server/Linq.fs:259-268 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–10 lines × 2) src/FSharp.Data.GraphQL.Shared/Errors.fs:242 — src/FSharp.Data.GraphQL.Shared/Errors.fs:242-250 | src/FSharp.Data.GraphQL.Shared/Errors.fs:261-270 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (9 lines × 2) · ×2

Duplicated block (9 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1723 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1723-1731 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1750-1758 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1723` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1907 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1907-1915 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1934-1942 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1907` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×2

Duplicated block (6–7 lines × 2) src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:137 — src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:137-143 | src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:174-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6–7 lines × 2) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:981 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:981-987 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1020-1025 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:981` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (6 lines × 4) · ×2

Duplicated block (6 lines × 4) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1285 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1285-1290 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1361-1366 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1437-1442 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1513-1518 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1285` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 4) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1323 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1323-1328 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1400-1405 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1475-1480 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1552-1557 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1323` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D1 · Cyclomatic Complexity · SchemaDefinitions.coerceObjectListFilterInput (cyclomatic 99) · ×1

SchemaDefinitions.coerceObjectListFilterInput (cyclomatic 99) src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs:23 — SchemaDefinitions.coerceObjectListFilterInput has cyclomatic complexity 99 (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 · Values.compileByType (cyclomatic 67) · ×1

Values.compileByType (cyclomatic 67) src/FSharp.Data.GraphQL.Server/Values.fs:96 — Values.compileByType has cyclomatic complexity 67 (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 · ObjectListFilterModule.buildFilterExpr (cyclomatic 65) · ×1

ObjectListFilterModule.buildFilterExpr (cyclomatic 65) src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:296 — ObjectListFilterModule.buildFilterExpr has cyclomatic complexity 65 (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 · MSBuild.fromCliArguments (cyclomatic 61) · ×1

MSBuild.fromCliArguments (cyclomatic 61) build/MSBuild.fs:733 — MSBuild.fromCliArguments has cyclomatic complexity 61 (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 · Provider.makeProvidedType (cyclomatic 60) · ×1

Provider.makeProvidedType (cyclomatic 60) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:708 — Provider.makeProvidedType has cyclomatic complexity 60 (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 · JsonValueHelper.getFieldValue (cyclomatic 57) · ×1

JsonValueHelper.getFieldValue (cyclomatic 57) src/FSharp.Data.GraphQL.Client/BaseTypes.fs:318 — JsonValueHelper.getFieldValue has cyclomatic complexity 57 (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 · Extensions.Document.ToQueryString (cyclomatic 49) · ×1

Extensions.Document.ToQueryString (cyclomatic 49) src/FSharp.Data.GraphQL.Shared/AstExtensions.fs:105 — Extensions.Document.ToQueryString has cyclomatic complexity 49 (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 · Values.coerceVariableValue (cyclomatic 42) · ×1

Values.coerceVariableValue (cyclomatic 42) src/FSharp.Data.GraphQL.Server/Values.fs:432 — Values.coerceVariableValue has cyclomatic complexity 42 (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 · Provider.getSchemaProvidedTypes (cyclomatic 42) · ×1

Provider.getSchemaProvidedTypes (cyclomatic 42) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:585 — Provider.getSchemaProvidedTypes has cyclomatic complexity 42 (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 · TypeCoercion.coerceFilter (cyclomatic 40) · ×1

TypeCoercion.coerceFilter (cyclomatic 40) src/FSharp.Data.GraphQL.Server.Middleware/TypeCoercion.fs:164 — TypeCoercion.coerceFilter has cyclomatic complexity 40 (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 · ProvidedOperation.makeProvidedType (cyclomatic 39) · ×1

ProvidedOperation.makeProvidedType (cyclomatic 39) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:285 — ProvidedOperation.makeProvidedType has cyclomatic complexity 39 (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 · Ast.checkInputValue (cyclomatic 32) · ×1

Ast.checkInputValue (cyclomatic 32) src/FSharp.Data.GraphQL.Shared/Validation.fs:967 — Ast.checkInputValue has cyclomatic complexity 32 (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 · Execution.streamed (cyclomatic 32) · ×1

Execution.streamed (cyclomatic 32) src/FSharp.Data.GraphQL.Server/Execution.fs:540 — Execution.streamed has cyclomatic complexity 32 (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 · Observable.ofAsyncEnumerableResolved (cyclomatic 31) · ×1

Observable.ofAsyncEnumerableResolved (cyclomatic 31) src/FSharp.Data.GraphQL.Server/ObservableExtensions.fs:146 — Observable.ofAsyncEnumerableResolved 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 · Provider.getOperationMetadata (cyclomatic 28) · ×1

Provider.getOperationMetadata (cyclomatic 28) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:489 — Provider.getOperationMetadata has cyclomatic complexity 28 (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 · Execution.direct (cyclomatic 26) · ×1

Execution.direct (cyclomatic 26) src/FSharp.Data.GraphQL.Server/Execution.fs:409 — Execution.direct 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.

D1 · Cyclomatic Complexity · DotNet.install (cyclomatic 22) · ×1

DotNet.install (cyclomatic 22) build/DotNet.fs:959 — DotNet.install 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.

D1 · Cyclomatic Complexity · Execution.executeQueryOrMutation (cyclomatic 21) · ×1

Execution.executeQueryOrMutation (cyclomatic 21) src/FSharp.Data.GraphQL.Server/Execution.fs:936 — Execution.executeQueryOrMutation has cyclomatic complexity 21 (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 · TypeMap.AddType (cyclomatic 19) · ×1

TypeMap.AddType (cyclomatic 19) src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:2132 — TypeMap.AddType 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 · InputValue.OfObject (cyclomatic 19) · ×1

InputValue.OfObject (cyclomatic 19) src/FSharp.Data.GraphQL.Shared/Ast.fs:118 — InputValue.OfObject 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 · ExecutionInfo.ToString (cyclomatic 16) · ×1

ExecutionInfo.ToString (cyclomatic 16) src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:746 — ExecutionInfo.ToString 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 · ReflectionHelper.isAssignableWithUnwrap (cyclomatic 16) · ×1

ReflectionHelper.isAssignableWithUnwrap (cyclomatic 16) src/FSharp.Data.GraphQL.Server/ReflectionHelper.fs:164 — ReflectionHelper.isAssignableWithUnwrap 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 · JsonValue.WriteTo (cyclomatic 16) · ×1

JsonValue.WriteTo (cyclomatic 16) src/FSharp.Data.GraphQL.Client/JsonValue.fs:52 — JsonValue.WriteTo has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D11 · Test Reliability · Test reliability not measured · ×1

Test reliability not measured — test suite did not build — Test reliability NOT MEASURED: this repository did not build in our analyzer environment (a C#/MSBuild compiler error), so no test ever ran and flakiness could not be exercised. It is excluded from the score rather than counted as a defect. We did not read WHERE the failing diagnostic is, so this does not claim the fault is in your test code — a repository written for an older SDK band can compile for you and not for us. Run `dotnet build` on this commit: if it succeeds, the gap is ours and nothing here is a defect in your code.

D2 · Cognitive Complexity · Values.compileByType (cognitive 145) · ×1

Values.compileByType (cognitive 145) src/FSharp.Data.GraphQL.Server/Values.fs:96 — Values.compileByType has cognitive complexity 145 (threshold 15). Drivers by points: if/else 26 (73 pts), match/switch 21 (61 pts), boolean chains 11 (nesting depth added 87). 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 · Values.coerceVariableValue (cognitive 74) · ×1

Values.coerceVariableValue (cognitive 74) src/FSharp.Data.GraphQL.Server/Values.fs:432 — Values.coerceVariableValue has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (52 pts), match/switch 8 (18 pts), boolean chains 4 (nesting depth added 38). 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 · ObjectListFilterModule.buildFilterExpr (cognitive 70) · ×1

ObjectListFilterModule.buildFilterExpr (cognitive 70) src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:296 — ObjectListFilterModule.buildFilterExpr has cognitive complexity 70 (threshold 15). Drivers by points: match/switch 16 (35 pts), if/else 21 (34 pts), boolean chains 1 (nesting depth added 32). 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 · Provider.makeProvidedType (cognitive 58) · ×1

Provider.makeProvidedType (cognitive 58) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:708 — Provider.makeProvidedType has cognitive complexity 58 (threshold 15). Drivers by points: match/switch 36 (57 pts), if/else 1 (nesting depth added 21). 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 · JsonValueHelper.getFieldValue (cognitive 54) · ×1

JsonValueHelper.getFieldValue (cognitive 54) src/FSharp.Data.GraphQL.Client/BaseTypes.fs:318 — JsonValueHelper.getFieldValue has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 21 (54 pts) (nesting depth added 33). 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 · ProvidedOperation.makeProvidedType (cognitive 50) · ×1

ProvidedOperation.makeProvidedType (cognitive 50) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:285 — ProvidedOperation.makeProvidedType has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 18 (27 pts), if/else 20 (22 pts), boolean chains 1 (nesting depth added 11). 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 · Observable.ofAsyncEnumerableResolved (cognitive 48) · ×1

Observable.ofAsyncEnumerableResolved (cognitive 48) src/FSharp.Data.GraphQL.Server/ObservableExtensions.fs:146 — Observable.ofAsyncEnumerableResolved has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 7 (15 pts), error handling 4 (8 pts), boolean chains 4, loops 2 (nesting depth added 21). 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 · SchemaDefinitions.coerceObjectListFilterInput (cognitive 48) · ×1

SchemaDefinitions.coerceObjectListFilterInput (cognitive 48) src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs:23 — SchemaDefinitions.coerceObjectListFilterInput has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 17 (25 pts), boolean chains 23 (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 · TypeCoercion.coerceFilter (cognitive 46) · ×1

TypeCoercion.coerceFilter (cognitive 46) src/FSharp.Data.GraphQL.Server.Middleware/TypeCoercion.fs:164 — TypeCoercion.coerceFilter has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 17 (46 pts) (nesting depth added 29). 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 · DotNet.install (cognitive 37) · ×1

DotNet.install (cognitive 37) build/DotNet.fs:959 — DotNet.install has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), error handling 3 (8 pts), match/switch 3, boolean chains 2 (nesting depth added 14). 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 · Ast.checkInputValue (cognitive 36) · ×1

Ast.checkInputValue (cognitive 36) src/FSharp.Data.GraphQL.Shared/Validation.fs:967 — Ast.checkInputValue has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 12 (25 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 17). 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 · Extensions.Document.ToQueryString (cognitive 33) · ×1

Extensions.Document.ToQueryString (cognitive 33) src/FSharp.Data.GraphQL.Shared/AstExtensions.fs:105 — Extensions.Document.ToQueryString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 12 (13 pts), boolean chains 1 (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 · MSBuild.fromCliArguments (cognitive 32) · ×1

MSBuild.fromCliArguments (cognitive 32) build/MSBuild.fs:733 — MSBuild.fromCliArguments has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 20 (21 pts), if/else 11 (nesting depth added 1). 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 · Execution.streamed (cognitive 29) · ×1

Execution.streamed (cognitive 29) src/FSharp.Data.GraphQL.Server/Execution.fs:540 — Execution.streamed has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (16 pts), if/else 5 (8 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). 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 · Provider.getOperationMetadata (cognitive 29) · ×1

Provider.getOperationMetadata (cognitive 29) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:489 — Provider.getOperationMetadata has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 4 (5 pts), boolean chains 3 (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.

D2 · Cognitive Complexity · Execution.direct (cognitive 28) · ×1

Execution.direct (cognitive 28) src/FSharp.Data.GraphQL.Server/Execution.fs:409 — Execution.direct has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 11 (22 pts), error handling 1 (3 pts), if/else 2 (3 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.

D2 · Cognitive Complexity · Ast.checkVariableUsageAllowedOnArguments (cognitive 27) · ×1

Ast.checkVariableUsageAllowedOnArguments (cognitive 27) src/FSharp.Data.GraphQL.Shared/Validation.fs:1503 — Ast.checkVariableUsageAllowedOnArguments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Provider.getSchemaProvidedTypes (cognitive 26) · ×1

Provider.getSchemaProvidedTypes (cognitive 26) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:585 — Provider.getSchemaProvidedTypes has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 9 (13 pts), boolean chains 8, if/else 4 (5 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 · Values.normalizeOptional (cognitive 25) · ×1

Values.normalizeOptional (cognitive 25) src/FSharp.Data.GraphQL.Server/Values.fs:32 — Values.normalizeOptional has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 10). 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 · List.combinations (cognitive 21) · ×1

List.combinations (cognitive 21) src/FSharp.Data.GraphQL.Client/Extensions.fs:38 — List.combinations has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 2 (nesting depth added 11). 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.

D2 · Cognitive Complexity · NuGet.createNuSpecFromTemplate (cognitive 20) · ×1

NuGet.createNuSpecFromTemplate (cognitive 20) build/NuGet.fs:285 — NuGet.createNuSpecFromTemplate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 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.

D2 · Cognitive Complexity · Linq.merge (cognitive 20) · ×1

Linq.merge (cognitive 20) src/FSharp.Data.GraphQL.Server/Linq.fs:354 — Linq.merge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (10 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 · JsonValue.WriteTo (cognitive 20) · ×1

JsonValue.WriteTo (cognitive 20) src/FSharp.Data.GraphQL.Client/JsonValue.fs:52 — JsonValue.WriteTo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), match/switch 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 · ProvidedRecord.makeProvidedType (cognitive 20) · ×1

ProvidedRecord.makeProvidedType (cognitive 20) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:146 — ProvidedRecord.makeProvidedType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (6 pts) (nesting depth added 6). 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 · GraphQLRequestHandler`1.CheckOperationType (cognitive 18) · ×1

GraphQLRequestHandler`1.CheckOperationType (cognitive 18) src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs:183 — GraphQLRequestHandler`1.CheckOperationType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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 · Execution.executeQueryOrMutation (cognitive 18) · ×1

Execution.executeQueryOrMutation (cognitive 18) src/FSharp.Data.GraphQL.Server/Execution.fs:936 — Execution.executeQueryOrMutation has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 11 (16 pts), if/else 2 (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 · Ast.areTypesCompatible (cognitive 17) · ×1

Ast.areTypesCompatible (cognitive 17) src/FSharp.Data.GraphQL.Shared/Validation.fs:1471 — Ast.areTypesCompatible has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). 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 · AsyncVal.collectSequential (cognitive 17) · ×1

AsyncVal.collectSequential (cognitive 17) src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:133 — AsyncVal.collectSequential has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3, 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 · AsyncVal.collectParallel (cognitive 17) · ×1

AsyncVal.collectParallel (cognitive 17) src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:168 — AsyncVal.collectParallel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 2 (6 pts), match/switch 2 (5 pts) (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 · Planning.planSelection (cognitive 17) · ×1

Planning.planSelection (cognitive 17) src/FSharp.Data.GraphQL.Server/Planning.fs:397 — Planning.planSelection has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (6 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 · WebSocketMessageSender.RunAsync (cognitive 16) · ×1

WebSocketMessageSender.RunAsync (cognitive 16) src/FSharp.Data.GraphQL.Server.AspNetCore/WebSocketTransport.fs:145 — WebSocketMessageSender.RunAsync has cognitive complexity 16 (threshold 15). Drivers by points: error handling 1 (5 pts), loops 2 (4 pts), match/switch 1 (4 pts), if/else 2 (3 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 · Types.validateType (cognitive 16) · ×1

Types.validateType (cognitive 16) src/FSharp.Data.GraphQL.Shared/Validation.fs:96 — Types.validateType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), 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 · ReflectionHelper.isAssignableWithUnwrap (cognitive 16) · ×1

ReflectionHelper.isAssignableWithUnwrap (cognitive 16) src/FSharp.Data.GraphQL.Server/ReflectionHelper.fs:164 — ReflectionHelper.isAssignableWithUnwrap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. 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.

D2 · Cognitive Complexity · ObjectListFilterModule.comparerToStringComparison (cognitive 16) · ×1

ObjectListFilterModule.comparerToStringComparison (cognitive 16) src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:199 — ObjectListFilterModule.comparerToStringComparison has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 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.

D3 · God Classes · TooManyMethods · ×1

TooManyMethods: Define src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:713 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D4 · Code Duplication · Duplicated block (26–33 lines × 2) · ×1

Duplicated block (26–33 lines × 2) src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:63 — src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:63-88 | src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:98-130 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (30 lines × 2) · ×1

Duplicated block (30 lines × 2) src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:374 — src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:374-403 | src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:420-449 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:374` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1

Duplicated block (26 lines × 2) src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:35 — src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:35-60 | src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:84-109 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:35` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (13–16 lines × 2) · ×1

Duplicated block (13–16 lines × 2) samples/star-wars-api/AuthorizationMiddleware.fs:20 — samples/star-wars-api/AuthorizationMiddleware.fs:20-35 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:42-54 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (7–14 lines × 3) · ×1

Duplicated block (7–14 lines × 3) src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1251 — src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1251-1257 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1403-1409 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1555-1568 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1

Duplicated block (14 lines × 2) src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:132 — src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:132-145 | src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:155-168 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (8–11 lines × 2) · ×1

Duplicated block (8–11 lines × 2) src/FSharp.Data.GraphQL.Server/Values.fs:240 — src/FSharp.Data.GraphQL.Server/Values.fs:240-250 | src/FSharp.Data.GraphQL.Server/Values.fs:285-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.

D4 · Code Duplication · Duplicated block (9–10 lines × 7) · ×1

Duplicated block (9–10 lines × 7) src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1172 — src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1172-1180 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1300-1309 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1374-1382 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1460-1468 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1784-1792 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1883-1891 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:2010-2018 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1

Duplicated block (21 lines × 2) samples/chat-app/server/Program.fs:25 — samples/chat-app/server/Program.fs:25-45 | samples/relay-book-store/Program.fs:31-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D44 · Platform End-of-Life · End-of-life runtime · ×1

End-of-life runtime: .NET net6.0 samples/FSharp.Data.GraphQL.ProjectTemplates.fsproj:11 — samples/FSharp.Data.GraphQL.ProjectTemplates.fsproj declares .NET net6.0 as this project's target framework, and .NET 6 LTS, support ended 2024-11-12. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-11-12 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.

SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1

NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.

Minor — 17 finding(s)

D34 · Knowledge Freshness · Orphaned file · ×4

Orphaned file src/FSharp.Data.GraphQL.Client/JsonValue.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/FSharp.Data.GraphQL.Shared/Serialization/JsonConverters.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/FSharp.Data.GraphQL.Shared/Helpers/MemoryCache.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/FSharp.Data.GraphQL.Client/Locations.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.

D16 · Bus Factor · Off-boarding risk · ×1

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 19 significant file(s) lose their only recent owner: src/FSharp.Data.GraphQL.Server/Linq.fs, src/FSharp.Data.GraphQL.Server.AspNetCore/IncrementalDelivery.fs, src/FSharp.Data.GraphQL.Server/Schema.fs, src/FSharp.Data.GraphQL.Server/ObservableExtensions.fs, src/FSharp.Data.GraphQL.Server.Relay/Connections.fs, src/FSharp.Data.GraphQL.Server.AspNetCore/GraphQLRequestHandler.fs, src/FSharp.Data.GraphQL.Shared/Parser.fs, src/FSharp.Data.GraphQL.Server/IO.fs (+11 more). Pair on, review, or document these before any departure.

D16 · Bus Factor · Further sole-owners (lower concentration) · ×1

Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (21 single-owned of 55 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 55 of the 86 production source files in this repository met that bar). They are anonymized user #1 (2 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/FSharp.Data.GraphQL.Server/Execution.fs, src/FSharp.Data.GraphQL.Server/Planning.fs.

D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1

Projects may be oversized for their cohesion — 1 of 10 project(s) overshoot their size bounds, lowering Project Cohesion to 8.1/10. The most over is `src/FSharp.Data.GraphQL.Shared` (9186 LoC, 222 module-visible types across 3 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.

D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1

Further orphaned files (smaller) — 4 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: src/FSharp.Data.GraphQL.Client/JsonValue.fs, src/FSharp.Data.GraphQL.Shared/Serialization/JsonConverters.fs, src/FSharp.Data.GraphQL.Shared/Helpers/MemoryCache.fs, src/FSharp.Data.GraphQL.Client/Locations.fs (5 orphaned of 55 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 55 of the 86 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

M2 · Architecture documentation · No ADRs · ×1

No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

P3 · Security & performance tooling · No SAST · ×1

No SAST — 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 18244 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.

P4 · Deployment & Rollback · No release approval gate · ×1

No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

PF1 · Benchmark discipline · Benchmarks don't track allocations · ×1

Benchmarks don't track allocations tests/FSharp.Data.GraphQL.Benchmarks/ParsingBenchmark.fs — A F#/VB BenchmarkDotNet suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured.

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.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-3b7d7703562b4ec89c6baa97a5424bae/history.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-3b7d7703562b4ec89c6baa97a5424bae/tree.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)	semgrep	—	semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .	33	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	nuget	—	nuget: not applicable — nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan	0	—
D30 · Dependency Vulnerabilities	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json
D31 · IaC & Container Security	trivy	—	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 Policy	disclosure	—	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 Confinement	runtime-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 Confinement	runtime-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 Enforcement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.	0	—
D43 · Malicious Dependencies	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json

Run 01a16a91-a117-72b5-8fc8-013670a67c50 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Findings by how serious they are

This survey was produced by

Executive summary

Top priorities

Diagnosis: what the measurements show together

Architecture — bounded-context dependency graph

Architecture: which parts of the code depend on which

At a glance — Code Health · 74% · Strong ·

At a glance — Architecture · 79% · Strong ·

At a glance — Maturity · 60% · Adequate · gated by M2 ·

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

At a glance — Security · 58% · Adequate · gated by D29, D36 ·

At a glance — Performance · 94% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

The LLM boundary

Dimensions

Frontend & cross-cutting dimensions

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts