Public report of fsprojects/Paket, published 14 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 14 November 2026, 13:02 UTC · Survey ID cd_cf44099280794b7aa95321316dcb7c7e
fsprojects/Paket
Measured 14 November 2026, 13:02 UTC, at code version 06a32b6
Test reliability is not measured: The repo's test suite did not build.
Boundary Type-Coupling is not measured: Bounded contexts not declared.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 5 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 30,580 lines of product code in 55 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Security and Compliance, 38
Findings by how serious they are
27 critical333 serious95 minor
11 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 13:02 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
45of 45 dimensions measured by tools.
441of 455 findings point to an exact file and line, so you can open each one in the code. The other 14 concern the repository as a whole, such as missing documentation.
45dimensions across 7 lenses, read from 30,580 lines of product code in 55 projects.
fsprojects/Paket falls short of our standard for production, held back most by its Security and Compliance lens, the code's security and compliance. It scores 53 out of 100 and is rated Adequate, and all 27 of its critical findings are security problems.
Security and Compliance, at 38, is the weakest lens and counts most in the score. The best first step for the work it takes is fixing the three weaknesses in the build pipeline's configuration, worth about 4 points. Fixing the 18 runtimes or frameworks that no longer get security updates would lift Security and Compliance itself, worth about 7 points. Raising Security and Compliance to 70 would lift the score to about 64.
Twenty pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One known security hole in a package the code depends on can be used by attackers, and one password or key is open to anyone who can read the repository. Pinning each tool to an exact version, updating the vulnerable packages and replacing the exposed password or key would close these risks. Correcting the flagged pipeline settings would fix the three weaknesses in the build pipeline's configuration, and the check for vulnerable packages switched off needs switching back on.
The product code is 30,580 lines, about €62,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe 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.
If Security and Compliance rose from 38 to 70, the lowest score rated Strong, the score would rise from 53 to about 64.
Code composition: what the lines of code are
Supporting code 7%Tests 93%
New since the last survey: 291 findings
These 291 critical or serious findings weren't in the previous survey, on 26 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 18 findings
These 18 critical or serious findings were in the previous survey, on 26 October 2026, and are gone from this one.
God Classes · TooManyMethods: ProjectFile src/Paket.Core/PaketConfigFiles/ProjectFile.fs
God Classes · TooManyFunctions: Constants src/Paket.Core/Common/Constants.fs
God Classes · TooManyMethods: InstallModel src/Paket.Core/PaketConfigFiles/InstallModel.fs
God Classes · FileTooLong: PackageManagement/NugetConvert.fs src/Paket.Core/PackageManagement/NugetConvert.fs
€20,000 to €100,000, for 341 to 1,080 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.7 at a score of 53. 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: 30,580 lines of product code
Comment lines
The estimate prices 29,429 lines. Comment lines count towards the size of 30,580 lines but aren't priced as work.
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3).
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Paket.LegacyStub.csproj.
Raises the score by about 3 points · Low effort · ADR Quality
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 €62,000 to build again, about 0.4 person-years of work. Its weakest lens is Security and Compliance, at 38 (Weak). 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 3 REDACTED finding(s) in Static Analysis (SAST). Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 3 Static Analysis (SAST) findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.4 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 16,210 lines over the last 90 days, which is about 65,741 lines a year. At that pace, the extra work comes to an estimated 6.7 to 39.9 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
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.
153 modules, with 216 dependencies between them. One loop runs through 10 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 113 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.
LoadingScripts.ScriptGeneration uses Domain, so a change to Domain can break LoadingScripts.ScriptGeneration, while a change to LoadingScripts.ScriptGeneration can't break Domain.
Position
Below the diagonal: LoadingScripts.ScriptGeneration uses a module listed above it, which is the healthy direction.
4→17 LoadingScripts.ScriptGeneration uses Paketpart of a loop✕
Connections
6 pairs of types, where a type in LoadingScripts.ScriptGeneration uses a type in Paket.
LoadingScripts.ScriptGeneration uses Paket, so a change to Paket can break LoadingScripts.ScriptGeneration, while a change to LoadingScripts.ScriptGeneration can't break Paket.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
RemoteDownload uses ModuleResolver, so a change to ModuleResolver can break RemoteDownload, while a change to RemoteDownload can't break ModuleResolver.
Position
Below the diagonal: RemoteDownload uses a module listed above it, which is the healthy direction.
ProjectFileModule uses PackageSources, so a change to PackageSources can break ProjectFileModule, while a change to ProjectFileModule can't break PackageSources.
Position
Below the diagonal: ProjectFileModule uses a module listed above it, which is the healthy direction.
Requirements uses PlatformMatching, so a change to PlatformMatching can break Requirements, while a change to Requirements can't break PlatformMatching.
Position
Below the diagonal: Requirements uses a module listed above it, which is the healthy direction.
PackageResolver uses ModuleResolver, so a change to ModuleResolver can break PackageResolver, while a change to PackageResolver can't break ModuleResolver.
Position
Below the diagonal: PackageResolver uses a module listed above it, which is the healthy direction.
PackageResolver uses PackageSources, so a change to PackageSources can break PackageResolver, while a change to PackageResolver can't break PackageSources.
Position
Below the diagonal: PackageResolver uses a module listed above it, which is the healthy direction.
PackageResolver.ResolutionModule uses Domain, so a change to Domain can break PackageResolver.ResolutionModule, while a change to PackageResolver.ResolutionModule can't break Domain.
Position
Below the diagonal: PackageResolver.ResolutionModule uses a module listed above it, which is the healthy direction.
PackageResolver.ResolutionModule uses Requirements, so a change to Requirements can break PackageResolver.ResolutionModule, while a change to PackageResolver.ResolutionModule can't break Requirements.
Position
Below the diagonal: PackageResolver.ResolutionModule uses a module listed above it, which is the healthy direction.
PackageResolver.ResolutionModule uses PackageResolver, so a change to PackageResolver can break PackageResolver.ResolutionModule, while a change to PackageResolver.ResolutionModule can't break PackageResolver.
Position
Below the diagonal: PackageResolver.ResolutionModule uses a module listed above it, which is the healthy direction.
Paket uses InterprojectReferencesConstraint, so a change to InterprojectReferencesConstraint can break Paket, while a change to Paket can't break InterprojectReferencesConstraint.
Position
Below the diagonal: Paket uses a module listed above it, which is the healthy direction.
Paket uses LoadingScripts.ScriptGeneration, so a change to LoadingScripts.ScriptGeneration can break Paket, while a change to Paket can't break LoadingScripts.ScriptGeneration.
Position
Below the diagonal: Paket uses a module listed above it, which is the healthy direction.
DependenciesFileParser uses PackageSources, so a change to PackageSources can break DependenciesFileParser, while a change to DependenciesFileParser can't break PackageSources.
Position
Below the diagonal: DependenciesFileParser uses a module listed above it, which is the healthy direction.
DependenciesFileParser uses Requirements, so a change to Requirements can break DependenciesFileParser, while a change to DependenciesFileParser can't break Requirements.
Position
Below the diagonal: DependenciesFileParser uses a module listed above it, which is the healthy direction.
InstallModelModule uses PlatformMatching, so a change to PlatformMatching can break InstallModelModule, while a change to InstallModelModule can't break PlatformMatching.
Position
Below the diagonal: InstallModelModule uses a module listed above it, which is the healthy direction.
InstallModelModule uses Requirements, so a change to Requirements can break InstallModelModule, while a change to InstallModelModule can't break Requirements.
Position
Below the diagonal: InstallModelModule uses a module listed above it, which is the healthy direction.
InstallModelModule uses NuGetCache, so a change to NuGetCache can break InstallModelModule, while a change to InstallModelModule can't break NuGetCache.
Position
Below the diagonal: InstallModelModule uses a module listed above it, which is the healthy direction.
LocalFileModule uses PackageSources, so a change to PackageSources can break LocalFileModule, while a change to LocalFileModule can't break PackageSources.
Position
Below the diagonal: LocalFileModule uses a module listed above it, which is the healthy direction.
LocalFileModule uses PackageResolver, so a change to PackageResolver can break LocalFileModule, while a change to LocalFileModule can't break PackageResolver.
Position
Below the diagonal: LocalFileModule uses a module listed above it, which is the healthy direction.
LockFileParser uses ModuleResolver, so a change to ModuleResolver can break LockFileParser, while a change to LockFileParser can't break ModuleResolver.
Position
Below the diagonal: LockFileParser uses a module listed above it, which is the healthy direction.
LockFileParser uses PackageResolver, so a change to PackageResolver can break LockFileParser, while a change to LockFileParser can't break PackageResolver.
Position
Below the diagonal: LockFileParser uses a module listed above it, which is the healthy direction.
LockFileSerializer uses ModuleResolver, so a change to ModuleResolver can break LockFileSerializer, while a change to LockFileSerializer can't break ModuleResolver.
Position
Below the diagonal: LockFileSerializer uses a module listed above it, which is the healthy direction.
LockFileSerializer uses PackageResolver, so a change to PackageResolver can break LockFileSerializer, while a change to LockFileSerializer can't break PackageResolver.
Position
Below the diagonal: LockFileSerializer uses a module listed above it, which is the healthy direction.
PackageMetaData uses InterprojectReferencesConstraint, so a change to InterprojectReferencesConstraint can break PackageMetaData, while a change to PackageMetaData can't break InterprojectReferencesConstraint.
Position
Below the diagonal: PackageMetaData uses a module listed above it, which is the healthy direction.
PackageResolver.DependencySetFilter uses Domain, so a change to Domain can break PackageResolver.DependencySetFilter, while a change to PackageResolver.DependencySetFilter can't break Domain.
Position
Below the diagonal: PackageResolver.DependencySetFilter uses a module listed above it, which is the healthy direction.
PackageResolver.DependencySetFilter uses Requirements, so a change to Requirements can break PackageResolver.DependencySetFilter, while a change to PackageResolver.DependencySetFilter can't break Requirements.
Position
Below the diagonal: PackageResolver.DependencySetFilter uses a module listed above it, which is the healthy direction.
PackageResolver.DependencySetFilter uses PackageResolver, so a change to PackageResolver can break PackageResolver.DependencySetFilter, while a change to PackageResolver.DependencySetFilter can't break PackageResolver.
Position
Below the diagonal: PackageResolver.DependencySetFilter uses a module listed above it, which is the healthy direction.
PackageResolver.DependencySetFilter uses Paket, so a change to Paket can break PackageResolver.DependencySetFilter, while a change to PackageResolver.DependencySetFilter can't break Paket.
Position
Below the diagonal: PackageResolver.DependencySetFilter uses a module listed above it, which is the healthy direction.
PaketEnvModule uses PackageSources, so a change to PackageSources can break PaketEnvModule, while a change to PaketEnvModule can't break PackageSources.
Position
Below the diagonal: PaketEnvModule uses a module listed above it, which is the healthy direction.
RestoreProcess uses PackageSources, so a change to PackageSources can break RestoreProcess, while a change to RestoreProcess can't break PackageSources.
Position
Below the diagonal: RestoreProcess uses a module listed above it, which is the healthy direction.
RestoreProcess uses PackageResolver, so a change to PackageResolver can break RestoreProcess, while a change to RestoreProcess can't break PackageResolver.
Position
Below the diagonal: RestoreProcess uses a module listed above it, which is the healthy direction.
RuntimeGraphModule uses PackageResolver, so a change to PackageResolver can break RuntimeGraphModule, while a change to RuntimeGraphModule can't break PackageResolver.
Position
Below the diagonal: RuntimeGraphModule uses a module listed above it, which is the healthy direction.
TemplateFileModule uses InterprojectReferencesConstraint, so a change to InterprojectReferencesConstraint can break TemplateFileModule, while a change to TemplateFileModule can't break InterprojectReferencesConstraint.
Position
Below the diagonal: TemplateFileModule uses a module listed above it, which is the healthy direction.
UpdateProcess uses PackageResolver, so a change to PackageResolver can break UpdateProcess, while a change to UpdateProcess can't break PackageResolver.
Position
Below the diagonal: UpdateProcess uses a module listed above it, which is the healthy direction.
Why.DependencyChainModule uses Domain, so a change to Domain can break Why.DependencyChainModule, while a change to Why.DependencyChainModule can't break Domain.
Position
Below the diagonal: Why.DependencyChainModule uses a module listed above it, which is the healthy direction.
Why.DependencyChainModule uses PackageResolver, so a change to PackageResolver can break Why.DependencyChainModule, while a change to Why.DependencyChainModule can't break PackageResolver.
Position
Below the diagonal: Why.DependencyChainModule uses a module listed above it, which is the healthy direction.
Why.DependencyChainModule uses Why, so a change to Why can break Why.DependencyChainModule, while a change to Why.DependencyChainModule can't break Why.
Position
Below the diagonal: Why.DependencyChainModule uses a module listed above it, which is the healthy direction.
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
24
High / Critical
A03:2025 — Software Supply Chain Failures
8
High / Critical
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
Top priorities: Resolve the 18 End-of-life runtime finding(s) in Platform End-of-Life — start with test.fsproj (3), proj.fsproj (3), console.fsproj (2); Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3); Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Paket.LegacyStub.csproj.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3).
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 — 27
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 — 333
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 — 95
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 11
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 45 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 45 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 441 of 455 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 or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 1 test(s) behind this row are the ones the C# collector could read, and this repository also carries at least 162 test source file(s) (.fs) that it cannot: it parses C# syntax and matches C# test attributes, so a vitest/jest/JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: /usr/share/dotnet/sdk/10.0.400/NuGet.targets(521,5): error MSB3202: The project file "integrationtests/scenarios/i001429-pack-deps-minimum-from-lock/before/PaketBug/PaketBug.csproj" was not found. [/tmp/codehealth-iso-1504ca0c1a394f6bbb9d1259e4b76….
D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs, src/Paket/Program.fs, src/Paket.Core/PublicAPI.fs, src/Paket.Core/Versioning/FrameworkHandling.fs, src/Paket.Core/Dependencies/NuGet.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.
D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Cannot open project 'tests/Paket.Tests/Paket.Tests.fsproj' because the file extension '.fsproj' is not associated with a language.
D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 0 deducted marker(s) and the 0.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (27,511 lines, 90% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — evaluation did not complete — Naming Consistency not included (check did not complete) — excluded from the score.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D23 Boundary Type-Coupling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Large codebase (30,580 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D30 Dependency Vulnerabilities — measured, with a gap in what it reached — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan. 1 of 2 declared ecosystem(s) (nuget REDACTED) 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.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: a native UI project (integrationtests/scenarios/i004278-net90-windows-fails/before/PaketTest/App.xaml). The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
DM10 One transaction, one aggregate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. One transaction, one aggregate could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: InvalidOperationException: The entity or value 'System.Int32' does not exist or is in an unresolved assembly. You may need to add a reference to assembly 'netstandard'.
DM8 Value-object opportunities — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds primitive parameters that travel together through several signatures of the domain (a missing value object). Its deterministic rule has not yet shown 95 % precision on adjudicated rows, so the clumps it finds are counted here and not published as findings, and the card carries no score. That is a limit of the analyzer, not a finding about your code.
DM9 Scattered domain decisions — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Both arms resolve expressions to symbols (a comparison operand to the member it judges, a construction to the type it constructs) and that resolution comes from a Roslyn compilation, which this run has for the C#/VB projects only. The other languages in this repository were not walked for this dimension, so the counts above speak for part of the codebase.
ED5 Idempotency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads a handler's ENTRY METHODS to decide whether its mutation is safe to re-run. On these types it walked none of them, yet the same write oracle finds a persistent write in the type — so the mutation is there and the limit is in our entry-point recognition, not in the repository. Known shapes: a handler contract method implemented as an EXPLICIT INTERFACE IMPLEMENTATION, and a STATIC handler method (the Wolverine default).
IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X28 Index access outside its own emptiness guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
Package restore incomplete — third-party types were unresolved in part of the solution — NuGet restore did not complete for integrationtests/scenarios/i002394-group-conditions/before/TestProjects/MainGroup.fsproj, integrationtests/scenarios/i002394-group-conditions/before/TestProjects/NonConditionalGroup.fsproj, integrationtests/scenarios/i002394-group-conditions/before/TestProjects/FixedProperty.fsproj, integrationtests/scenarios/i002394-group-conditions/before/TestProjects/MixedProperties.fsproj, integrationtests/scenarios/i002394-group-conditions/before/TestProjects/ConfigurationDependent.fsproj, so those projects were analysed with framework references only: every check keyed on a third-party type saw an error type there and reported nothing. Findings on those projects are a lower bound; run `dotnet restore` on them and rescan.
Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D8 Code Coverage: Coverage is measured by building and running the test suite inside our 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.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
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.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
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.
73 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was FrameworkDetection.internalExtract at 112. A further 15 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 PlatformMatching.getTargetCondition at 52 — they are counted neither in the figure above nor in this dimension's score. 2 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/Paket/Commands.fs (Command.Argu.IArgParserTemplate.get_Usage at 34), src/Paket.Core/Common/Domain.fs (DomainMessage.ToString at 22). 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.
+ 68 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 6 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with FrameworkDetection.internalExtract (cyclomatic 112), PackageMetaData.findDependencies (cyclomatic 90), PackageResolver.Resolve (cyclomatic 87). — 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 6 together lifts Cyclomatic Complexity from 4.1 to about 5.3/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 95 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 18 bodies over 60 down to 60 or less in Cognitive Complexity — start with PackageResolver.Resolve (cognitive 233), PackageMetaData.findDependencies (cognitive 190), ProjectFile.SearchAllProjectRelatedFiles (cognitive 149). — 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 18 together lifts Cognitive Complexity from 2.0 to about 4.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.1 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 18 FileTooLong finding(s) in God Classes — start with FrameworkHandling.fs, ProjectFile.fs, PackageResolver.fs. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 2 TooManyMethods finding(s) in God Classes — start with PublicAPI.fs, DependenciesFile.fs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 TooManyFunctions finding(s) in God Classes — start with NetUtils.fs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
+ 7 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with Async.fs, NuGetCache.fs, ProjectFile.fs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with NuGetV2.fs, InstallModel.fs, PublicAPI.fs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 4 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with AddProcess.fs, DependenciesFileParser.fs, TemplateFile.fs. — One of this dimension's main actionable groups (4 warning-level).
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.
Off the main sequence: MyProj.Common(netstandard2.0) (integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Common) · ×2integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Common/MyProj.Common.csproj:1
✓ On the Gold path — maintain.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
No test project references fs2528 · ×6integrationtests/scenarios/i002528-2/before/fs2528.csproj
No test project references projectA · ×6integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectA/projectA.csproj
No test project references A · ×3integrationtests/scenarios/i002520-interproject-references-constraint/before/A/A.csproj
No test project references B · ×3integrationtests/scenarios/i002520-interproject-references-constraint/before/B/B.csproj
No test project references console · ×3integrationtests/scenarios/i002694/before/console/console.csproj
+ 32 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 No test project references fs2528 finding(s) in Code Coverage — start with fs2528.fsproj (4), fs2528.csproj (2). — One of this dimension's main actionable groups (6 warning-level).
Resolve the 6 No test project references projectA finding(s) in Code Coverage — start with projectA.csproj (5), projectA.fsproj. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 3 No test project references A finding(s) in Code Coverage — start with A.csproj (3). — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1 tests. Measured on the C# suite only — at least 162 test source file(s) (.fs) went unread, so its test quality is unmeasured and is not in these counts.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 0 packages use a banned license. The depth of this set was not established for this repository: the graded packages are what this pass resolved, and no lockfile was read, so it is not certified to be the full transitive closure.
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.
Resolve the 24 Hotspot finding(s) in Churn × Complexity Hotspots — start with FrameworkHandling.fs, GitHandling.fs, ProjectFile.fs. — One of this dimension's main actionable groups (24 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with ConfigFile.fs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor6.1 / 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.
22 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/Paket.Core/Dependencies/NuGet.fs. Counted over 56 of the 279 production source files in this repository: 214 are under the ~2,400-byte size floor this dimension measures over, and the remaining 9 have no attributable history left to measure.
Off-boarding risk: anonymized user #1
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).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
0 deducted debt markers + unmeasured dead symbols across 788 LoC in the .NET projects (0.0/KLoC) → score 10.0. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .fs (90% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
2 of 2 documentation facets pass in full. 57 document(s) read across 45 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
No ADRs foundsrc/Paket.LegacyStub/Paket.LegacyStub.csproj:10
What to do
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Paket.LegacyStub.csproj. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
Resolve the 60 redundant comment finding(s) in Comment Value — start with AssemblyInfo.cs (60). — One of this dimension's main actionable groups (60 recommendation-level).
Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. 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.
92 % of calls cross a namespace and 5 % 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.
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.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
25 finding(s): 0 critical, 25 high, 0 medium, 0 low. 20 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. semgrep hit a parse error in 1 file(s) — `completion/paket-completion.bash` (line 54, line 60) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 3 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 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 20 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 (20 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Partial dependency scan: 1 of 2 declared ecosystem(s) were scanned (nuget REDACTED), 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.
REDACTED
What to do
Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
18 of 65 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/Paket.Core/Installation/DependencyChangeDetection.fs. Counted over 65 of the 279 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 18 Orphaned file finding(s) in Knowledge Freshness — start with DependencyChangeDetection.fs, ReferencesFile.fs, RuntimeGraph.fs. — One of this dimension's main actionable groups (18 recommendation-level).
Resolve the 1 Orphaned files with no living knowledge 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.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether 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.
+ 2 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. — 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.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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.
5 end-of-life runtime(s) and 0 end-of-life framework(s), read from 69 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Resolve the 18 End-of-life runtime finding(s) in Platform End-of-Life — start with test.fsproj (3), proj.fsproj (3), console.fsproj (2). — One of this dimension's main actionable groups (18 warning-level).
Detailed fixes: d44_recommendation.md · top locations in Appendix A, every location in findings.md.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Do you agree with this assessment?
DM12 · Ambient inputs in the domain10.0 / 10Exemplary○ Nothing flagged
Other · Domain Modelling — Whether domain types receive the time and randomness their rules depend on, rather than reading the process clock or a global random source directly — an ambient read makes the rule it feeds untestable at the instant that matters and lets two reads inside one operation disagree.
Method: Roslyn (DDD-gated, C#/VB only): domain-layer types scanned for ambient reads — DateTime/DateTimeOffset.Now/UtcNow/Today, Random.Shared, new Random(), Stopwatch.GetTimestamp — resolved against the semantic model, with a comment/string-stripped token fallback only where resolution fails. Body reads are scored; field/property initialisers are surfaced unscored. Apply/When folds excluded (ES1 owns them). Deterministic, symbol-resolved.
Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies (EF/Marten/HTTP/ASP.NET) — the clean-architecture dependency rule.
Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.
Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.
Other · Domain Modelling — Whether one domain rule is decided — or one measurement produced — in more than one place, rather than living on the type that owns it.
Method: Neutral body surface plus Roslyn (DDD-gated), two arms. DECISION (Roslyn only): a predicate over a domain type's members judged in two or more types, where none of those decisions live on the owning type — operands of comparisons and relational property patterns only, so a member merely passed as an argument is not judged. DERIVATION: a plain all-numeric carrier of ≥2 members, with no base type and exactly one constructor, CONSTRUCTED as the result of a method (returned or assigned, never inline as an argument) in two or more types other than its own — the same measurement produced twice, which centralising the judgement does not fix. DERIVATION runs on every language whose frontend declares the produced-or-passed fact per construction (Roslyn and the Java sidecar today); a target with only the derivation arm carries an engine gap naming the decision arm as not assessed, and a frontend that declares nothing keeps the dimension not measured rather than clean. Single-member rules, test code and generated code are out of population for both. Advisory.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
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.
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.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
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's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
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.
<NuGetAudit>false</NuGetAudit> in MSBuild suppresses NuGet's vulnerability audit project-wide. — integrationtests/scenarios/Directory.Build.props:6
No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:9
`integrationtests/Directory.Build.props` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — integrationtests/Directory.Build.props:8
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.
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.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`downloadRemoteFiles` is async and calls Async.RunSynchronously — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — src/Paket.Core/Dependencies/RemoteDownload.fs:279
What to do
F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
1/2 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 1 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Not evidenced — 1 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.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 82 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX6 Interface segregation — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
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
D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution, but this repository's production source is mostly .fs, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D21 Naming Consistency — Naming Consistency not included (check did not complete)
D22 Internal API Consistency — API consistency is measured on C# only; the exposed F# surface was not measured.
D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 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.
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
DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
DM10 One transaction, one aggregate — One transaction, one aggregate could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
DM11 Constructible invalid state — no entities detected — construction-time invariants not assessable
DM2 Strongly-typed ids — no id-bearing domain types detected — strongly-typed-id adoption not assessable
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM4 Rich vs anemic model — no data-bearing entities detected — rich-vs-anemic model not assessable
DM5 Encapsulated state — no domain entities found — DM5 grades how entities protect their state, and this repository declares none
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
DM8 Value-object opportunities — not scored — the deterministic rule found 0 candidate clump(s); its rows are withheld until it has a measured precision of 95 % (a sample of fewer than 10 rows cannot show one)
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — Not assessed, and this one is on us: 5 of the 5 handler(s) found here write to persistent state through an entry point this check does not yet recognise (an explicitly-implemented interface method, or a static handler method). Idempotency was neither confirmed nor ruled out for them — this is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
IC1 Incompleteness & stubs — IC1 reached only 10% of this repository's production lines — fsharp (27,511 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
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 repo is a library, not a deployed service — it has no process to operate, so production observability (structured logging, tracing/metrics, health checks) is N/A. A library may log via an injected ILogger, but the absence of operational telemetry is not a defect here. If it grows a host (web API, worker), the dimension reactivates.
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — coverage data present for 154 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF1 Benchmark discipline — Not applicable: no benchmark suite was found by the two searches this check runs — a BenchmarkDotNet package reference in any project file (loaded, or on disk), and a script whose name contains `benchmark` that this repository's CI runs. Neither can see a suite in another ecosystem's idiom, so this is not a verdict that the repository has none. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted, and nothing is asked of a repository that has none.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X12 Unreachable branch — X12 reached only 10% of this repository's production lines — fsharp (27,511 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — no async method does work a token could cancel
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X28 Index access outside its own emptiness guard — X28 reached only 10% of this repository's production lines — fsharp (27,511 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Hotspot: src/Paket.Core/Versioning/FrameworkHandling.fs src/Paket.Core/Versioning/FrameworkHandling.fs:1163— src/Paket.Core/Versioning/FrameworkHandling.fs changed 10 times in last 90 days, max cyclomatic complexity 112 in FrameworkDetection.internalExtract at line 1163. 3 of those changes were fix/bug commits, 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Versioning/FrameworkHandling.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/Paket.Core/Dependencies/GitHandling.fs src/Paket.Core/Dependencies/GitHandling.fs:28— src/Paket.Core/Dependencies/GitHandling.fs changed 15 times in last 90 days, max cyclomatic complexity 46 in Handling.extractUrlParts at line 28. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Dependencies/GitHandling.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/Paket.Core/PaketConfigFiles/ProjectFile.fs src/Paket.Core/PaketConfigFiles/ProjectFile.fs:293— src/Paket.Core/PaketConfigFiles/ProjectFile.fs changed 8 times in last 90 days, max cyclomatic complexity 74 in ProjectFileModule.calculatePropertyMap at line 293. 4 of those changes were fix/bug commits, and the other 4 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/PaketConfigFiles/ProjectFile.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/Paket.Core/Installation/InstallProcess.fs src/Paket.Core/Installation/InstallProcess.fs:377— src/Paket.Core/Installation/InstallProcess.fs changed 11 times in last 90 days, max cyclomatic complexity 53 in InstallProcess.InstallIntoProjects at line 377. 4 of those changes were fix/bug commits, 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Installation/InstallProcess.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/Paket.Core/Installation/RestoreProcess.fs src/Paket.Core/Installation/RestoreProcess.fs:756— src/Paket.Core/Installation/RestoreProcess.fs changed 8 times in last 90 days, max cyclomatic complexity 70 in RestoreProcess.Restore at line 756. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Installation/RestoreProcess.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/Paket.Core/PublicAPI.fs src/Paket.Core/PublicAPI.fs:786— src/Paket.Core/PublicAPI.fs changed 10 times in last 90 days, max cyclomatic complexity 47 in Dependencies.FixNuspecs at line 786. 3 of those changes were fix/bug commits, 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/PublicAPI.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/Paket.Core/Common/Utils.fs src/Paket.Core/Common/Utils.fs:449— src/Paket.Core/Common/Utils.fs changed 15 times in last 90 days, max cyclomatic complexity 24 in Utils.RunInLockedAccessMode at line 449. 3 of those changes were fix/bug commits, and the other 12 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Common/Utils.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/Paket.Core/Dependencies/RemoteDownload.fs src/Paket.Core/Dependencies/RemoteDownload.fs:29— src/Paket.Core/Dependencies/RemoteDownload.fs changed 11 times in last 90 days, max cyclomatic complexity 32 in RemoteDownload.getSHA1OfBranch at line 29. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Dependencies/RemoteDownload.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/Paket.Core/Dependencies/NuGet.fs src/Paket.Core/Dependencies/NuGet.fs:724— src/Paket.Core/Dependencies/NuGet.fs changed 5 times in last 90 days, max cyclomatic complexity 68 in NuGet.downloadAndExtractPackage at line 724. 1 of those changes was a fix/bug commit, and the other 4 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Dependencies/NuGet.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/Paket.Core/Common/NetUtils.fs src/Paket.Core/Common/NetUtils.fs:519— src/Paket.Core/Common/NetUtils.fs changed 13 times in last 90 days, max cyclomatic complexity 21 in NetUtils._safeGetFromUrl at line 519. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Common/NetUtils.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/Paket/Program.fs src/Paket/Program.fs:37— src/Paket/Program.fs changed 10 times in last 90 days, max cyclomatic complexity 26 in Program.processWithValidationEx at line 37. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket/Program.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/Paket.Core/PaketConfigFiles/LockFile.fs src/Paket.Core/PaketConfigFiles/LockFile.fs:284— src/Paket.Core/PaketConfigFiles/LockFile.fs changed 4 times in last 90 days, max cyclomatic complexity 57 in LockFileParser.|Remote|NugetPackage|NugetDependency|SourceFile|RepositoryType|Group|InstallOption| at line 284. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/PaketConfigFiles/LockFile.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/Paket.Core/Versioning/Requirements.fs src/Paket.Core/Versioning/Requirements.fs:101— src/Paket.Core/Versioning/Requirements.fs changed 4 times in last 90 days, max cyclomatic complexity 51 in FrameworkRestrictionP.IsSubsetOf at line 101. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Versioning/Requirements.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/Paket.Core/PackageManagement/NugetConvert.fs src/Paket.Core/PackageManagement/NugetConvert.fs:320— src/Paket.Core/PackageManagement/NugetConvert.fs changed 7 times in last 90 days, max cyclomatic complexity 19 in NuGetConvert.createDependenciesFileR at line 320. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/PackageManagement/NugetConvert.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/Paket.Core/Dependencies/DependenciesFileParser.fs src/Paket.Core/Dependencies/DependenciesFileParser.fs:304— src/Paket.Core/Dependencies/DependenciesFileParser.fs changed 3 times in last 90 days, max cyclomatic complexity 39 in DependenciesFileParser.|ParserOptions|_| at line 304. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Dependencies/DependenciesFileParser.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.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs:177— src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs changed 3 times in last 90 days, max cyclomatic complexity 34 in PaketHandler.ResolveDependenciesForLanguage at line 177. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.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/Paket.Core/Packaging/PackageProcess.fs src/Paket.Core/Packaging/PackageProcess.fs:119— src/Paket.Core/Packaging/PackageProcess.fs changed 3 times in last 90 days, max cyclomatic complexity 34 in PackageProcess.Pack at line 119. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Packaging/PackageProcess.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/Paket.Core/Dependencies/NuGetCache.fs src/Paket.Core/Dependencies/NuGetCache.fs:652— src/Paket.Core/Dependencies/NuGetCache.fs changed 5 times in last 90 days, max cyclomatic complexity 20 in NuGetCache.tryAndIgnoreUrl at line 652. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Dependencies/NuGetCache.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/Paket.Core/PaketConfigFiles/DependenciesFile.fs src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:512— src/Paket.Core/PaketConfigFiles/DependenciesFile.fs changed 3 times in last 90 days, max cyclomatic complexity 33 in DependenciesFile.AddAdditionalPackage at line 512. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/PaketConfigFiles/DependenciesFile.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/Paket.Core/Versioning/PlatformMatching.fs src/Paket.Core/Versioning/PlatformMatching.fs:269— src/Paket.Core/Versioning/PlatformMatching.fs changed 4 times in last 90 days, max cyclomatic complexity 23 in PlatformMatching.getCondition at line 269. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Versioning/PlatformMatching.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/Paket.Core/Installation/UpdateProcess.fs src/Paket.Core/Installation/UpdateProcess.fs:11— src/Paket.Core/Installation/UpdateProcess.fs changed 2 times in last 90 days, max cyclomatic complexity 38 in UpdateProcess.selectiveUpdate at line 11. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Installation/UpdateProcess.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/Paket.Core/PaketConfigFiles/TemplateFile.fs src/Paket.Core/PaketConfigFiles/TemplateFile.fs:311— src/Paket.Core/PaketConfigFiles/TemplateFile.fs changed 2 times in last 90 days, max cyclomatic complexity 28 in TemplateFileModule.getDependencyByLine at line 311. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/PaketConfigFiles/TemplateFile.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/Paket.Core/Packaging/NupkgWriter.fs src/Paket.Core/Packaging/NupkgWriter.fs:54— src/Paket.Core/Packaging/NupkgWriter.fs changed 2 times in last 90 days, max cyclomatic complexity 26 in NupkgWriter.nuspecDoc at line 54. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Packaging/NupkgWriter.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/Paket.Core/Dependencies/NuGetV2.fs src/Paket.Core/Dependencies/NuGetV2.fs:151— src/Paket.Core/Dependencies/NuGetV2.fs changed 2 times in last 90 days, max cyclomatic complexity 17 in NuGetV2.handleODataEntry at line 151. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Dependencies/NuGetV2.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.
FileTooLong: Versioning/FrameworkHandling.fs src/Paket.Core/Versioning/FrameworkHandling.fs— FileTooLong — 2094 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1594 over it, 4.19× 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: PaketConfigFiles/ProjectFile.fs src/Paket.Core/PaketConfigFiles/ProjectFile.fs— FileTooLong — 1755 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 65 functions. The bar is 500 significant lines; this is 1255 over it, 3.51× 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: Dependencies/PackageResolver.fs src/Paket.Core/Dependencies/PackageResolver.fs— FileTooLong — 1259 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 759 over it, 2.52× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Versioning/Requirements.fs src/Paket.Core/Versioning/Requirements.fs— FileTooLong — 1141 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 641 over it, 2.28× 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: PaketConfigFiles/LockFile.fs src/Paket.Core/PaketConfigFiles/LockFile.fs— FileTooLong — 891 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 391 over it, 1.78× 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: Dependencies/NuGet.fs src/Paket.Core/Dependencies/NuGet.fs— FileTooLong — 854 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 354 over it, 1.71× 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: PaketConfigFiles/InstallModel.fs src/Paket.Core/PaketConfigFiles/InstallModel.fs— FileTooLong — 827 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 61 functions. The bar is 500 significant lines; this is 327 over it, 1.65× 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: Installation/RestoreProcess.fs src/Paket.Core/Installation/RestoreProcess.fs— FileTooLong — 797 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 34 functions. The bar is 500 significant lines; this is 297 over it, 1.59× 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: Paket.Core/PublicAPI.fs src/Paket.Core/PublicAPI.fs— FileTooLong — 749 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 249 over it, 1.50× 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: Common/Utils.fs src/Paket.Core/Common/Utils.fs— FileTooLong — 703 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 55 functions. The bar is 500 significant lines; this is 203 over it, 1.41× 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: PaketConfigFiles/DependenciesFile.fs src/Paket.Core/PaketConfigFiles/DependenciesFile.fs— FileTooLong — 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 over it, 1.37× 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: Dependencies/NuGetV3.fs src/Paket.Core/Dependencies/NuGetV3.fs— FileTooLong — 657 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 35 functions. The bar is 500 significant lines; this is 157 over it, 1.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: Paket/Program.fs src/Paket/Program.fs— FileTooLong — 638 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 38 functions. The bar is 500 significant lines; this is 138 over it, 1.28× 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: Dependencies/NuGetCache.fs src/Paket.Core/Dependencies/NuGetCache.fs— FileTooLong — 599 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 99 over it, 1.20× 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: PaketConfigFiles/TemplateFile.fs src/Paket.Core/PaketConfigFiles/TemplateFile.fs— FileTooLong — 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19× 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: Installation/InstallProcess.fs src/Paket.Core/Installation/InstallProcess.fs— FileTooLong — 554 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 54 over it, 1.11× 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: Dependencies/DependenciesFileParser.fs src/Paket.Core/Dependencies/DependenciesFileParser.fs— FileTooLong — 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08× 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: Paket/Commands.fs src/Paket/Commands.fs— FileTooLong — 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04× 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.
End-of-life runtime: .NET net5.0 integrationtests/scenarios/p003983-dont-remove-packed-projects/before/FsLex.Core/FsLex.Core.fsproj:4— integrationtests/scenarios/p003983-dont-remove-packed-projects/before/FsLex.Core/FsLex.Core.fsproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net5.0 integrationtests/scenarios/p003983-dont-remove-packed-projects/before/FsLexYacc.Runtime/FsLexYacc.Runtime.fsproj:4— integrationtests/scenarios/p003983-dont-remove-packed-projects/before/FsLexYacc.Runtime/FsLexYacc.Runtime.fsproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net5.0 integrationtests/scenarios/packageref-specs/copy_local_false/before/test.fsproj:4— integrationtests/scenarios/packageref-specs/copy_local_false/before/test.fsproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net5.0 integrationtests/scenarios/packageref-specs/import_targets_false/before/test.fsproj:4— integrationtests/scenarios/packageref-specs/import_targets_false/before/test.fsproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net5.0 integrationtests/scenarios/packageref-specs/omit_content/before/test.fsproj:4— integrationtests/scenarios/packageref-specs/omit_content/before/test.fsproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net7.0 integrationtests/scenarios/i002161/before/2161.fsproj:4— integrationtests/scenarios/i002161/before/2161.fsproj declares .NET net7.0 as this project's target framework, and .NET 7, support ended 2024-05-14. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-05-14 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.
End-of-life runtime: .NET net7.0 integrationtests/scenarios/i002512-1/before/proj.fsproj:4— integrationtests/scenarios/i002512-1/before/proj.fsproj declares .NET net7.0 as this project's target framework, and .NET 7, support ended 2024-05-14. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-05-14 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.
End-of-life runtime: .NET net7.0 integrationtests/scenarios/i002512-2/before/proj.fsproj:4— integrationtests/scenarios/i002512-2/before/proj.fsproj declares .NET net7.0 as this project's target framework, and .NET 7, support ended 2024-05-14. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-05-14 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.
End-of-life runtime: .NET net7.0 integrationtests/scenarios/i004443-convert-slnx/before/proj.fsproj:4— integrationtests/scenarios/i004443-convert-slnx/before/proj.fsproj declares .NET net7.0 as this project's target framework, and .NET 7, support ended 2024-05-14. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-05-14 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.
End-of-life runtime: .NET netcoreapp2.0 integrationtests/scenarios/i002694/before/console/console.csproj:8— integrationtests/scenarios/i002694/before/console/console.csproj declares .NET netcoreapp2.0 as this project's target framework, and .NET Core 2.0, support ended 2018-10-01. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2018-10-01 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.
End-of-life runtime: .NET netcoreapp2.0 integrationtests/scenarios/i003000-netcoreapp2/before/c1/c1.csproj:5— integrationtests/scenarios/i003000-netcoreapp2/before/c1/c1.csproj declares .NET netcoreapp2.0 as this project's target framework, and .NET Core 2.0, support ended 2018-10-01. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2018-10-01 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.
End-of-life runtime: .NET netcoreapp2.1 integrationtests/scenarios/i002684-fast-restore/before/console/console.fsproj:5— integrationtests/scenarios/i002684-fast-restore/before/console/console.fsproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 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.
End-of-life runtime: .NET netcoreapp2.1 integrationtests/scenarios/i003527/before/project/project.fsproj:5— integrationtests/scenarios/i003527/before/project/project.fsproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 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.
End-of-life runtime: .NET netcoreapp2.1 integrationtests/scenarios/i003608-invalid-cache/before/console/console.fsproj:5— integrationtests/scenarios/i003608-invalid-cache/before/console/console.fsproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 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.
End-of-life runtime: .NET netcoreapp2.1 integrationtests/scenarios/i004002-pack-global-tools/before/tool1.csproj:5— integrationtests/scenarios/i004002-pack-global-tools/before/tool1.csproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 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.
End-of-life runtime: .NET netcoreapp2.1 integrationtests/scenarios/i004003-pack-global-tools-p2p/before/tool1/tool1.csproj:5— integrationtests/scenarios/i004003-pack-global-tools-p2p/before/tool1/tool1.csproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 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.
End-of-life runtime: .NET netcoreapp2.1 integrationtests/scenarios/i4333-lock-content-invalidates-project-props/before/project/project.fsproj:5— integrationtests/scenarios/i4333-lock-content-invalidates-project-props/before/project/project.fsproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 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.
End-of-life runtime: .NET Framework net461 src/Paket.LegacyStub/Paket.LegacyStub.csproj:11— src/Paket.LegacyStub/Paket.LegacyStub.csproj declares .NET Framework net461 as this project's target framework, and .NET Framework 4.6.1, support ended 2022-04-26. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-04-26 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.
D8 · Code Coverage· No test project references fs2528 · ×6
No test project references fs2528 integrationtests/scenarios/i002528-2/before/fs2528.csproj— No test project in this repository references fs2528 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references fs2528 integrationtests/scenarios/i002528-3/before/fs2528.csproj— No test project in this repository references fs2528 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references fs2528 integrationtests/scenarios/i002528-1/before/fs2528.fsproj— No test project in this repository references fs2528 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references fs2528 integrationtests/scenarios/i002528-4/before/fs2528.fsproj— No test project in this repository references fs2528 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references fs2528 integrationtests/scenarios/i002528-5/before/fs2528.fsproj— No test project in this repository references fs2528 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references fs2528 integrationtests/scenarios/i002528-6/before/fs2528.fsproj— No test project in this repository references fs2528 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references projectA · ×6
No test project references projectA integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectA/projectA.csproj— No test project in this repository references projectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references projectA integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectA/projectA.csproj— No test project in this repository references projectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references projectA integrationtests/scenarios/i001848-pack-single-template-with-incl-flag/before/projectA/projectA.csproj— No test project in this repository references projectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references projectA integrationtests/scenarios/i001848-pack-single-template-wo-incl-flag/before/projectA/projectA.csproj— No test project in this repository references projectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references projectA integrationtests/scenarios/i001848-pack-with-non-packed-deps/before/projectA/projectA.csproj— No test project in this repository references projectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references projectA integrationtests/scenarios/i001737-simplify-with-auto-framework/before/projectA/projectA.fsproj— No test project in this repository references projectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
Duplicated block (10 lines × 2) src/Paket.Core/Common/Async.fs:44— src/Paket.Core/Common/Async.fs:44-53 | src/Paket.Core/Common/Async.fs:59-68 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/Paket.Core/Dependencies/NuGetCache.fs:333— src/Paket.Core/Dependencies/NuGetCache.fs:333-342 | src/Paket.Core/Dependencies/NuGetLocal.fs:48-57 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:982— src/Paket.Core/PaketConfigFiles/ProjectFile.fs:982-991 | src/Paket.Core/PaketConfigFiles/ProjectFile.fs:995-1004 — 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/Paket.Core/PaketConfigFiles/ProjectFile.fs:982` 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 (10 lines × 2) src/Paket.Core/Dependencies/NuGetV2.fs:120— src/Paket.Core/Dependencies/NuGetV2.fs:120-129 | src/Paket.Core/Dependencies/NuGetV2.fs:132-141 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/Paket.Core/PaketConfigFiles/TemplateFile.fs:506— src/Paket.Core/PaketConfigFiles/TemplateFile.fs:506-515 | src/Paket.Core/PaketConfigFiles/TemplateFile.fs:536-545 — 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/Paket.Core/Dependencies/NuGetV2.fs:49— src/Paket.Core/Dependencies/NuGetV2.fs:49-56 | src/Paket.Core/Dependencies/NuGetV2.fs:422-429 — 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/Paket.Core/PaketConfigFiles/InstallModel.fs:646— src/Paket.Core/PaketConfigFiles/InstallModel.fs:646-653 | src/Paket.Core/PaketConfigFiles/InstallModel.fs:656-663 — 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/Paket.Core/PaketConfigFiles/InstallModel.fs:646` 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/Paket.Core/PublicAPI.fs:334— src/Paket.Core/PublicAPI.fs:334-341 | src/Paket.Core/PublicAPI.fs:353-360 — 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/Paket.Core/PublicAPI.fs:334` 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/Paket.Core/Versioning/Requirements.fs:245— src/Paket.Core/Versioning/Requirements.fs:245-252 | src/Paket.Core/Versioning/Requirements.fs:328-335 — 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 (5 lines × 2) src/Paket.Core/PackageManagement/AddProcess.fs:135— src/Paket.Core/PackageManagement/AddProcess.fs:135-139 | src/Paket.Core/PackageManagement/AddProcess.fs:152-156 — 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 (5 lines × 2) src/Paket.Core/Dependencies/DependenciesFileParser.fs:241— src/Paket.Core/Dependencies/DependenciesFileParser.fs:241-245 | src/Paket.Core/Dependencies/DependenciesFileParser.fs:263-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 (5 lines × 2) src/Paket.Core/PaketConfigFiles/TemplateFile.fs:487— src/Paket.Core/PaketConfigFiles/TemplateFile.fs:487-491 | src/Paket.Core/PaketConfigFiles/TemplateFile.fs:492-496 — 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 (5 lines × 2) src/Paket.Core/Common/NetUtils.fs:334— src/Paket.Core/Common/NetUtils.fs:334-338 | src/Paket.Core/Common/NetUtils.fs:355-359 — 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/Paket.Core/PaketConfigFiles/SolutionFile.fs:148— src/Paket.Core/PaketConfigFiles/SolutionFile.fs:148-154 | src/Paket.Core/PaketConfigFiles/SolutionFile.fs:338-344 — 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/Paket.Core/Versioning/Requirements.fs:580— src/Paket.Core/Versioning/Requirements.fs:580-586 | src/Paket.Core/Versioning/Requirements.fs:611-617 — 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/Paket.Core/PaketConfigFiles/ProjectFile.fs:992— src/Paket.Core/PaketConfigFiles/ProjectFile.fs:992-1000 | src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1005-1011 — 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.
D8 · Code Coverage· No test project references A · ×3
No test project references A integrationtests/scenarios/i002520-interproject-references-constraint/before/A/A.csproj— No test project in this repository references A (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references A integrationtests/scenarios/i002776-pack-transitive-project-refs/before/A/A.csproj— No test project in this repository references A (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references A integrationtests/scenarios/i002776-pack-transitive-with-template/before/A/A.csproj— No test project in this repository references A (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references B · ×3
No test project references B integrationtests/scenarios/i002520-interproject-references-constraint/before/B/B.csproj— No test project in this repository references B (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references B integrationtests/scenarios/i002776-pack-transitive-project-refs/before/B/B.csproj— No test project in this repository references B (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references B integrationtests/scenarios/i002776-pack-transitive-with-template/before/B/B.csproj— No test project in this repository references B (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references console · ×3
No test project references console integrationtests/scenarios/i002694/before/console/console.csproj— No test project in this repository references console (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references console integrationtests/scenarios/i002684-fast-restore/before/console/console.fsproj— No test project in this repository references console (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references console integrationtests/scenarios/i003608-invalid-cache/before/console/console.fsproj— No test project in this repository references console (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references test · ×3
No test project references test integrationtests/scenarios/packageref-specs/copy_local_false/before/test.fsproj— No test project in this repository references test (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references test integrationtests/scenarios/packageref-specs/import_targets_false/before/test.fsproj— No test project in this repository references test (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references test integrationtests/scenarios/packageref-specs/omit_content/before/test.fsproj— No test project in this repository references test (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
TooManyMethods: Dependencies src/Paket.Core/PublicAPI.fs:15— TooManyMethods — 89 methods. The bar is 30 methods; this is 59 over it, 2.97× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DependenciesFile src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:62— TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (15 lines × 2) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:435— src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:435-449 | src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:459-473 — 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/Paket.Core/PaketConfigFiles/DependenciesFile.fs:435` 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 (15 lines × 2) src/Paket.Core/PaketConfigFiles/LockFile.fs:1022— src/Paket.Core/PaketConfigFiles/LockFile.fs:1022-1036 | src/Paket.Core/PublicAPI.fs:500-514 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `src/Paket.Core/PaketConfigFiles/LockFile.fs:1022` 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.
D8 · Code Coverage· No test project references LocalizedLib · ×2
No test project references LocalizedLib integrationtests/scenarios/i001816-pack-localized-happy-path/before/LocalizedLib/LocalizedLib.csproj— No test project in this repository references LocalizedLib (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references LocalizedLib integrationtests/scenarios/i001816-pack-localized-missing-dll/before/LocalizedLib/LocalizedLib.csproj— No test project in this repository references LocalizedLib (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references C · ×2
No test project references C integrationtests/scenarios/i002776-pack-transitive-project-refs/before/C/C.csproj— No test project in this repository references C (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references C integrationtests/scenarios/i002776-pack-transitive-with-template/before/C/C.csproj— No test project in this repository references C (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references D · ×2
No test project references D integrationtests/scenarios/i002776-pack-transitive-project-refs/before/D/D.csproj— No test project in this repository references D (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references D integrationtests/scenarios/i002776-pack-transitive-with-template/before/D/D.csproj— No test project in this repository references D (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references MyProj.Common · ×2
No test project references MyProj.Common integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Common/MyProj.Common.csproj— No test project in this repository references MyProj.Common (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references MyProj.Common integrationtests/scenarios/i003558-pack-multitarget-with-p2p-by-tfm/before/MyProj.Common/MyProj.Common.csproj— No test project in this repository references MyProj.Common (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references MyProj.Main · ×2
No test project references MyProj.Main integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Main/MyProj.Main.csproj— No test project in this repository references MyProj.Main (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references MyProj.Main integrationtests/scenarios/i003558-pack-multitarget-with-p2p-by-tfm/before/MyProj.Main/MyProj.Main.csproj— No test project in this repository references MyProj.Main (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references before · ×2
No test project references before integrationtests/scenarios/i002883-apply-version-ranges/before/before.fsproj— No test project in this repository references before (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references before integrationtests/scenarios/i004183-apply-with-multiple-groups/before/before.fsproj— No test project in this repository references before (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references dotnet · ×2
No test project references dotnet integrationtests/scenarios/i003012/before/dotnet/dotnet.csproj— No test project in this repository references dotnet (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references dotnet integrationtests/scenarios/i003410-readonly-obj/before/dotnet/dotnet.csproj— No test project in this repository references dotnet (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references lib1 · ×2
No test project references lib1 integrationtests/scenarios/i003599-pack-build-meta/before/lib1.csproj— No test project in this repository references lib1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references lib1 integrationtests/scenarios/i004004-pack-version/before/lib1.csproj— No test project in this repository references lib1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references project · ×2
No test project references project integrationtests/scenarios/i003527/before/project/project.fsproj— No test project in this repository references project (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references project integrationtests/scenarios/i4333-lock-content-invalidates-project-props/before/project/project.fsproj— No test project in this repository references project (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references tool1 · ×2
No test project references tool1 integrationtests/scenarios/i004002-pack-global-tools/before/tool1.csproj— No test project in this repository references tool1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
No test project references tool1 integrationtests/scenarios/i004003-pack-global-tools-p2p/before/tool1/tool1.csproj— No test project in this repository references tool1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
FrameworkDetection.internalExtract (cyclomatic 112) src/Paket.Core/Versioning/FrameworkHandling.fs:1163— FrameworkDetection.internalExtract has cyclomatic complexity 112 (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.
PackageMetaData.findDependencies (cyclomatic 90) src/Paket.Core/Packaging/PackageMetaData.fs:212— PackageMetaData.findDependencies has cyclomatic complexity 90 (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.
PackageResolver.Resolve (cyclomatic 87) src/Paket.Core/Dependencies/PackageResolver.fs:957— PackageResolver.Resolve has cyclomatic complexity 87 (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.
ProjectFileModule.calculatePropertyMap (cyclomatic 74) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:293— ProjectFileModule.calculatePropertyMap has cyclomatic complexity 74 (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.
RestoreProcess.Restore (cyclomatic 70) src/Paket.Core/Installation/RestoreProcess.fs:756— RestoreProcess.Restore has cyclomatic complexity 70 (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.
NuGet.downloadAndExtractPackage (cyclomatic 68) src/Paket.Core/Dependencies/NuGet.fs:724— NuGet.downloadAndExtractPackage has cyclomatic complexity 68 (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.
LockFileParser.|Remote|NugetPackage|NugetDependency|SourceFile|RepositoryType|Group|InstallOption| (cyclomatic 57) src/Paket.Core/PaketConfigFiles/LockFile.fs:284— LockFileParser.|Remote|NugetPackage|NugetDependency|SourceFile|RepositoryType|Group|InstallOption| 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.
ProjectFileModule.updateReferences (cyclomatic 54) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1152— ProjectFileModule.updateReferences has cyclomatic complexity 54 (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.
InstallProcess.InstallIntoProjects (cyclomatic 53) src/Paket.Core/Installation/InstallProcess.fs:377— InstallProcess.InstallIntoProjects has cyclomatic complexity 53 (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.
FrameworkRestrictionP.IsSubsetOf (cyclomatic 51) src/Paket.Core/Versioning/Requirements.fs:101— FrameworkRestrictionP.IsSubsetOf has cyclomatic complexity 51 (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.
ProjectFileModule.generateXml (cyclomatic 50) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:729— ProjectFileModule.generateXml has cyclomatic complexity 50 (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.
LockFileParser.Parse (cyclomatic 49) src/Paket.Core/PaketConfigFiles/LockFile.fs:420— LockFileParser.Parse 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.
NuGet.GetVersions (cyclomatic 48) src/Paket.Core/Dependencies/NuGet.fs:515— NuGet.GetVersions has cyclomatic complexity 48 (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.
Dependencies.FixNuspecs (cyclomatic 47) src/Paket.Core/PublicAPI.fs:786— Dependencies.FixNuspecs has cyclomatic complexity 47 (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.
Handling.extractUrlParts (cyclomatic 46) src/Paket.Core/Dependencies/GitHandling.fs:28— Handling.extractUrlParts has cyclomatic complexity 46 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
RestoreProcess.createProjectReferencesFiles (cyclomatic 45) src/Paket.Core/Installation/RestoreProcess.fs:430— RestoreProcess.createProjectReferencesFiles has cyclomatic complexity 45 (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.
Requirements.parseRestrictionsRaw (cyclomatic 44) src/Paket.Core/Versioning/Requirements.fs:809— Requirements.parseRestrictionsRaw has cyclomatic complexity 44 (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.
ProjectFile.SearchAllProjectRelatedFiles (cyclomatic 41) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1932— ProjectFile.SearchAllProjectRelatedFiles has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
LockFileSerializer.serializeOptionsAsLines (cyclomatic 39) src/Paket.Core/PaketConfigFiles/LockFile.fs:37— LockFileSerializer.serializeOptionsAsLines 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.
DependenciesFileParser.|ParserOptions|_| (cyclomatic 39) src/Paket.Core/Dependencies/DependenciesFileParser.fs:304— DependenciesFileParser.|ParserOptions|_| 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.
UpdateProcess.selectiveUpdate (cyclomatic 38) src/Paket.Core/Installation/UpdateProcess.fs:11— UpdateProcess.selectiveUpdate has cyclomatic complexity 38 (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.
VersionRequirement.IsInRange (cyclomatic 37) src/Paket.Core/Versioning/VersionRange.fs:168— VersionRequirement.IsInRange has cyclomatic complexity 37 (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.
PackageProcess.Pack (cyclomatic 34) src/Paket.Core/Packaging/PackageProcess.fs:119— PackageProcess.Pack has cyclomatic complexity 34 (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.
InstallSettings.Parse (cyclomatic 34) src/Paket.Core/Versioning/Requirements.fs:1073— InstallSettings.Parse has cyclomatic complexity 34 (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.
PaketHandler.ResolveDependenciesForLanguage (cyclomatic 34) src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs:177— PaketHandler.ResolveDependenciesForLanguage has cyclomatic complexity 34 (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.
DependenciesFile.AddAdditionalPackage (cyclomatic 33) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:512— DependenciesFile.AddAdditionalPackage has cyclomatic complexity 33 (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.
NuGet.getPackageDetails (cyclomatic 32) src/Paket.Core/Dependencies/NuGet.fs:312— NuGet.getPackageDetails 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.
RemoteDownload.getSHA1OfBranch (cyclomatic 32) src/Paket.Core/Dependencies/RemoteDownload.fs:29— RemoteDownload.getSHA1OfBranch 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.
FrameworkRestrictionModule.simplify' (cyclomatic 30) src/Paket.Core/Versioning/Requirements.fs:356— FrameworkRestrictionModule.simplify' has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DependenciesFileParser.parseLine (cyclomatic 29) src/Paket.Core/Dependencies/DependenciesFileParser.fs:502— DependenciesFileParser.parseLine has cyclomatic complexity 29 (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.
VersionRequirement.Parse (cyclomatic 29) src/Paket.Core/Versioning/VersionRange.fs:228— VersionRequirement.Parse has cyclomatic complexity 29 (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.
TemplateFileModule.getDependencyByLine (cyclomatic 28) src/Paket.Core/PaketConfigFiles/TemplateFile.fs:311— TemplateFileModule.getDependencyByLine 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.
DependenciesFile.Resolve (cyclomatic 27) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:218— DependenciesFile.Resolve has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
InstallSettings.ToString (cyclomatic 27) src/Paket.Core/Versioning/Requirements.fs:996— InstallSettings.ToString has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
NupkgWriter.nuspecDoc (cyclomatic 26) src/Paket.Core/Packaging/NupkgWriter.fs:54— NupkgWriter.nuspecDoc has cyclomatic complexity 26 (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.
LockFileSerializer.serializeSourceFiles (cyclomatic 26) src/Paket.Core/PaketConfigFiles/LockFile.fs:172— LockFileSerializer.serializeSourceFiles 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.
Program.processWithValidationEx (cyclomatic 26) src/Paket/Program.fs:37— Program.processWithValidationEx has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: Program.handleCommand (cyclomatic 30) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
VersionRequirement.FormatInNuGetSyntax (cyclomatic 25) src/Paket.Core/Versioning/VersionRange.fs:326— VersionRequirement.FormatInNuGetSyntax has cyclomatic complexity 25 (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.
LockFileSerializer.serializePackages (cyclomatic 24) src/Paket.Core/PaketConfigFiles/LockFile.fs:97— LockFileSerializer.serializePackages has cyclomatic complexity 24 (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.
DependenciesFileParser.parseVersionRequirement (cyclomatic 24) src/Paket.Core/Dependencies/DependenciesFileParser.fs:47— DependenciesFileParser.parseVersionRequirement has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
VersionRange.IsConflicting (cyclomatic 24) src/Paket.Core/Versioning/VersionRange.fs:105— VersionRange.IsConflicting has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Utils.RunInLockedAccessMode (cyclomatic 24) src/Paket.Core/Common/Utils.fs:449— Utils.RunInLockedAccessMode has cyclomatic complexity 24 (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.
NupkgWriter.Write (cyclomatic 23) src/Paket.Core/Packaging/NupkgWriter.fs:265— NupkgWriter.Write has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
UpdateProcess.SelectiveUpdate (cyclomatic 23) src/Paket.Core/Installation/UpdateProcess.fs:204— UpdateProcess.SelectiveUpdate has cyclomatic complexity 23 (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.
ProjectFileModule.getOutputDirectory (cyclomatic 23) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1637— ProjectFileModule.getOutputDirectory has cyclomatic complexity 23 (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.
RemoteDownload.DownloadSourceFiles (cyclomatic 23) src/Paket.Core/Dependencies/RemoteDownload.fs:312— RemoteDownload.DownloadSourceFiles has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PlatformMatching.getCondition (cyclomatic 23) src/Paket.Core/Versioning/PlatformMatching.fs:269— PlatformMatching.getCondition has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: PlatformMatching.getTargetCondition (cyclomatic 52) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
AddProcess.add (cyclomatic 22) src/Paket.Core/PackageManagement/AddProcess.fs:22— AddProcess.add 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.
ProjectFileModule.updateFileItems (cyclomatic 22) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:559— ProjectFileModule.updateFileItems has cyclomatic complexity 22 (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.
LockFile.GetOrderedPackageHull (cyclomatic 22) src/Paket.Core/PaketConfigFiles/LockFile.fs:888— LockFile.GetOrderedPackageHull has cyclomatic complexity 22 (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.
NuGetV3.getCatalogCursor (cyclomatic 22) src/Paket.Core/Dependencies/NuGetV3.fs:396— NuGetV3.getCatalogCursor has cyclomatic complexity 22 (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.
NuGetV3.getRelevantPage (cyclomatic 22) src/Paket.Core/Dependencies/NuGetV3.fs:690— NuGetV3.getRelevantPage has cyclomatic complexity 22 (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.
PackageResolver.getCompatibleVersions (cyclomatic 21) src/Paket.Core/Dependencies/PackageResolver.fs:548— PackageResolver.getCompatibleVersions has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NetUtils._safeGetFromUrl (cyclomatic 21) src/Paket.Core/Common/NetUtils.fs:519— NetUtils._safeGetFromUrl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PackageProcess.merge (cyclomatic 20) src/Paket.Core/Packaging/PackageProcess.fs:26— PackageProcess.merge has cyclomatic complexity 20 (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.
ScriptGeneration.constructScriptsFromData (cyclomatic 20) src/Paket.Core/Installation/ScriptGeneration.fs:279— ScriptGeneration.constructScriptsFromData has cyclomatic complexity 20 (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.
NuGetCache.tryAndIgnoreUrl (cyclomatic 20) src/Paket.Core/Dependencies/NuGetCache.fs:652— NuGetCache.tryAndIgnoreUrl has cyclomatic complexity 20 (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.
VersionRange.IsIncludedIn (cyclomatic 20) src/Paket.Core/Versioning/VersionRange.fs:52— VersionRange.IsIncludedIn has cyclomatic complexity 20 (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.
NuGetConvert.createDependenciesFileR (cyclomatic 19) src/Paket.Core/PackageManagement/NugetConvert.fs:320— NuGetConvert.createDependenciesFileR has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ReferencesFile.FromLines (cyclomatic 19) src/Paket.Core/PaketConfigFiles/ReferencesFile.fs:40— ReferencesFile.FromLines has cyclomatic complexity 19 (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.
GarbageCollection.deleteUnusedPackages (cyclomatic 18) src/Paket.Core/Installation/GarbageCollection.fs:38— GarbageCollection.deleteUnusedPackages has cyclomatic complexity 18 (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.
NuGetV3.tryGetNuGetV3Resource (cyclomatic 18) src/Paket.Core/Dependencies/NuGetV3.fs:65— NuGetV3.tryGetNuGetV3Resource has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
RemoteDownload.downloadDependenciesFile (cyclomatic 18) src/Paket.Core/Dependencies/RemoteDownload.fs:119— RemoteDownload.downloadDependenciesFile has cyclomatic complexity 18 (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.
PackageRequirement.Compare (cyclomatic 18) src/Paket.Core/Versioning/Requirements.fs:1273— PackageRequirement.Compare has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ProjectFileModule.removePaketNodes (cyclomatic 17) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1024— ProjectFileModule.removePaketNodes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
NuGetV2.handleODataEntry (cyclomatic 17) src/Paket.Core/Dependencies/NuGetV2.fs:151— NuGetV2.handleODataEntry has cyclomatic complexity 17 (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.
RemoteUpload.Push (cyclomatic 17) src/Paket.Core/Dependencies/RemoteUpload.fs:32— RemoteUpload.Push has cyclomatic complexity 17 (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.
Program.pack (cyclomatic 17) src/Paket/Program.fs:381— Program.pack has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: Program.handleCommand (cyclomatic 30) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
RestoreProcess.createPaketPropsFile (cyclomatic 16) src/Paket.Core/Installation/RestoreProcess.fs:317— RestoreProcess.createPaketPropsFile 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.
DependencyChangeDetection.findNuGetChangesInDependenciesFile (cyclomatic 16) src/Paket.Core/Installation/DependencyChangeDetection.fs:20— DependencyChangeDetection.findNuGetChangesInDependenciesFile 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.
Nuspec.Load (cyclomatic 16) src/Paket.Core/Dependencies/Nuspec.fs:75— Nuspec.Load 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.
Requirements.parseRestrictionsLegacy (cyclomatic 16) src/Paket.Core/Versioning/Requirements.fs:705— Requirements.parseRestrictionsLegacy 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.
CredentialProviders.callProvider (cyclomatic 16) src/Paket.Core/Versioning/CredentialProviders.fs:98— CredentialProviders.callProvider has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
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.
Repeated repair: src/Paket.Core/Versioning/ConfigFile.fs src/Paket.Core/Versioning/ConfigFile.fs:198— src/Paket.Core/Versioning/ConfigFile.fs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is ConfigFile.askAndAddAuth at line 198), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix credential lookup to ignore www. prefix mismatch for nuget.org”; “Fix add-credentials failing when console input is redirected (Git Bash)”; “Fix #3592: tolerate trailing slash mismatch in credential/token source lookup”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 18:21:42 +01:00' --until='2026-11-11 18:21:42 +01:00' --full-history --no-merges -- src/Paket.Core/Versioning/ConfigFile.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.
PackageResolver.Resolve (cognitive 233) src/Paket.Core/Dependencies/PackageResolver.fs:957— PackageResolver.Resolve has cognitive complexity 233 (threshold 15). Drivers by points: if/else 50 (136 pts), match/switch 22 (56 pts), loops 4 (17 pts), boolean chains 12, error handling 6 (12 pts) (nesting depth added 139). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PackageMetaData.findDependencies (cognitive 190) src/Paket.Core/Packaging/PackageMetaData.fs:212— PackageMetaData.findDependencies has cognitive complexity 190 (threshold 15). Drivers by points: match/switch 34 (102 pts), if/else 23 (72 pts), boolean chains 8, loops 3 (5 pts), error handling 1 (3 pts) (nesting depth added 121). 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.
ProjectFile.SearchAllProjectRelatedFiles (cognitive 149) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1932— ProjectFile.SearchAllProjectRelatedFiles has cognitive complexity 149 (threshold 15). Drivers by points: if/else 31 (136 pts), boolean chains 11, error handling 2 (nesting depth added 105). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
NuGet.downloadAndExtractPackage (cognitive 143) src/Paket.Core/Dependencies/NuGet.fs:724— NuGet.downloadAndExtractPackage has cognitive complexity 143 (threshold 15). Drivers by points: if/else 35 (74 pts), match/switch 12 (30 pts), error handling 8 (25 pts), boolean chains 11, loops 1 (3 pts) (nesting depth added 76). 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.
RestoreProcess.Restore (cognitive 136) src/Paket.Core/Installation/RestoreProcess.fs:756— RestoreProcess.Restore has cognitive complexity 136 (threshold 15). Drivers by points: if/else 40 (87 pts), match/switch 9 (20 pts), loops 4 (17 pts), boolean chains 12 (nesting depth added 71). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
InstallProcess.InstallIntoProjects (cognitive 130) src/Paket.Core/Installation/InstallProcess.fs:377— InstallProcess.InstallIntoProjects has cognitive complexity 130 (threshold 15). Drivers by points: if/else 27 (64 pts), match/switch 13 (34 pts), loops 8 (18 pts), error handling 3 (12 pts), boolean chains 2 (nesting depth added 77). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
LockFileParser.Parse (cognitive 108) src/Paket.Core/PaketConfigFiles/LockFile.fs:420— LockFileParser.Parse has cognitive complexity 108 (threshold 15). Drivers by points: match/switch 16 (75 pts), if/else 17 (31 pts), boolean chains 2 (nesting depth added 73). 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.
RestoreProcess.createProjectReferencesFiles (cognitive 103) src/Paket.Core/Installation/RestoreProcess.fs:430— RestoreProcess.createProjectReferencesFiles has cognitive complexity 103 (threshold 15). Drivers by points: if/else 22 (50 pts), match/switch 7 (32 pts), error handling 5 (9 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGet.GetVersions (cognitive 103) src/Paket.Core/Dependencies/NuGet.fs:515— NuGet.GetVersions has cognitive complexity 103 (threshold 15). Drivers by points: if/else 24 (57 pts), match/switch 12 (29 pts), error handling 3 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PackageRequirement.Compare (cognitive 97) src/Paket.Core/Versioning/Requirements.fs:1273— PackageRequirement.Compare has cognitive complexity 97 (threshold 15). Drivers by points: if/else 24 (90 pts), match/switch 2 (7 pts) (nesting depth added 71). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ProjectFileModule.calculatePropertyMap (cognitive 91) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:293— ProjectFileModule.calculatePropertyMap has cognitive complexity 91 (threshold 15). Drivers by points: match/switch 20 (44 pts), if/else 31 (41 pts), boolean chains 6 (nesting depth added 34). 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.
ProjectFileModule.updateReferences (cognitive 90) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1152— ProjectFileModule.updateReferences has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (48 pts), loops 14 (38 pts), boolean chains 4 (nesting depth added 50). 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.
ProjectFileModule.generateXml (cognitive 87) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:729— ProjectFileModule.generateXml has cognitive complexity 87 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 17 (32 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 42). 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.
DependenciesFile.AddAdditionalPackage (cognitive 72) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:512— DependenciesFile.AddAdditionalPackage has cognitive complexity 72 (threshold 15). Drivers by points: match/switch 11 (34 pts), if/else 10 (28 pts), boolean chains 5, loops 1 (5 pts) (nesting depth added 45). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TemplateFileModule.getDependencyByLine (cognitive 67) src/Paket.Core/PaketConfigFiles/TemplateFile.fs:311— TemplateFileModule.getDependencyByLine has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 13 (55 pts), if/else 6 (12 pts) (nesting depth added 48). 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.
Utils.RunInLockedAccessMode (cognitive 63) src/Paket.Core/Common/Utils.fs:449— Utils.RunInLockedAccessMode has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 5 (10 pts), error handling 5 (9 pts), boolean chains 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PaketHandler.ResolveDependenciesForLanguage (cognitive 63) src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs:177— PaketHandler.ResolveDependenciesForLanguage has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (35 pts), match/switch 7 (22 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 32). 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.
FrameworkDetection.internalExtract (cognitive 62) src/Paket.Core/Versioning/FrameworkHandling.fs:1163— FrameworkDetection.internalExtract has cognitive complexity 62 (threshold 15). Drivers by points: if/else 31 (37 pts), match/switch 10 (19 pts), boolean chains 6 (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Dependencies.FixNuspecs (cognitive 60) src/Paket.Core/PublicAPI.fs:786— Dependencies.FixNuspecs has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 15 (34 pts), if/else 8 (13 pts), loops 5 (10 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 30). 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.
Requirements.parseRestrictionsRaw (cognitive 57) src/Paket.Core/Versioning/Requirements.fs:809— Requirements.parseRestrictionsRaw has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 17, match/switch 5 (11 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VersionRequirement.Parse (cognitive 54) src/Paket.Core/Versioning/VersionRange.fs:228— VersionRequirement.Parse has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 12 (21 pts), error handling 2 (4 pts), boolean chains 2 (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.
LockFileSerializer.serializeSourceFiles (cognitive 49) src/Paket.Core/PaketConfigFiles/LockFile.fs:172— LockFileSerializer.serializeSourceFiles has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 7 (22 pts), if/else 8 (21 pts), loops 3 (6 pts) (nesting depth added 31). 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.
PackageProcess.merge (cognitive 47) src/Paket.Core/Packaging/PackageProcess.fs:26— PackageProcess.merge has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 9 (25 pts), if/else 4 (20 pts), boolean chains 2 (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.
LockFileSerializer.serializePackages (cognitive 47) src/Paket.Core/PaketConfigFiles/LockFile.fs:97— LockFileSerializer.serializePackages has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 3 (7 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 24). 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.
Handling.extractUrlParts (cognitive 47) src/Paket.Core/Dependencies/GitHandling.fs:28— Handling.extractUrlParts has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 12 (14 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AddProcess.add (cognitive 45) src/Paket.Core/PackageManagement/AddProcess.fs:22— AddProcess.add has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 5 (21 pts), if/else 12 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
LockFile.GetOrderedPackageHull (cognitive 45) src/Paket.Core/PaketConfigFiles/LockFile.fs:888— LockFile.GetOrderedPackageHull has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 6 (17 pts), loops 5 (9 pts) (nesting depth added 26). 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.
NuGet.getPackageDetails (cognitive 45) src/Paket.Core/Dependencies/NuGet.fs:312— NuGet.getPackageDetails has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 11 (20 pts), if/else 9 (18 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 20). 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.
RemoteDownload.DownloadSourceFiles (cognitive 45) src/Paket.Core/Dependencies/RemoteDownload.fs:312— RemoteDownload.DownloadSourceFiles has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 6 (10 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ScriptGeneration.constructScriptsFromData (cognitive 44) src/Paket.Core/Installation/ScriptGeneration.fs:279— ScriptGeneration.constructScriptsFromData has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 5 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FrameworkRestrictionModule.simplify' (cognitive 42) src/Paket.Core/Versioning/Requirements.fs:356— FrameworkRestrictionModule.simplify' has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (31 pts), match/switch 8, boolean chains 2, loops 1 (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.
PackageResolver.getCompatibleVersions (cognitive 41) src/Paket.Core/Dependencies/PackageResolver.fs:548— PackageResolver.getCompatibleVersions has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 16). 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.
RemoteDownload.downloadGitRepository (cognitive 40) src/Paket.Core/Dependencies/RemoteDownload.fs:205— RemoteDownload.downloadGitRepository has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 1 (5 pts), match/switch 2 (5 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 23). 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.
RestoreProcess.createPaketPropsFile (cognitive 38) src/Paket.Core/Installation/RestoreProcess.fs:317— RestoreProcess.createPaketPropsFile has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 6 (16 pts), boolean chains 1 (nesting depth added 20). 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.
DependenciesFile.Resolve (cognitive 38) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:218— DependenciesFile.Resolve has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 8 (15 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 17). 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.
DependenciesFileParser.parseLine (cognitive 38) src/Paket.Core/Dependencies/DependenciesFileParser.fs:502— DependenciesFileParser.parseLine has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 6 (14 pts), error handling 2 (6 pts), boolean chains 2 (nesting depth added 22). 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.
NupkgWriter.nuspecDoc (cognitive 37) src/Paket.Core/Packaging/NupkgWriter.fs:54— NupkgWriter.nuspecDoc has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16, match/switch 9 (12 pts), loops 4 (9 pts) (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.
InstallModelModule.getCompileLibAssembly (cognitive 36) src/Paket.Core/PaketConfigFiles/InstallModel.fs:470— InstallModelModule.getCompileLibAssembly has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 1, match/switch 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
RemoteDownload.getSHA1OfBranch (cognitive 35) src/Paket.Core/Dependencies/RemoteDownload.fs:29— RemoteDownload.getSHA1OfBranch has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 11 (29 pts), error handling 2 (6 pts) (nesting depth added 22). 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.
UpdateProcess.SelectiveUpdate (cognitive 34) src/Paket.Core/Installation/UpdateProcess.fs:204— UpdateProcess.SelectiveUpdate has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (18 pts), loops 6 (11 pts), if/else 3, boolean chains 2 (nesting depth added 18). 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.
LockFileParser.|Remote|NugetPackage|NugetDependency|SourceFile|RepositoryType|Group|InstallOption| (cognitive 34) src/Paket.Core/PaketConfigFiles/LockFile.fs:284— LockFileParser.|Remote|NugetPackage|NugetDependency|SourceFile|RepositoryType|Group|InstallOption| has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 7 (12 pts), error handling 2 (7 pts) (nesting depth added 17). 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.
VersionRequirement.FormatInNuGetSyntax (cognitive 34) src/Paket.Core/Versioning/VersionRange.fs:326— VersionRequirement.FormatInNuGetSyntax has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 9 (24 pts), if/else 6 (10 pts) (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
InstallProcess.findPackageFolder (cognitive 33) src/Paket.Core/Installation/InstallProcess.fs:36— InstallProcess.findPackageFolder has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (9 pts), loops 1 (6 pts) (nesting depth added 20). 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.
ProjectFileModule.updateFileItems (cognitive 33) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:559— ProjectFileModule.updateFileItems has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 8 (14 pts), loops 2 (nesting depth added 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ProjectFileModule.getOutputDirectory (cognitive 33) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1637— ProjectFileModule.getOutputDirectory has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 7 (14 pts), boolean chains 1 (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.
NetUtils._safeGetFromUrl (cognitive 33) src/Paket.Core/Common/NetUtils.fs:519— NetUtils._safeGetFromUrl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, error handling 4, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackageProcess.Pack (cognitive 32) src/Paket.Core/Packaging/PackageProcess.fs:119— PackageProcess.Pack has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 15 (18 pts), if/else 8 (10 pts), loops 2 (4 pts) (nesting depth added 7). 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.
NupkgWriter.Write (cognitive 32) src/Paket.Core/Packaging/NupkgWriter.fs:265— NupkgWriter.Write has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (6 pts), match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGetV3.getPackageDetails (cognitive 32) src/Paket.Core/Dependencies/NuGetV3.fs:751— NuGetV3.getPackageDetails has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 4 (11 pts), loops 1 (3 pts) (nesting depth added 20). 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.
UpdateProcess.selectiveUpdate (cognitive 31) src/Paket.Core/Installation/UpdateProcess.fs:11— UpdateProcess.selectiveUpdate has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 12 (15 pts), if/else 5 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
DependenciesFileParser.|ParserOptions|_| (cognitive 29) src/Paket.Core/Dependencies/DependenciesFileParser.fs:304— DependenciesFileParser.|ParserOptions|_| has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 6 (12 pts), boolean chains 2 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Program.processWithValidationEx (cognitive 29) src/Paket/Program.fs:37— Program.processWithValidationEx has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 4 (7 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.
DependencyChangeDetection.findNuGetChangesInDependenciesFile (cognitive 28) src/Paket.Core/Installation/DependencyChangeDetection.fs:20— DependencyChangeDetection.findNuGetChangesInDependenciesFile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 5 (9 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LockFile.GetPackageHull (cognitive 28) src/Paket.Core/PaketConfigFiles/LockFile.fs:853— LockFile.GetPackageHull has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 3 (11 pts), error handling 1 (3 pts) (nesting depth added 17). 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.
ReferencesFile.FromLines (cognitive 28) src/Paket.Core/PaketConfigFiles/ReferencesFile.fs:40— ReferencesFile.FromLines has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGetConvert.createDependenciesFileR (cognitive 25) src/Paket.Core/PackageManagement/NugetConvert.fs:320— NuGetConvert.createDependenciesFileR has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 5, loops 2 (3 pts), error handling 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
GarbageCollection.removeOlderVersionsFromCache (cognitive 25) src/Paket.Core/Installation/GarbageCollection.fs:99— GarbageCollection.removeOlderVersionsFromCache has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (4 pts), match/switch 1 (3 pts), error handling 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGetV3.getRelevantPage (cognitive 25) src/Paket.Core/Dependencies/NuGetV3.fs:690— NuGetV3.getRelevantPage has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts), boolean chains 5, error handling 2, loops 1 (2 pts) (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.
NuGetCache.tryGetDetailsFromCache (cognitive 25) src/Paket.Core/Dependencies/NuGetCache.fs:266— NuGetCache.tryGetDetailsFromCache has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). 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.
NuGetCache.tryAndIgnoreUrl (cognitive 25) src/Paket.Core/Dependencies/NuGetCache.fs:652— NuGetCache.tryAndIgnoreUrl has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 7 (11 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
PackageResolver.calcOpenRequirements (cognitive 25) src/Paket.Core/Dependencies/PackageResolver.fs:323— PackageResolver.calcOpenRequirements has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 5 (8 pts), boolean chains 2, loops 1 (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.
CredentialProviders.callProvider (cognitive 25) src/Paket.Core/Versioning/CredentialProviders.fs:98— CredentialProviders.callProvider has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (5 pts), match/switch 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VersionRequirement.IsInRange (cognitive 25) src/Paket.Core/Versioning/VersionRange.fs:168— VersionRequirement.IsInRange has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, match/switch 6 (11 pts), if/else 2 (nesting depth added 5). 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.
NuGetCache.cleanup (cognitive 24) src/Paket.Core/Dependencies/NuGetCache.fs:180— NuGetCache.cleanup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (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.
Utils.parseKeyValuePairs (cognitive 24) src/Paket.Core/Common/Utils.fs:615— Utils.parseKeyValuePairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (3 pts), boolean chains 2, loops 2, error handling 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.
GarbageCollection.deleteUnusedPackages (cognitive 23) src/Paket.Core/Installation/GarbageCollection.fs:38— GarbageCollection.deleteUnusedPackages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, match/switch 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGet.DownloadLicense (cognitive 23) src/Paket.Core/Dependencies/NuGet.fs:274— NuGet.DownloadLicense has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGetV2.followODataLink (cognitive 23) src/Paket.Core/Dependencies/NuGetV2.fs:23— NuGetV2.followODataLink has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (8 pts) (nesting depth added 12). 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.
FrameworkRestrictionP.IsSubsetOf (cognitive 23) src/Paket.Core/Versioning/Requirements.fs:101— FrameworkRestrictionP.IsSubsetOf has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 9 (15 pts), boolean chains 5, if/else 3 (nesting depth added 6). 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.
PlatformMatching.getCondition (cognitive 23) src/Paket.Core/Versioning/PlatformMatching.fs:269— PlatformMatching.getCondition has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11 (12 pts), if/else 7 (9 pts), boolean chains 2 (nesting depth added 3). 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.
NetUtils.envProxies (cognitive 23) src/Paket.Core/Common/NetUtils.fs:68— NetUtils.envProxies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
RemoteDownload.downloadDependenciesFile (cognitive 22) src/Paket.Core/Dependencies/RemoteDownload.fs:119— RemoteDownload.downloadDependenciesFile has cognitive complexity 22 (threshold 15). Drivers by points: error handling 2 (7 pts), if/else 4 (7 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 12). 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.
InstallProcess.processContentFiles (cognitive 21) src/Paket.Core/Installation/InstallProcess.fs:88— InstallProcess.processContentFiles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 1 (3 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 5). 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.
Logging.printErrorExt (cognitive 21) src/Paket.Core/Common/Logging.fs:137— Logging.printErrorExt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 pts), boolean chains 2, match/switch 2 (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.
DependencyCache.StartSetupGroup (cognitive 20) src/Paket.Core/PaketConfigFiles/DependencyCache.fs:238— DependencyCache.StartSetupGroup has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts) (nesting depth added 12). 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.
ReferencesFile.AddNuGetReference (cognitive 20) src/Paket.Core/PaketConfigFiles/ReferencesFile.fs:133— ReferencesFile.AddNuGetReference has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (19 pts), match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
NuGetV3.getCatalogCursor (cognitive 20) src/Paket.Core/Dependencies/NuGetV3.fs:396— NuGetV3.getCatalogCursor has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 2, loops 1 (2 pts) (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.
InstallSettings.Parse (cognitive 20) src/Paket.Core/Versioning/Requirements.fs:1073— InstallSettings.Parse has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 16 (17 pts), if/else 2, loops 1 (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.
Utils.extractZipToDirectory (cognitive 20) src/Paket.Core/Common/Utils.fs:719— Utils.extractZipToDirectory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), error handling 2 (5 pts), loops 1 (2 pts) (nesting depth added 12). 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.
UpdateProcess.SmartInstall (cognitive 19) src/Paket.Core/Installation/UpdateProcess.fs:279— UpdateProcess.SmartInstall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 3 (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.
ProjectFileModule.getInterProjectDependencies (cognitive 19) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1376— ProjectFileModule.getInterProjectDependencies has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (6 pts), loops 1 (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.
NuGetV2.handleODataEntry (cognitive 19) src/Paket.Core/Dependencies/NuGetV2.fs:151— NuGetV2.handleODataEntry has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (10 pts), if/else 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 4). 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.
NuGetV2.parseFindPackagesByIDODataEntryDetails (cognitive 19) src/Paket.Core/Dependencies/NuGetV2.fs:410— NuGetV2.parseFindPackagesByIDODataEntryDetails has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
NuGetCache.CopyLicenseFromCache (cognitive 19) src/Paket.Core/Dependencies/NuGetCache.fs:536— NuGetCache.CopyLicenseFromCache has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ConfigFile.readPassword (cognitive 19) src/Paket.Core/Versioning/ConfigFile.fs:52— ConfigFile.readPassword has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ProjectFileModule.removePaketNodes (cognitive 18) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1024— ProjectFileModule.removePaketNodes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 2 (4 pts), boolean chains 3, loops 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LockFile.GetPackageHull (cognitive 18) src/Paket.Core/PaketConfigFiles/LockFile.fs:974— LockFile.GetPackageHull has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (7 pts), error handling 1 (3 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
DependenciesFileParser.parsePackage (cognitive 18) src/Paket.Core/Dependencies/DependenciesFileParser.fs:432— DependenciesFileParser.parsePackage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
NuGetCache.tryFindLocalPackage (cognitive 18) src/Paket.Core/Dependencies/NuGetCache.fs:323— NuGetCache.tryFindLocalPackage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (8 pts), boolean chains 1 (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.
FindOutdated.FindOutdated (cognitive 17) src/Paket.Core/PackageAnalysis/FindOutdated.fs:28— FindOutdated.FindOutdated has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 1 (5 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ProjectFileModule.getToolsVersion (cognitive 17) src/Paket.Core/PaketConfigFiles/ProjectFile.fs:1072— ProjectFileModule.getToolsVersion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (3 pts), error handling 1 (nesting depth added 4). 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.
TemplateFileModule.ValidateTemplate (cognitive 17) src/Paket.Core/PaketConfigFiles/TemplateFile.fs:640— TemplateFileModule.ValidateTemplate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NuGetV3.tryGetNuGetV3Resource (cognitive 17) src/Paket.Core/Dependencies/NuGetV3.fs:65— NuGetV3.tryGetNuGetV3Resource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5 (6 pts), error handling 1 (3 pts) (nesting depth added 6). 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.
Handling.checkoutToPaketFolder (cognitive 17) src/Paket.Core/Dependencies/GitHandling.fs:298— Handling.checkoutToPaketFolder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (4 pts), boolean chains 1 (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.
ConfigFile.askAndAddAuth (cognitive 17) src/Paket.Core/Versioning/ConfigFile.fs:198— ConfigFile.askAndAddAuth has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ProcessHelper.ExecProcessWithLambdas (cognitive 17) src/Paket.Core/Common/ProcessHelper.fs:125— ProcessHelper.ExecProcessWithLambdas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 2 (4 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.
Why.ohWhy (cognitive 16) src/Paket.Core/PackageAnalysis/Why.fs:160— Why.ohWhy has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 2 (6 pts), loops 1 (3 pts) (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.
DependenciesFileParser.parseVersionRequirement (cognitive 16) src/Paket.Core/Dependencies/DependenciesFileParser.fs:47— DependenciesFileParser.parseVersionRequirement has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 2, error handling 1 (nesting depth added 7). 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.
PackageSource.Parse (cognitive 16) src/Paket.Core/Versioning/PackageSources.fs:175— PackageSource.Parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 pts), boolean chains 1 (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.
SemVerInfo.CompareTo (cognitive 16) src/Paket.Core/Versioning/SemVer.fs:166— SemVerInfo.CompareTo has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (15 pts), boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TooManyFunctions: NetUtils src/Paket.Core/Common/NetUtils.fs:3— TooManyFunctions — 35 functions. The bar is 30 functions; this is 5 over it, 1.17× 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.
Duplicated block (24 lines × 2) src/Paket.Core/Versioning/FrameworkHandling.fs:87— src/Paket.Core/Versioning/FrameworkHandling.fs:87-110 | src/Paket.Core/Versioning/FrameworkHandling.fs:157-180 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23–24 lines × 2) src/Paket.Core/Versioning/Requirements.fs:174— src/Paket.Core/Versioning/Requirements.fs:174-197 | src/Paket.Core/Versioning/Requirements.fs:199-221 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:702— src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:702-720 | src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:729-747 — 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 (15 lines × 3) src/Paket.Core/Versioning/FrameworkHandling.fs:222— src/Paket.Core/Versioning/FrameworkHandling.fs:222-236 | src/Paket.Core/Versioning/FrameworkHandling.fs:247-261 | src/Paket.Core/Versioning/FrameworkHandling.fs:272-286 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Paket.Core/Versioning/FrameworkHandling.fs:222` 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 × 3) src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:441— src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:441-451 | src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:465-475 | src/Paket.Core/PaketConfigFiles/DependenciesFile.fs:489-499 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 2) src/Paket.Core/Versioning/Requirements.fs:24— src/Paket.Core/Versioning/Requirements.fs:24-32 | src/Paket.Core/Versioning/Requirements.fs:40-48 — 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/Paket.Core/PackageAnalysis/Queries.fs:11— src/Paket.Core/PackageAnalysis/Queries.fs:11-16 | src/Paket.Core/PublicAPI.fs:16-21 — 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.
D8 · Code Coverage· No test project references BuiltWithSymbols · ×1
No test project references BuiltWithSymbols integrationtests/scenarios/i002788-pack-with-include-pdbs-true/before/BuiltWithSymbols/BuiltWithSymbols.csproj— No test project in this repository references BuiltWithSymbols (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references ConvertFromNugetWithAnalyzers · ×1
No test project references ConvertFromNugetWithAnalyzers integrationtests/scenarios/i001922-convert-nuget-with-analyzers/before/ConvertFromNugetWithAnalyzers/ConvertFromNugetWithAnalyzers.csproj— No test project in this repository references ConvertFromNugetWithAnalyzers (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Analyzer · ×1
No test project references Analyzer integrationtests/scenarios/i003164-pack-analyzer/before/Analyzer/Analyzer.csproj— No test project in this repository references Analyzer (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references ConfigurationDependent · ×1
No test project references ConfigurationDependent integrationtests/scenarios/i002394-group-conditions/before/TestProjects/ConfigurationDependent.fsproj— No test project in this repository references ConfigurationDependent (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references FixedProperty · ×1
No test project references FixedProperty integrationtests/scenarios/i002394-group-conditions/before/TestProjects/FixedProperty.fsproj— No test project in this repository references FixedProperty (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references FsLex.Core · ×1
No test project references FsLex.Core integrationtests/scenarios/p003983-dont-remove-packed-projects/before/FsLex.Core/FsLex.Core.fsproj— No test project in this repository references FsLex.Core (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references FsLexYacc.Runtime · ×1
No test project references FsLexYacc.Runtime integrationtests/scenarios/p003983-dont-remove-packed-projects/before/FsLexYacc.Runtime/FsLexYacc.Runtime.fsproj— No test project in this repository references FsLexYacc.Runtime (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references LockFileComparer · ×1
No test project references LockFileComparer src/LockFileComparer/LockFileComparer.fsproj— No test project in this repository references LockFileComparer (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references MainGroup · ×1
No test project references MainGroup integrationtests/scenarios/i002394-group-conditions/before/TestProjects/MainGroup.fsproj— No test project in this repository references MainGroup (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references MixedProperties · ×1
No test project references MixedProperties integrationtests/scenarios/i002394-group-conditions/before/TestProjects/MixedProperties.fsproj— No test project in this repository references MixedProperties (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references NonConditionalGroup · ×1
No test project references NonConditionalGroup integrationtests/scenarios/i002394-group-conditions/before/TestProjects/NonConditionalGroup.fsproj— No test project in this repository references NonConditionalGroup (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Paket.LegacyStub · ×1
No test project references Paket.LegacyStub src/Paket.LegacyStub/Paket.LegacyStub.csproj— No test project in this repository references Paket.LegacyStub (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references PaketTest2394.PackageA · ×1
No test project references PaketTest2394.PackageA integrationtests/scenarios/i002394-group-conditions/before/Packages/PaketTest2394.PackageA/PaketTest2394.PackageA.csproj— No test project in this repository references PaketTest2394.PackageA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references PaketTest2394.PackageB · ×1
No test project references PaketTest2394.PackageB integrationtests/scenarios/i002394-group-conditions/before/Packages/PaketTest2394.PackageB/PaketTest2394.PackageB.csproj— No test project in this repository references PaketTest2394.PackageB (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references PaketTest2394.PackageB.Transient · ×1
No test project references PaketTest2394.PackageB.Transient integrationtests/scenarios/i002394-group-conditions/before/Packages/PaketTest2394.PackageB.Transient/PaketTest2394.PackageB.Transient.csproj— No test project in this repository references PaketTest2394.PackageB.Transient (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references ProjectA · ×1
No test project references ProjectA integrationtests/scenarios/i002765-evaluate-only-single-template/before/ProjectA/ProjectA.csproj— No test project in this repository references ProjectA (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references ProjectB · ×1
No test project references ProjectB integrationtests/scenarios/i002765-evaluate-only-single-template/before/ProjectB/ProjectB.csproj— No test project in this repository references ProjectB (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references c1 · ×1
No test project references c1 integrationtests/scenarios/i003000-netcoreapp2/before/c1/c1.csproj— No test project in this repository references c1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references l1 · ×1
No test project references l1 integrationtests/scenarios/i004003-pack-global-tools-p2p/before/l1/l1.csproj— No test project in this repository references l1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references library · ×1
No test project references library integrationtests/scenarios/i002694/before/library/library.csproj— No test project in this repository references library (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references libsym1 · ×1
No test project references libsym1 integrationtests/scenarios/i004367-pack-include-symbols/before/libsym1.csproj— No test project in this repository references libsym1 (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
Sync-over-async blocking src/Paket.Core/Dependencies/RemoteDownload.fs:279— `downloadRemoteFiles` is async and calls Async.RunSynchronously — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs.
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.
redundant comment integrationtests/scenarios/i001816-pack-localized-happy-path/before/LocalizedLib/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-happy-path/before/LocalizedLib/Properties/AssemblyInfo.cs:17— "Setting ComVisible to false makes the types in this assembly not visible to COM components. If you need to access a type in this assembly from COM, set the ComV …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-happy-path/before/LocalizedLib/Properties/AssemblyInfo.cs:22— "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-happy-path/before/LocalizedLib/Properties/AssemblyInfo.cs:25— "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-missing-dll/before/LocalizedLib/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-missing-dll/before/LocalizedLib/Properties/AssemblyInfo.cs:17— "Setting ComVisible to false makes the types in this assembly not visible to COM components. If you need to access a type in this assembly from COM, set the ComV …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-missing-dll/before/LocalizedLib/Properties/AssemblyInfo.cs:22— "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001816-pack-localized-missing-dll/before/LocalizedLib/Properties/AssemblyInfo.cs:25— "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectA/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectA/Properties/AssemblyInfo.cs:17— "Setting ComVisible to false makes the types in this assembly not visible to COM components. If you need to access a type in this assembly from COM, set the ComV …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectA/Properties/AssemblyInfo.cs:22— "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectA/Properties/AssemblyInfo.cs:25— "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectB/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectB/Properties/AssemblyInfo.cs:17— "Setting ComVisible to false makes the types in this assembly not visible to COM components. If you need to access a type in this assembly from COM, set the ComV …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectB/Properties/AssemblyInfo.cs:22— "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-with-incl-flag/before/projectB/Properties/AssemblyInfo.cs:25— "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectA/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectA/Properties/AssemblyInfo.cs:17— "Setting ComVisible to false makes the types in this assembly not visible to COM components. If you need to access a type in this assembly from COM, set the ComV …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectA/Properties/AssemblyInfo.cs:22— "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectA/Properties/AssemblyInfo.cs:25— "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectB/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectB/Properties/AssemblyInfo.cs:17— "Setting ComVisible to false makes the types in this assembly not visible to COM components. If you need to access a type in this assembly from COM, set the ComV …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectB/Properties/AssemblyInfo.cs:22— "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-all-templates-wo-incl-flag/before/projectB/Properties/AssemblyInfo.cs:25— "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment integrationtests/scenarios/i001848-pack-single-template-with-incl-flag/before/projectA/Properties/AssemblyInfo.cs:5— "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
Orphaned file src/Paket.Core/Installation/DependencyChangeDetection.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/Paket.Core/PaketConfigFiles/ReferencesFile.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/Paket.Core/PaketConfigFiles/RuntimeGraph.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/Paket.Core/Common/Async.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/Paket.Core/Versioning/CredentialProviders.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/Paket.Core/Dependencies/Nuspec.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/Paket.Core/Installation/BindingRedirects.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/Paket.Core/PackageAnalysis/Why.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/Paket.Core/PackageManagement/AddProcess.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/Paket.Core/Common/Domain.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/Paket.Core/Installation/GarbageCollection.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/Paket.Core/PaketConfigFiles/LocalFile.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/Paket.Core/Common/Encryption.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/Paket.Core/PackageAnalysis/Environment.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/Paket.Core/PackageManagement/RemoveProcess.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/Paket.Core/PackageAnalysis/FindOutdated.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 integrationtests/scenarios/i001746-hard-legacy/before/SilverlightClassLibrary1/Program.cs: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/Paket.Core/Common/Profile.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.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×2
Projects may be oversized for their cohesion src/Paket.LegacyStub/Paket.LegacyStub.csproj:1— `Paket.LegacyStub` overshoots its size bounds (16 LoC, 585 public types across 283 namespaces). 2 of 50 project(s) overshoot their size bounds, lowering Project Cohesion to 9.2/10. Size alone is no reason to split a project: where its type references show a separable part, a Split row names it.
Projects may be oversized for their cohesion integrationtests/scenarios/i002694/before/console/console.csproj:1— `console` overshoots its size bounds (11 LoC, 585 public types across 283 namespaces). 2 of 50 project(s) overshoot their size bounds, lowering Project Cohesion to 9.2/10. Size alone is no reason to split a project: where its type references show a separable part, a Split row names it.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 19 significant file(s) lose their only recent owner: src/Paket.Core/Dependencies/NuGet.fs, src/Paket/Program.fs, src/Paket.Core/Packaging/PackageMetaData.fs, src/Paket/Commands.fs, src/Paket.Core/PackageManagement/NugetConvert.fs, src/Paket.Core/Common/NetUtils.fs, src/Paket.Core/Packaging/NupkgWriter.fs, src/FSharp.DependencyManager.Paket/ReferenceLoading.PaketHandler.fs (+11 more). Pair on, review, or document these before any departure.
No ADRs found src/Paket.LegacyStub/Paket.LegacyStub.csproj:10— No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `src/Paket.LegacyStub/Paket.LegacyStub.csproj` makes this repository a deployable product (line 10).
D28 · Secrets (history)· Rotate the exposed credentials · ×1
REDACTED
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 18 of 65 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 65 of the 279 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: src/Paket.Core/Installation/DependencyChangeDetection.fs, src/Paket.Core/PaketConfigFiles/ReferencesFile.fs, src/Paket.Core/Common/Domain.fs, src/Paket.Core/PaketConfigFiles/RuntimeGraph.fs, src/Paket.Core/Common/Async.fs, src/Paket.Core/Versioning/CredentialProviders.fs, src/Paket.Core/Dependencies/Nuspec.fs, src/Paket.Core/Installation/BindingRedirects.fs (and 10 more). 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.
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.
No SAST REDACTED:9— No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No dependency-update automation integrationtests/Directory.Build.props:8— `integrationtests/Directory.Build.props` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
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.
Nullable reference types not enabled everywhere — 1/2 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
Off the main sequence: MyProj.Common(netstandard2.0) (integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Common) integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Common/MyProj.Common.csproj:1— MyProj.Common(netstandard2.0) (integrationtests/scenarios/i003317-pack-multitarget-with-p2p/before/MyProj.Common): abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
Off the main sequence: MyProj.Common(netstandard2.0) (integrationtests/scenarios/i003558-pack-multitarget-with-p2p-by-tfm/before/MyProj.Common) integrationtests/scenarios/i003558-pack-multitarget-with-p2p-by-tfm/before/MyProj.Common/MyProj.Common.csproj:1— MyProj.Common(netstandard2.0) (integrationtests/scenarios/i003558-pack-multitarget-with-p2p-by-tfm/before/MyProj.Common): abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
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.
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
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1da26-8ea6-7128-9bfe-a89e6cd6bbbc · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 27 · Warnings: 333 · Recommendations: 93 · Info: 2 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 14-11-2026 @ 13:02 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.