Public report of fsprojects/FSharpx.Collections, published 13 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.3). 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, 13 November 2026, 10:31 UTC · Survey ID cd_9aded722c3814d82957b4f665a28e93e

fsprojects/FSharpx.Collections

Measured 13 November 2026, 10:31 UTC, at code version 56575b6

Code coverage is not measured: .NET and JavaScript/TypeScript suite (CouldNotMeasureNoCollector, CouldNotMeasureNoCollector).

CAI score 51out of 100 Adequate
CriticalWeakAdequateStrongExemplary
No change since the last survey

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

A small codebase: 13,749 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Production Readiness, 41

Findings by how serious they are

12 critical 121 serious 96 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
13 November 2026, 10:31 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 ▸

38of 38 dimensions measured by tools.
149of 229 findings point to an exact file and line, so you can open each one in the code. The other 80 concern the repository as a whole, such as missing documentation.
38dimensions across 5 lenses, read from 13,749 lines of product code in 1 project.
Chapters

Executive summary

fsprojects/FSharpx.Collections falls short of our standard for production because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 51 out of 100 and is rated Adequate, and eight of its 12 critical findings are security problems in the build pipeline and in its code.

Production Readiness, at 41, is the weakest lens and counts most in the score. The best first step is updating the outdated dependencies, worth about 8 points. Adding a diagnostic log would lift Production Readiness itself, also worth about 8. Raising Production Readiness to 70 would lift the score to about 60.

Four pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One weakness in the code could be used by an attacker, and three parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, fixing the weaknesses the scanner points to and having someone learn the forgotten files would close these risks. Correcting the flagged pipeline settings would fix the three weaknesses in the build pipeline's configuration.

The product code is 13,749 lines, about €34,000 to rebuild.

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

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

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

Code composition: what the lines of code are
Supporting code 0%Tests 100%
New since the last survey: 3 findings

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

  • Code Duplication · Edited copies of one member (3 members, 77+ corresponding lines) src/FSharpx.Collections.Experimental/EagerRoseTree.fs
  • Code Duplication · Duplicated block (11 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Knowledge Freshness · Orphaned knowledge src/FSharpx.Collections/RandomAccessList.fs

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

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

  • Code Duplication · Duplicated block (32 lines × 2) src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs
  • Code Duplication · Duplicated block (26–27 lines × 4) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Code Duplication · Duplicated block (19 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Code Duplication · Duplicated block (11 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/FSharpx.Collections.Experimental/IntMap.fs
  • Dependency Hygiene · Vulnerable: NuGet.Packaging
  • Dependency Hygiene · Vulnerable: NuGet.Protocol
  • Dependency Hygiene · Vulnerable: System.Security.Cryptography.Pkcs
  • Knowledge Freshness · Orphaned knowledge src/FSharpx.Collections/Collections.fs
Rebuild cost: about €34,000 · Estimate
Cost to rebuild€11,000 to €56,000, for 187 to 592 hours of work, about 0.2 person-years for one engineer
Difficulty of the problemLow, 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 51. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeSmall: 13,749 lines of product code
Comment linesThe estimate prices 13,729 lines. Comment lines count towards the size of 13,749 lines but aren't priced as work.
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 7 Outdated finding(s) in Dependency Hygiene — start with csharp.csproj.
Raises the score by about 8 points · Low effort · Dependency Hygiene
2
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability.
Raises the score by about 8 points · Low effort · Test Reliability
3
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with csharp.csproj.
Raises the score by about 4 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 €34,000 to build again, about 0.2 person-years of work. Its weakest lens is Production Readiness, at 41 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 7 Outdated finding(s) in Dependency Hygiene. Of all the actions in this report, it raises the score most for the work it takes: about 8 points for low effort, because it clears the 7 Dependency Hygiene findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — module dependency graph

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

arch FSharpx.Collections Collections FSharpx.Collections.Experimental Experimental FSharpx.Collections.Experimental->FSharpx.Collections FSharpx.Collections.Tests (tests/FSharpx.Collections.Tests) Tests) FSharpx.Collections.Tests (tests/FSharpx.Collections.Tests)->FSharpx.Collections FSharpx.Collections.Tests (tests/fable/FSharpx.Collections.Tests) Tests) FSharpx.Collections.Tests (tests/fable/FSharpx.Collections.Tests)->FSharpx.Collections build build csharp csharp csharp->FSharpx.Collections csharp->FSharpx.Collections.Experimental

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.

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

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 Collections2 Collections.Tagged3 Collections.ByteStringModule4 Collections.DList5 Collections.Deque6 Collections.Experimental7 Collections.Experimental.HeapPriorityQueue8 Collections.Experimental.AltBinaryRandomAccessList9 Collections.Experimental.BKTree10 Collections.Experimental.BankersDeque11 Collections.Experimental.BankersQueue12 Collections.Experimental.BatchedDeque13 Collections.Experimental.BatchedQueue14 Collections.Experimental.BinaryRandomAccessList15 Collections.Experimental.BinaryRoseTree16 Collections.Experimental.BinaryTreeZipper17 Collections.Experimental.BinomialHeap18 Collections.Experimental.BlockResizeArray19 Collections.Experimental.BootstrappedQueue20 Collections.Experimental.ChampHashMap21 Collections.Experimental.DList22 Collections.Experimental.Deque23 Collections.Experimental.EagerRoseTree24 Collections.Experimental.FlatList25 Collections.Experimental.HoodMelvilleQueue26 Collections.Experimental.ImplicitQueue27 Collections.Experimental.IndexedRoseTree28 Collections.Experimental.IntMap29 Collections.Experimental.LeftistHeap30 Collections.Experimental.ListZipper31 Collections.Experimental.Node32 Collections.Experimental.PairingHeap33 Collections.Experimental.PhysicistQueue34 Collections.Experimental.RealTimeDeque35 Collections.Experimental.RealTimeQueue36 Collections.Experimental.RingBuffer37 Collections.Experimental.RoseTreeModule38 Collections.Experimental.SBHTree39 Collections.Experimental.SBHTreeRoot40 Collections.Experimental.SkewBinaryRandomAccessList
1 Collections
2 Collections.Tagged
3 Collections.ByteStringModule1
4 Collections.DList1
5 Collections.Deque1
6 Collections.Experimental10
7 Collections.Experimental.HeapPriorityQueue1
8 Collections.Experimental.AltBinaryRandomAccessList1
9 Collections.Experimental.BKTree13
10 Collections.Experimental.BankersDeque1
11 Collections.Experimental.BankersQueue1
12 Collections.Experimental.BatchedDeque1
13 Collections.Experimental.BatchedQueue1
14 Collections.Experimental.BinaryRandomAccessList1
15 Collections.Experimental.BinaryRoseTree1
16 Collections.Experimental.BinaryTreeZipper2
17 Collections.Experimental.BinomialHeap1
18 Collections.Experimental.BlockResizeArray1
19 Collections.Experimental.BootstrappedQueue1
20 Collections.Experimental.ChampHashMap2
21 Collections.Experimental.DList1
22 Collections.Experimental.Deque1
23 Collections.Experimental.EagerRoseTree1
24 Collections.Experimental.FlatList1
25 Collections.Experimental.HoodMelvilleQueue1
26 Collections.Experimental.ImplicitQueue1
27 Collections.Experimental.IndexedRoseTree11
28 Collections.Experimental.IntMap1
29 Collections.Experimental.LeftistHeap1
30 Collections.Experimental.ListZipper1
31 Collections.Experimental.Node2
32 Collections.Experimental.PairingHeap1
33 Collections.Experimental.PhysicistQueue1
34 Collections.Experimental.RealTimeDeque1
35 Collections.Experimental.RealTimeQueue11
36 Collections.Experimental.RingBuffer1
37 Collections.Experimental.RoseTreeModule11
38 Collections.Experimental.SBHTree1
39 Collections.Experimental.SBHTreeRoot2
40 Collections.Experimental.SkewBinaryRandomAccessList1
Uses a module listed above itPart of a loopThe module itself
1 Collections2 Collections.Tagged3 Collections.ByteStringModule4 Collections.DList5 Collections.Deque6 Collections.Experimental7 Collections.Experimental.HeapPriorityQueue8 Collections.Experimental.AltBinaryRandomAccessList9 Collections.Experimental.BKTree10 Collections.Experimental.BankersDeque11 Collections.Experimental.BankersQueue12 Collections.Experimental.BatchedDeque13 Collections.Experimental.BatchedQueue14 Collections.Experimental.BinaryRandomAccessList15 Collections.Experimental.BinaryRoseTree16 Collections.Experimental.BinaryTreeZipper17 Collections.Experimental.BinomialHeap18 Collections.Experimental.BlockResizeArray19 Collections.Experimental.BootstrappedQueue20 Collections.Experimental.ChampHashMap21 Collections.Experimental.DList22 Collections.Experimental.Deque23 Collections.Experimental.EagerRoseTree24 Collections.Experimental.FlatList25 Collections.Experimental.HoodMelvilleQueue26 Collections.Experimental.ImplicitQueue27 Collections.Experimental.IndexedRoseTree28 Collections.Experimental.IntMap29 Collections.Experimental.LeftistHeap30 Collections.Experimental.ListZipper31 Collections.Experimental.Node32 Collections.Experimental.PairingHeap33 Collections.Experimental.PhysicistQueue34 Collections.Experimental.RealTimeDeque35 Collections.Experimental.RealTimeQueue36 Collections.Experimental.RingBuffer37 Collections.Experimental.RoseTreeModule38 Collections.Experimental.SBHTree39 Collections.Experimental.SBHTreeRoot40 Collections.Experimental.SkewBinaryRandomAccessListCollections1Collections.Tagged2Collections.ByteStringModule3Collections.DList4Collections.Deque5Collections.Experimental6Collections.Experimental.HeapPriorityQueue7Collections.Experimental.AltBinaryRandomAccessList8Collections.Experimental.BKTree9Collections.Experimental.BankersDeque10Collections.Experimental.BankersQueue11Collections.Experimental.BatchedDeque12Collections.Experimental.BatchedQueue13Collections.Experimental.BinaryRandomAccessList14Collections.Experimental.BinaryRoseTree15Collections.Experimental.BinaryTreeZipper16Collections.Experimental.BinomialHeap17Collections.Experimental.BlockResizeArray18Collections.Experimental.BootstrappedQueue19Collections.Experimental.ChampHashMap20Collections.Experimental.DList21Collections.Experimental.Deque22Collections.Experimental.EagerRoseTree23Collections.Experimental.FlatList24Collections.Experimental.HoodMelvilleQueue25Collections.Experimental.ImplicitQueue26Collections.Experimental.IndexedRoseTree27Collections.Experimental.IntMap28Collections.Experimental.LeftistHeap29Collections.Experimental.ListZipper30Collections.Experimental.Node31Collections.Experimental.PairingHeap32Collections.Experimental.PhysicistQueue33Collections.Experimental.RealTimeDeque34Collections.Experimental.RealTimeQueue35Collections.Experimental.RingBuffer36Collections.Experimental.RoseTreeModule37Collections.Experimental.SBHTree38Collections.Experimental.SBHTreeRoot39Collections.Experimental.SkewBinaryRandomAccessList401111011131111112111211111111111211111111121+32 more modules (most-connected shown)

At a glance — Code Health · 57% · Adequate · gated by X5 ·

At a glance — Architecture · 100% · Exemplary ·

At a glance — Maturity · 55% · Adequate · gated by D34, M2 ·

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

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

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection8High / Critical
A03:2025 — Software Supply Chain Failures7Medium

Roadmap

Top priorities: Resolve the 7 Outdated finding(s) in Dependency Hygiene — start with csharp.csproj; Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability; Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.

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

Do thisHelpsEffortDimension
Resolve the 7 Outdated finding(s) in Dependency Hygiene — start with csharp.csproj.+8.1 ptsLowDependency Hygiene
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability.+7.9 ptsLowTest Reliability
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with csharp.csproj.+4.1 ptsLowADR Quality
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+7.6 ptsMediumObservability
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.+3.2 ptsMediumDeployment & Rollback
Resolve the 1 Deprecated finding(s) in Dependency Hygiene.+1.5 ptsLowDependency Hygiene
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.+2.7 ptsMediumNullable reference types
Resolve the 16 Orphaned file finding(s) in Knowledge Freshness — start with DList.fs (2), BatchedDeque.fs, ChampHashMap.fs.+2.2 ptsMediumKnowledge Freshness

File quality

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

FileScoreBandWorst signal
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
src/FSharpx.Collections.Experimental/IntMap.fs7.0MixedCyclomatic Complexity: IntMap.mergeWithKey' (cyclomatic 27)
src/FSharpx.Collections/PersistentHashMap.fs7.0MixedCognitive Complexity: BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 41)
src/FSharpx.Collections.Experimental/BankersDeque.fs7.0MixedGod Classes: TooManyFunctions: BankersDeque
src/FSharpx.Collections.Experimental/BatchedDeque.fs7.0MixedCode Duplication: Duplicated block (74–75 lines × 2)
src/FSharpx.Collections/TaggedCollections.fs7.0MixedCognitive Complexity: SetTree.rebalance (cognitive 28)
src/FSharpx.Collections/PersistentVector.fs7.0MixedGod Classes: FileTooLong: FSharpx.Collections/PersistentVector.fs
src/FSharpx.Collections/DList.fs7.1MixedGod Classes: TooManyFunctions: DList
src/FSharpx.Collections.Experimental/ChampHashMap.fs7.4MixedCyclomatic Complexity: Node.remove (cyclomatic 17)
src/FSharpx.Collections.Experimental/BinomialHeap.fs7.4MixedGod Classes: TooManyMethods: BinomialHeap`1
src/FSharpx.Collections/Deque.fs7.4MixedGod Classes: TooManyFunctions: Deque
src/FSharpx.Collections/RandomAccessList.fs7.4MixedGod Classes: TooManyFunctions: RandomAccessList
src/FSharpx.Collections.Experimental/Deque.fs7.4MixedCode Duplication: Duplicated block (7 lines × 2)
src/FSharpx.Collections.Experimental/RealTimeDeque.fs7.8MixedGod Classes: FileTooLong: FSharpx.Collections.Experimental/RealTimeDeque.fs
src/FSharpx.Collections.Experimental/LeftistHeap.fs8.5Near-cleanCognitive Complexity: LeftistHeap`1.merge (cognitive 18)
src/FSharpx.Collections/ResizeArray.fs8.5Near-cleanGod Classes: TooManyFunctions: ResizeArray
src/FSharpx.Collections/NonEmptyList.fs8.5Near-cleanGod Classes: TooManyFunctions: NonEmptyList
src/FSharpx.Collections/LazyList.fs8.5Near-cleanGod Classes: TooManyFunctions: LazyList
src/FSharpx.Collections/Collections.fs8.5Near-cleanGod Classes: FileTooLong: FSharpx.Collections/Collections.fs

How the grades work

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

Critical — 12

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

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

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

Could not be resolved — 3

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 38 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 — 38 dimensions across the health lenses
D1D2D3D4D5D6D11D12D13D14D15D16D17D20D27D28D29D30D34D35D36D43D44AX10AX3AX4AX5GD1M1M2M3M4P1P2P3P4P6X5

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

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1d475-f79d-7115-8b9a-e07bfe1791f4.

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

Run transparency — what happened this run

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

  • D12 Dependency Hygiene — 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 repository declares npm dependencies as well as NuGet ones — manifest: tests/fable/package.json — and the counts on this row cover the NuGet side ONLY. This dimension reads dependency currency from `<PackageReference>` elements via `dotnet list package`; it does not read it, so the npm packages declared there were not checked for newer, deprecated or unmaintained releases. Their absence from the counts above is a gap in this analyzer's ecosystem coverage — not a finding that those dependencies are current.
  • 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 'src/FSharpx.Collections/FSharpx.Collections.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 (13,661 lines, 99% 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.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • 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. `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan. 2 of 3 declared ecosystem(s) (npm,osv) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
  • 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.

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

Dimensions

D1 · Cyclomatic Complexity9.2 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

2 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was IntMap.mergeWithKey' at 27. A further 1 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being IntMap.submapCmp at 18 — they are counted neither in the figure above nor in this dimension's score.

IntMap.mergeWithKey' (cyclomatic 27)src/FSharpx.Collections.Experimental/IntMap.fs:333
Node.remove (cyclomatic 17)src/FSharpx.Collections.Experimental/ChampHashMap.fs:212

What to do

  1. Bring the 2 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with IntMap.mergeWithKey' (cyclomatic 27), Node.remove (cyclomatic 17). — 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 2 together lifts Cyclomatic Complexity from 9.2 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

D2 · Cognitive Complexity8.2 / 10Strong✓ Tool-verified

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

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

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

9 method(s) exceeded the cognitive complexity threshold of 15; the worst was BitmapIndexedNode.FSharpx.Collections.INode.assoc at 41.

BitmapIndexedNode.FSharpx.Collections.INode.without (cognitive 24) · ×2src/FSharpx.Collections/PersistentHashMap.fs:646
BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 41)src/FSharpx.Collections/PersistentHashMap.fs:569
BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 34)src/FSharpx.Collections/PersistentHashMap.fs:500
SetTree.rebalance (cognitive 28)src/FSharpx.Collections/TaggedCollections.fs:71
MapTree.rebalance (cognitive 28)src/FSharpx.Collections/TaggedCollections.fs:847

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

What to do

  1. Bring the 9 bodies over 15 down to 15 or less in Cognitive Complexity — start with BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 41), BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 34), SetTree.rebalance (cognitive 28). — 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 9 together lifts Cognitive Complexity from 8.2 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

D3 · God Classes4.9 / 10Weak✓ Tool-verified

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

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

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

20 god class(es) detected.

TooManyFunctions: ResizeArray · ×10src/FSharpx.Collections/ResizeArray.fs:11
FileTooLong: FSharpx.Collections/TaggedCollections.fs · ×6src/FSharpx.Collections/TaggedCollections.fs
TooManyMethods: BinomialHeap`1 · ×4src/FSharpx.Collections.Experimental/BinomialHeap.fs:14

What to do

  1. Resolve the 10 TooManyFunctions finding(s) in God Classes — start with TaggedCollections.fs (2), ResizeArray.fs, NonEmptyList.fs. — One of this dimension's main actionable groups (10 warning-level).
  2. Resolve the 6 FileTooLong finding(s) in God Classes — start with TaggedCollections.fs, PersistentHashMap.fs, IntMap.fs. — One of this dimension's main actionable groups (6 warning-level).
  3. Resolve the 4 TooManyMethods finding(s) in God Classes — start with TaggedCollections.fs (2), BinomialHeap.fs, SkewBinomialHeap.fs. — One of this dimension's main actionable groups (4 warning-level).

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

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

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

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

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

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

Duplicated block (7 lines × 2) · ×7src/FSharpx.Collections.Experimental/BatchedDeque.fs:275
Duplicated block (5 lines × 2) · ×7src/FSharpx.Collections.Experimental/Deque.fs:164
Duplicated block (13 lines × 2) · ×6src/FSharpx.Collections.Experimental/BankersDeque.fs:246
Duplicated block (12 lines × 2) · ×6src/FSharpx.Collections.Experimental/BatchedDeque.fs:54
Duplicated block (9 lines × 4) · ×5src/FSharpx.Collections.Experimental/BankersDeque.fs:217

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

What to do

  1. Resolve the 7 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with Deque.fs (2), IntMap.fs (2), BatchedDeque.fs. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 7 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Deque.fs (2), BankersDeque.fs (2), IntMap.fs (2). — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 6 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with BankersDeque.fs (2), BatchedDeque.fs, BatchedQueue.fs. — One of this dimension's main actionable groups (6 warning-level).

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

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

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

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

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

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

0 of 18 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D11 · Test Reliability10.0 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether the tests pass reliably, with no flakiness.

Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.

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

0 flaky across 2 measured tier(s). unit: measured (0 flaky); JavaScript/TypeScript (mocha via `yarn install --frozen-lockfile --ignore-scripts` in tests/fable/ (0 tests)): measured (0 flaky).

Test suite declares a test script but contains no test files: tests/fable/

What to do

  1. Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability. — One of this dimension's main actionable groups (1 issue-level).

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

D12 · Dependency Hygiene7.5 / 10Strong✓ Tool-verified

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

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

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

65 outdated, 3 vulnerable, 1 deprecated packages. NuGet only — this repository also declares npm dependencies, which are not read for currency here.

Deprecated: System.Collections.Immutable
Outdated: FSharp.Core · ×7
Outdated: FsCheck · ×58

What to do

  1. Resolve the 7 Outdated finding(s) in Dependency Hygiene — start with csharp.csproj. — One of this dimension's main actionable groups (7 recommendation-level).
  2. Resolve the 1 Deprecated finding(s) in Dependency Hygiene. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

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

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

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

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D16 · Bus Factor9.2 / 10Exemplary✓ Tool-verified

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

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

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

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

Off-boarding risk: anonymized user #1

✓ On the Gold path — maintain.

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

D17 · Explicit Debt10.0 / 10Exemplary○ Nothing flagged

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

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

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

0 deducted debt markers + unmeasured dead symbols across 88 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 (99% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

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.

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

No architecture decision records were found.

No ADRs founddocs/csharp/csharp.csproj:4

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with csharp.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.

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

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

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

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

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

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

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

REDACTED
REDACTED
REDACTED

What to do

  1. 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).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 4 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 (4 issue-level, 0 of them charged here).

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

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

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

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

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

No known-vulnerable dependencies in the 2 ecosystem(s) that were scanned (npm,osv). Partial dependency scan: 2 of 3 declared ecosystem(s) were scanned (npm,osv), and the findings above are real and complete for them. nuget was not scanned (nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan), so this is not the whole dependency surface and the result is reported at reduced confidence.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

D34 · Knowledge Freshness2.1 / 10Critical✓ Tool-verified

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

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

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

19 of 24 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/FSharpx.Collections/TaggedCollections.fs. Counted over 24 of the 34 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledge · ×3src/FSharpx.Collections/TaggedCollections.fs:1
Orphaned file · ×16src/FSharpx.Collections.Experimental/BatchedDeque.fs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 16 Orphaned file finding(s) in Knowledge Freshness — start with DList.fs (2), BatchedDeque.fs, ChampHashMap.fs. — One of this dimension's main actionable groups (16 recommendation-level).
  2. Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with TaggedCollections.fs, IntMap.fs, RandomAccessList.fs. — One of this dimension's main actionable groups (3 issue-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

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

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

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

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

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

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

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

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

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

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

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

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

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

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

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

GD1 · Unfinished & placeholder code9.9 / 10Exemplary✓ Tool-verified

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.

  • A shipped binding's whole body still raises a "not implemented" error — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/FSharpx.Collections/Collections.fs:824

What to do

  • Finish or delete NotImplementedException stubs and replace placeholder literals before shipping.
M1 · Documentation (README)4.7 / 10Weak✓ Tool-verified

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

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

  • The root README is 105 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise — or with no heading at all — is not seen and this row may understate what the document covers. — README.md:1

What to do

  • Expand the README with getting-started, architecture overview and a project map.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

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

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

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

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

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

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

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

What to do

  • Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add `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 2 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:5
  • `docs/csharp/csharp.csproj` 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`. — docs/csharp/csharp.csproj:16

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.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

What to do

  • 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.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

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.

  • 0/1 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 `!`.

Reference — by lens

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

LensScoreRatingImpact
Code Health57%Adequate — gated by X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture100%ExemplaryStrongest area.
Maturity55%Adequate — gated by D34, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness41%Weak — gated by P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security60%Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 2 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.
  • X10 Duplicated predicate — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
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 — 75 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — 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 — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • D10 Test Quality — ~28168 lines of test source are present (.fs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • 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.
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; F# not measured.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — small single-context codebase (13,749 production LoC in the .NET projects) — bounded contexts are not needed at this size No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .fs source were not judged.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — This repository is one project, `csharp` (88 LoC, 0 public types across 0 namespaces), within the size bounds. Not scored: a single unit of this size gives project cohesion nothing to grade.
  • 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
  • D8 Code Coverage — Coverage NOT MEASURED: the .NET half could not be measured — the repository wires up no coverage collector for `--collect:"XPlat Code Coverage"` to use; the JavaScript/TypeScript half could not be measured — tests/fable/ runs mocha but declares no coverage provider, so the suite can run and still produce no lcov — add `c8` (or `nyc`) as a devDependency so the suite can be wrapped for coverage. This repository's production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (13 value object(s))
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — IC1 reached only 1% of this repository's production lines — fsharp (13,661 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'.
  • P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
  • P8 Schema migrations — no EF Core usage detected
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • 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.
  • PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • 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
  • X12 Unreachable branch — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 12 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×3
  • Orphaned knowledge src/FSharpx.Collections/TaggedCollections.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge src/FSharpx.Collections.Experimental/IntMap.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge src/FSharpx.Collections/RandomAccessList.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
D11 · Test Reliability · Test suite declares a test script but contains no test files · ×1
  • Test suite declares a test script but contains no test files: tests/fable/ — The mocha suite in tests/fable/ was installed and launched successfully, and the runner then found no test files to run — Error: No test files found: "dist". The package declares a test script, so it reads as a tested package to anyone who checks its manifest, but there is nothing behind the declaration: no test case exists, so it cannot detect a regression and its presence overstates how much of this repository is tested. The ask is the owner's: write the first test for this package, or remove the test script from a package that has none. This is not a report that the tests FAIL — there are none.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 121 finding(s)
D3 · God Classes · TooManyFunctions · ×10
  • TooManyFunctions: ResizeArray src/FSharpx.Collections/ResizeArray.fs:11 — TooManyFunctions — 56 functions. The bar is 30 functions; this is 26 over it, 1.87× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: SetTree src/FSharpx.Collections/TaggedCollections.fs:31 — TooManyFunctions — 51 functions. The bar is 30 functions; this is 21 over it, 1.70× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: NonEmptyList src/FSharpx.Collections/NonEmptyList.fs:29 — TooManyFunctions — 48 functions. The bar is 30 functions; this is 18 over it, 1.60× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: LazyList src/FSharpx.Collections/LazyList.fs:95 — TooManyFunctions — 45 functions. The bar is 30 functions; this is 15 over it, 1.50× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: BankersDeque src/FSharpx.Collections.Experimental/BankersDeque.fs:473 — TooManyFunctions — 36 functions. The bar is 30 functions; this is 6 over it, 1.20× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: DList src/FSharpx.Collections/DList.fs:192 — TooManyFunctions — 36 functions. The bar is 30 functions; this is 6 over it, 1.20× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: MapTree src/FSharpx.Collections/TaggedCollections.fs:819 — TooManyFunctions — 36 functions. The bar is 30 functions; this is 6 over it, 1.20× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: FlatList src/FSharpx.Collections.Experimental/FlatList.fs:66 — TooManyFunctions — 33 functions. The bar is 30 functions; this is 3 over it, 1.10× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: Deque src/FSharpx.Collections/Deque.fs:175 — TooManyFunctions — 33 functions. The bar is 30 functions; this is 3 over it, 1.10× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: RandomAccessList src/FSharpx.Collections/RandomAccessList.fs:438 — TooManyFunctions — 31 functions. The bar is 30 functions; this is 1 over it, 1.03× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×7
  • Duplicated block (7 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:275 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:275-281 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:287-293 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) src/FSharpx.Collections.Experimental/Deque.fs:274 — src/FSharpx.Collections.Experimental/Deque.fs:274-280 | src/FSharpx.Collections.Experimental/Deque.fs:286-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) src/FSharpx.Collections/Deque.fs:151 — src/FSharpx.Collections/Deque.fs:151-157 | src/FSharpx.Collections/PriorityQueue.fs:217-224 — 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 (7 lines × 2) src/FSharpx.Collections/PersistentHashMap.fs:95 — src/FSharpx.Collections/PersistentHashMap.fs:95-101 | src/FSharpx.Collections/PersistentHashMap.fs:106-112 — 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/FSharpx.Collections/DList.fs:119 — src/FSharpx.Collections/DList.fs:119-125 | src/FSharpx.Collections/DList.fs:131-137 — 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/FSharpx.Collections.Experimental/IntMap.fs:440 — src/FSharpx.Collections.Experimental/IntMap.fs:440-446 | src/FSharpx.Collections.Experimental/IntMap.fs:455-461 — 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/FSharpx.Collections.Experimental/IntMap.fs:530 — src/FSharpx.Collections.Experimental/IntMap.fs:530-536 | src/FSharpx.Collections.Experimental/IntMap.fs:544-550 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×7
  • Duplicated block (5 lines × 2) src/FSharpx.Collections.Experimental/Deque.fs:164 — src/FSharpx.Collections.Experimental/Deque.fs:164-169 | src/FSharpx.Collections.Experimental/Deque.fs:177-181 — 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/FSharpx.Collections.Experimental/Deque.fs:191 — src/FSharpx.Collections.Experimental/Deque.fs:191-196 | src/FSharpx.Collections.Experimental/Deque.fs:204-208 — 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/FSharpx.Collections/TaggedCollections.fs:704 — src/FSharpx.Collections/TaggedCollections.fs:704-708 | src/FSharpx.Collections/TaggedCollections.fs:712-716 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (5 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:33 — src/FSharpx.Collections.Experimental/BankersDeque.fs:33-37 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:82-86 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:39 — src/FSharpx.Collections.Experimental/BankersDeque.fs:39-43 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:88-92 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharpx.Collections.Experimental/BankersDeque.fs:39` 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 (5 lines × 2) src/FSharpx.Collections.Experimental/IntMap.fs:151 — src/FSharpx.Collections.Experimental/IntMap.fs:151-155 | src/FSharpx.Collections.Experimental/IntMap.fs:187-191 — 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/FSharpx.Collections.Experimental/IntMap.fs:172 — src/FSharpx.Collections.Experimental/IntMap.fs:172-176 | src/FSharpx.Collections.Experimental/IntMap.fs:202-206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D3 · God Classes · FileTooLong · ×6
  • FileTooLong: FSharpx.Collections/TaggedCollections.fs src/FSharpx.Collections/TaggedCollections.fs — FileTooLong — 1082 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 582 over it, 2.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: FSharpx.Collections/PersistentHashMap.fs src/FSharpx.Collections/PersistentHashMap.fs — FileTooLong — 781 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 281 over it, 1.56× 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: FSharpx.Collections.Experimental/IntMap.fs src/FSharpx.Collections.Experimental/IntMap.fs — FileTooLong — 666 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 104 functions. The bar is 500 significant lines; this is 166 over it, 1.33× 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: FSharpx.Collections/Collections.fs src/FSharpx.Collections/Collections.fs — FileTooLong — 653 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 34 functions. The bar is 500 significant lines; this is 153 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: FSharpx.Collections/PersistentVector.fs src/FSharpx.Collections/PersistentVector.fs — FileTooLong — 560 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 46 functions. The bar is 500 significant lines; this is 60 over it, 1.12× 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: FSharpx.Collections.Experimental/RealTimeDeque.fs src/FSharpx.Collections.Experimental/RealTimeDeque.fs — FileTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 36 functions. The bar is 500 significant lines; this is 3 over it, 1.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×6
  • Duplicated block (13 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:246 — src/FSharpx.Collections.Experimental/BankersDeque.fs:246-258 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:333-345 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:360 — src/FSharpx.Collections.Experimental/BankersDeque.fs:360-372 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:472-484 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:293 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:293-305 | src/FSharpx.Collections.Experimental/Deque.fs:292-304 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) src/FSharpx.Collections.Experimental/BatchedQueue.fs:41 — src/FSharpx.Collections.Experimental/BatchedQueue.fs:41-53 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:86-98 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedQueue.fs` and `src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) src/FSharpx.Collections/PersistentHashMap.fs:782 — src/FSharpx.Collections/PersistentHashMap.fs:782-794 | src/FSharpx.Collections/PersistentHashMap.fs:877-889 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) src/FSharpx.Collections.Experimental/IntMap.fs:467 — src/FSharpx.Collections.Experimental/IntMap.fs:467-479 | src/FSharpx.Collections.Experimental/IntMap.fs:480-492 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×6
  • Duplicated block (12 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:54 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:54-65 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:73-84 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:212 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:212-223 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:231-242 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) src/FSharpx.Collections/PersistentVector.fs:88 — src/FSharpx.Collections/PersistentVector.fs:88-99 | src/FSharpx.Collections/PersistentVector.fs:278-289 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) src/FSharpx.Collections/PersistentVector.fs:82 — src/FSharpx.Collections/PersistentVector.fs:82-93 | src/FSharpx.Collections/RandomAccessList.fs:93-104 — 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 (12 lines × 2) src/FSharpx.Collections/PersistentVector.fs:272 — src/FSharpx.Collections/PersistentVector.fs:272-283 | src/FSharpx.Collections/RandomAccessList.fs:237-248 — 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 (12 lines × 2) src/FSharpx.Collections/RandomAccessList.fs:99 — src/FSharpx.Collections/RandomAccessList.fs:99-110 | src/FSharpx.Collections/RandomAccessList.fs:243-254 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×5
  • Duplicated block (9 lines × 4) src/FSharpx.Collections.Experimental/BankersDeque.fs:217 — src/FSharpx.Collections.Experimental/BankersDeque.fs:217-225 | src/FSharpx.Collections.Experimental/BankersDeque.fs:248-256 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:304-312 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:335-343 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 4) src/FSharpx.Collections.Experimental/BankersDeque.fs:331 — src/FSharpx.Collections.Experimental/BankersDeque.fs:331-339 | src/FSharpx.Collections.Experimental/BankersDeque.fs:362-370 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:443-451 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:474-482 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:55 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:55-63 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:74-82 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:213-221 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:232-240 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (9 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:162 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:162-170 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:188-196 | src/FSharpx.Collections.Experimental/Deque.fs:173-181 | src/FSharpx.Collections.Experimental/Deque.fs:200-208 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:283 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:283-291 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:309-317 | src/FSharpx.Collections.Experimental/Deque.fs:282-290 | src/FSharpx.Collections.Experimental/Deque.fs:308-316 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D3 · God Classes · TooManyMethods · ×4
  • TooManyMethods: BinomialHeap`1 src/FSharpx.Collections.Experimental/BinomialHeap.fs:14 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Set`2 src/FSharpx.Collections/TaggedCollections.fs:638 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: SkewBinomialHeap`1 src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs:121 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Map`3 src/FSharpx.Collections/TaggedCollections.fs:1244 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3
  • Duplicated block (11 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:232 — src/FSharpx.Collections.Experimental/BankersDeque.fs:232-242 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:319-329 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:346 — src/FSharpx.Collections.Experimental/BankersDeque.fs:346-356 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:458-468 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:49 — src/FSharpx.Collections.Experimental/BankersDeque.fs:49-59 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:98-108 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8–9 lines × 2) · ×3
  • Duplicated block (8–9 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:321 — src/FSharpx.Collections.Experimental/BankersDeque.fs:321-329 | src/FSharpx.Collections.Experimental/BankersDeque.fs:335-342 — 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–9 lines × 2) src/FSharpx.Collections/PersistentHashMap.fs:501 — src/FSharpx.Collections/PersistentHashMap.fs:501-508 | src/FSharpx.Collections/PersistentHashMap.fs:570-578 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (8–9 lines × 2) src/FSharpx.Collections/TaggedCollections.fs:851 — src/FSharpx.Collections/TaggedCollections.fs:851-858 | src/FSharpx.Collections/TaggedCollections.fs:865-873 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) src/FSharpx.Collections.Experimental/ChampHashMap.fs:87 — src/FSharpx.Collections.Experimental/ChampHashMap.fs:87-95 | src/FSharpx.Collections.Experimental/ChampHashMap.fs:110-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) src/FSharpx.Collections.Experimental/IntMap.fs:178 — src/FSharpx.Collections.Experimental/IntMap.fs:178-186 | src/FSharpx.Collections.Experimental/IntMap.fs:208-216 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (9 lines × 2) src/FSharpx.Collections/PersistentHashMap.fs:542 — src/FSharpx.Collections/PersistentHashMap.fs:542-550 | src/FSharpx.Collections/PersistentHashMap.fs:619-627 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×3
  • Duplicated block (7–8 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:153 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:153-160 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:166-172 — 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–8 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:179 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:179-186 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:192-198 — 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–8 lines × 2) src/FSharpx.Collections.Experimental/RealTimeDeque.fs:433 — src/FSharpx.Collections.Experimental/RealTimeDeque.fs:433-440 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:447-453 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7 lines × 4) · ×3
  • Duplicated block (7 lines × 4) src/FSharpx.Collections.Experimental/BankersDeque.fs:320 — src/FSharpx.Collections.Experimental/BankersDeque.fs:320-326 | src/FSharpx.Collections.Experimental/BankersDeque.fs:348-354 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:432-438 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:460-466 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:152 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:152-158 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:178-184 | src/FSharpx.Collections.Experimental/Deque.fs:163-169 | src/FSharpx.Collections.Experimental/Deque.fs:190-196 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:273 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:273-279 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:299-305 | src/FSharpx.Collections.Experimental/Deque.fs:272-278 | src/FSharpx.Collections.Experimental/Deque.fs:298-304 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D2 · Cognitive Complexity · BitmapIndexedNode.FSharpx.Collections.INode.without (cognitive 24) · ×2
  • BitmapIndexedNode.FSharpx.Collections.INode.without (cognitive 24) src/FSharpx.Collections/PersistentHashMap.fs:646 — BitmapIndexedNode.FSharpx.Collections.INode.without has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (24 pts) (nesting depth added 12). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages. This shape REPEATS in the file: one other method here (BitmapIndexedNode.FSharpx.Collections.INode.without) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass's cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold — including the worst — and 68 of the 109 points over it (62%), 2.6× the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
  • BitmapIndexedNode.FSharpx.Collections.INode.without (cognitive 24) src/FSharpx.Collections/PersistentHashMap.fs:673 — BitmapIndexedNode.FSharpx.Collections.INode.without has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (24 pts) (nesting depth added 12). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages. This shape REPEATS in the file: one other method here (BitmapIndexedNode.FSharpx.Collections.INode.without) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass's cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold — including the worst — and 68 of the 109 points over it (62%), 2.6× the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) src/FSharpx.Collections/PersistentVector.fs:138 — src/FSharpx.Collections/PersistentVector.fs:138-154 | src/FSharpx.Collections/PersistentVector.fs:334-350 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (17 lines × 2) src/FSharpx.Collections/RandomAccessList.fs:81 — src/FSharpx.Collections/RandomAccessList.fs:81-97 | src/FSharpx.Collections/RandomAccessList.fs:225-241 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×2
  • Duplicated block (10–11 lines × 2) src/FSharpx.Collections/PersistentHashMap.fs:145 — src/FSharpx.Collections/PersistentHashMap.fs:145-155 | src/FSharpx.Collections/PersistentHashMap.fs:427-436 — 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–11 lines × 2) src/FSharpx.Collections/PersistentHashMap.fs:647 — src/FSharpx.Collections/PersistentHashMap.fs:647-656 | src/FSharpx.Collections/PersistentHashMap.fs:674-684 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×2
  • Duplicated block (14 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:112 — src/FSharpx.Collections.Experimental/BankersDeque.fs:112-125 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:183-196 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (14 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:149 — src/FSharpx.Collections.Experimental/BankersDeque.fs:149-162 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:236-249 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2
  • Duplicated block (6 lines × 2) src/FSharpx.Collections/DList.fs:171 — src/FSharpx.Collections/DList.fs:171-176 | src/FSharpx.Collections/PriorityQueue.fs:217-223 — 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 (6 lines × 2) src/FSharpx.Collections/PersistentVector.fs:392 — src/FSharpx.Collections/PersistentVector.fs:392-397 | src/FSharpx.Collections/RandomAccessList.fs:369-374 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×2
  • Duplicated block (5 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:274 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:274-279 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:287-291 | src/FSharpx.Collections.Experimental/Deque.fs:273-278 | src/FSharpx.Collections.Experimental/Deque.fs:286-290 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 4) src/FSharpx.Collections.Experimental/BatchedDeque.fs:300 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:300-305 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:313-317 | src/FSharpx.Collections.Experimental/Deque.fs:299-304 | src/FSharpx.Collections.Experimental/Deque.fs:312-316 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D1 · Cyclomatic Complexity · IntMap.mergeWithKey' (cyclomatic 27) · ×1
  • IntMap.mergeWithKey' (cyclomatic 27) src/FSharpx.Collections.Experimental/IntMap.fs:333 — IntMap.mergeWithKey' has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Node.remove (cyclomatic 17) · ×1
  • Node.remove (cyclomatic 17) src/FSharpx.Collections.Experimental/ChampHashMap.fs:212 — Node.remove has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D12 · Dependency Hygiene · Deprecated · ×1
  • Deprecated: System.Collections.Immutable — System.Collections.Immutable 6.0.0 — Legacy
D2 · Cognitive Complexity · BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 41) · ×1
  • BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 41) src/FSharpx.Collections/PersistentHashMap.fs:569 — BitmapIndexedNode.FSharpx.Collections.INode.assoc has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 1 (4 pts) (nesting depth added 23). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages. This file is where this pass's cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold — including the worst — and 68 of the 109 points over it (62%), 2.6× the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 34) · ×1
  • BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 34) src/FSharpx.Collections/PersistentHashMap.fs:500 — BitmapIndexedNode.FSharpx.Collections.INode.assoc has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 1 (3 pts) (nesting depth added 18). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages. This file is where this pass's cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold — including the worst — and 68 of the 109 points over it (62%), 2.6× the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · SetTree.rebalance (cognitive 28) · ×1
  • SetTree.rebalance (cognitive 28) src/FSharpx.Collections/TaggedCollections.fs:71 — SetTree.rebalance has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (14 pts) (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. This shape REPEATS in the file: one other method here (MapTree.rebalance) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · MapTree.rebalance (cognitive 28) · ×1
  • MapTree.rebalance (cognitive 28) src/FSharpx.Collections/TaggedCollections.fs:847 — MapTree.rebalance has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (14 pts) (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. This shape REPEATS in the file: one other method here (SetTree.rebalance) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · Node.remove (cognitive 27) · ×1
  • Node.remove (cognitive 27) src/FSharpx.Collections.Experimental/ChampHashMap.fs:212 — Node.remove has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · PersistentHashMap`2.Add (cognitive 20) · ×1
  • PersistentHashMap`2.Add (cognitive 20) src/FSharpx.Collections/PersistentHashMap.fs:833 — PersistentHashMap`2.Add has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 1 (nesting depth added 7). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages. This file is where this pass's cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold — including the worst — and 68 of the 109 points over it (62%), 2.6× the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · LeftistHeap`1.merge (cognitive 18) · ×1
  • LeftistHeap`1.merge (cognitive 18) src/FSharpx.Collections.Experimental/LeftistHeap.fs:26 — LeftistHeap`1.merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts) (nesting depth added 9). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (10 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (10 members, 50+ identical tokens) src/FSharpx.Collections.Experimental/BankersDeque.fs:9 — src/FSharpx.Collections.Experimental/BankersDeque.fs:9-612 | src/FSharpx.Collections.Experimental/BankersQueue.fs:7-202 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:5-529 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:7-201 | src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:5-383 | src/FSharpx.Collections.Experimental/Deque.fs:8-524 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:7-257 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:7-245 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:9-723 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:5-368 — These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) src/FSharpx.Collections/DList.fs:1 — src/FSharpx.Collections/DList.fs:1-332 | src/FSharpx.Collections/Deque.fs:3-292 | src/FSharpx.Collections/PriorityQueue.fs:5-405 | src/FSharpx.Collections/Queue.fs:3-207 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copies of one member (3 members, 77+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 77+ corresponding lines) src/FSharpx.Collections.Experimental/EagerRoseTree.fs:1 — src/FSharpx.Collections.Experimental/EagerRoseTree.fs:1-94 | src/FSharpx.Collections.Experimental/IndexedRoseTree.fs:1-77 | src/FSharpx.Collections.Experimental/RoseTree.fs:1-93 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 77 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (74–75 lines × 2) · ×1
  • Duplicated block (74–75 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:85 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:85-158 | src/FSharpx.Collections.Experimental/Deque.fs:95-169 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (76–77 lines × 4) · ×1
  • Duplicated block (76–77 lines × 4) src/FSharpx.Collections.Experimental/BankersDeque.fs:378 — src/FSharpx.Collections.Experimental/BankersDeque.fs:378-454 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:321-396 | src/FSharpx.Collections.Experimental/Deque.fs:320-395 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:490-565 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (71 lines × 2) · ×1
  • Duplicated block (71 lines × 2) src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:247 — src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:247-317 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:232-302 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (37 lines × 2) · ×1
  • Duplicated block (37 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:243 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:243-279 | src/FSharpx.Collections.Experimental/Deque.fs:242-278 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (23–24 lines × 2) · ×1
  • Duplicated block (23–24 lines × 2) src/FSharpx.Collections.Experimental/BinomialHeap.fs:265 — src/FSharpx.Collections.Experimental/BinomialHeap.fs:265-288 | src/FSharpx.Collections.Experimental/PairingHeap.fs:247-269 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (21–23 lines × 4) · ×1
  • Duplicated block (21–23 lines × 4) src/FSharpx.Collections.Experimental/BankersQueue.fs:106 — src/FSharpx.Collections.Experimental/BankersQueue.fs:106-128 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:94-114 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:151-171 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:138-158 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedQueue.fs` and `src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (47 lines × 2) · ×1
  • Duplicated block (47 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:166 — src/FSharpx.Collections.Experimental/BankersDeque.fs:166-212 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:253-299 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×1
  • Duplicated block (18 lines × 2) src/FSharpx.Collections/PersistentVector.fs:208 — src/FSharpx.Collections/PersistentVector.fs:208-225 | src/FSharpx.Collections/RandomAccessList.fs:184-201 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (14–17 lines × 4) · ×1
  • Duplicated block (14–17 lines × 4) src/FSharpx.Collections/DList.fs:23 — src/FSharpx.Collections/DList.fs:23-39 | src/FSharpx.Collections/Deque.fs:14-27 | src/FSharpx.Collections/PriorityQueue.fs:48-61 | src/FSharpx.Collections/Queue.fs:10-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharpx.Collections/DList.fs:23` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) src/FSharpx.Collections/PersistentVector.fs:71 — src/FSharpx.Collections/PersistentVector.fs:71-86 | src/FSharpx.Collections/PersistentVector.fs:261-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15 lines × 10) · ×1
  • Duplicated block (15 lines × 10) src/FSharpx.Collections.Experimental/BankersDeque.fs:420 — src/FSharpx.Collections.Experimental/BankersDeque.fs:420-434 | src/FSharpx.Collections.Experimental/BankersQueue.fs:123-137 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:363-377 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:109-123 | src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:278-292 | src/FSharpx.Collections.Experimental/Deque.fs:362-376 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:166-180 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:153-167 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:532-546 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:263-277 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) src/FSharpx.Collections.Experimental/BatchedDeque.fs:400 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:400-414 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:126-140 | src/FSharpx.Collections.Experimental/Deque.fs:399-413 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:31 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:31-45 | src/FSharpx.Collections.Experimental/Deque.fs:55-68 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (12–15 lines × 2) · ×1
  • Duplicated block (12–15 lines × 2) src/FSharpx.Collections/DList.fs:50 — src/FSharpx.Collections/DList.fs:50-64 | src/FSharpx.Collections/DList.fs:65-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×1
  • Duplicated block (13–14 lines × 2) src/FSharpx.Collections.Experimental/BatchedDeque.fs:172 — src/FSharpx.Collections.Experimental/BatchedDeque.fs:172-184 | src/FSharpx.Collections.Experimental/Deque.fs:183-196 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BatchedDeque.fs` and `src/FSharpx.Collections.Experimental/Deque.fs` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) src/FSharpx.Collections.Experimental/DList.fs:85 — src/FSharpx.Collections.Experimental/DList.fs:85-96 | src/FSharpx.Collections.Experimental/DList.fs:98-107 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×1
  • Duplicated block (10 lines × 3) src/FSharpx.Collections.Experimental/IntMap.fs:718 — src/FSharpx.Collections.Experimental/IntMap.fs:718-727 | src/FSharpx.Collections.Experimental/IntMap.fs:732-741 | src/FSharpx.Collections.Experimental/IntMap.fs:750-759 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/FSharpx.Collections.Experimental/IntMap.fs:742` calls `fun` and `src/FSharpx.Collections.Experimental/IntMap.fs:727` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6–9 lines × 2) · ×1
  • Duplicated block (6–9 lines × 2) src/FSharpx.Collections.Experimental/IntMap.fs:157 — src/FSharpx.Collections.Experimental/IntMap.fs:157-162 | src/FSharpx.Collections.Experimental/IntMap.fs:193-201 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1
  • Duplicated block (8 lines × 3) src/FSharpx.Collections.Experimental/BinomialHeap.fs:279 — src/FSharpx.Collections.Experimental/BinomialHeap.fs:279-286 | src/FSharpx.Collections.Experimental/PairingHeap.fs:260-267 | src/FSharpx.Collections/PriorityQueue.fs:253-260 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) src/FSharpx.Collections.Experimental/BankersDeque.fs:319 — src/FSharpx.Collections.Experimental/BankersDeque.fs:319-326 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:431-438 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) src/FSharpx.Collections/PersistentVector.fs:184 — src/FSharpx.Collections/PersistentVector.fs:184-190 | src/FSharpx.Collections/RandomAccessList.fs:423-428 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) src/FSharpx.Collections.Experimental/BankersDeque.fs:204 — src/FSharpx.Collections.Experimental/BankersDeque.fs:204-208 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:291-295 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:430-434 — before extracting anything, compare `src/FSharpx.Collections.Experimental/BankersDeque.fs` and `src/FSharpx.Collections.Experimental/RealTimeDeque.fs` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×1
  • Duplicated block (10 lines × 2) src/FSharpx.Collections.Experimental/IntMap.fs:358 — src/FSharpx.Collections.Experimental/IntMap.fs:358-367 | src/FSharpx.Collections.Experimental/IntMap.fs:370-379 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (4–5 lines × 3) · ×1
  • Duplicated block (4–5 lines × 3) src/FSharpx.Collections/Deque.fs:55 — src/FSharpx.Collections/Deque.fs:55-59 | src/FSharpx.Collections/Deque.fs:69-73 | src/FSharpx.Collections/Deque.fs:121-124 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/FSharpx.Collections/Deque.fs:59` calls `create` and `src/FSharpx.Collections/Deque.fs:124` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — .NET and JavaScript/TypeScript suite — Coverage NOT MEASURED: the .NET half could not be measured — the repository wires up no coverage collector for `--collect:"XPlat Code Coverage"` to use; the JavaScript/TypeScript half could not be measured — tests/fable/ runs mocha but declares no coverage provider, so the suite can run and still produce no lcov — add `c8` (or `nyc`) as a devDependency so the suite can be wrapped for coverage. This repository's production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
GD1 · Unfinished & placeholder code · Unfinished stub · ×1
  • Unfinished stub — raises a "not implemented" error src/FSharpx.Collections/Collections.fs:824 — A shipped binding's whole body still raises a "not implemented" error — generated scaffolding that was never completed. Implement it or remove the dead surface.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 38 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×16
  • Orphaned file src/FSharpx.Collections.Experimental/BatchedDeque.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/FSharpx.Collections.Experimental/ChampHashMap.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/FSharpx.Collections.Experimental/BinomialHeap.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/FSharpx.Collections.Experimental/SkewBinomialHeap.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/FSharpx.Collections/DList.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/FSharpx.Collections.Experimental/BlockResizeArray.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/FSharpx.Collections/ByteString.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/FSharpx.Collections/Interfaces.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/FSharpx.Collections.Experimental/FlatList.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/FSharpx.Collections.Experimental/BKTree.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/FSharpx.Collections.Experimental/DList.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/FSharpx.Collections.Experimental/BootstrappedQueue.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/FSharpx.Collections.Experimental/BinaryRoseTree.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/FSharpx.Collections.Experimental/ImplicitQueue.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/FSharpx.Collections.Experimental/EagerRoseTree.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/FSharpx.Collections.Experimental/RoseTree.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.
D12 · Dependency Hygiene · Outdated · ×7
  • Outdated: FSharp.Core — FSharp.Core 4.3.4 → 11.0.101 available (referenced by FSharpx.Collections).
  • Outdated: Expecto — Expecto 8.13.1 → 11.1.1 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Expecto.FsCheck — Expecto.FsCheck 8.13.1 → 11.1.1 available (referenced by FSharpx.Collections.Tests).
  • Outdated: System.Collections.Immutable — System.Collections.Immutable 6.0.0 → 11.0.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: System.Reflection.Metadata — System.Reflection.Metadata 8.0.1 → 11.0.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Microsoft.SourceLink.GitHub docs/csharp/csharp.csproj:16 — Microsoft.SourceLink.GitHub 1.0.0 → 11.0.100 available (referenced by csharp).
  • Outdated: Paket.Core — Paket.Core 9.0.2 → 12.0.0 available (referenced by build).
X10 · Duplicated predicate · Duplicated predicate · ×2
  • Duplicated predicate src/FSharpx.Collections.Experimental/BankersDeque.fs:69 — `(abs(a - c) <= abs(xs.frontLength - d)) && (abs(a - c) <= abs(a - ys.rBackLength))` appears character-identically in 2 files — src/FSharpx.Collections.Experimental/BankersDeque.fs, src/FSharpx.Collections.Experimental/RealTimeDeque.fs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/FSharpx.Collections.Experimental/BankersDeque.fs:56 — `(abs(xs.frontLength - d) <= abs(a - c)) && (abs(xs.frontLength - d) <= abs(a - ys.rBackLength) && (xs.frontLength > 0))` appears character-identically in 2 files — src/FSharpx.Collections.Experimental/BankersDeque.fs, src/FSharpx.Collections.Experimental/RealTimeDeque.fs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: src/FSharpx.Collections/Collections.fs. Pair on, review, or document these before any departure.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found docs/csharp/csharp.csproj:4 — 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 `docs/csharp/csharp.csproj` makes this repository a deployable product (line 4).
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 16 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: src/FSharpx.Collections.Experimental/BatchedDeque.fs, src/FSharpx.Collections.Experimental/ChampHashMap.fs, src/FSharpx.Collections.Experimental/BinomialHeap.fs, src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs, src/FSharpx.Collections/DList.fs, src/FSharpx.Collections.Experimental/BlockResizeArray.fs, src/FSharpx.Collections/ByteString.fs, src/FSharpx.Collections/Interfaces.fs (and 8 more) (19 orphaned of 24 analysed files in total, 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; 24 of the 34 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M1 · Documentation (README) · Thin README · ×1
  • Thin README README.md:1 — The root README is 105 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise — or with no heading at all — is not seen and this row may understate what the document covers.
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:5 — 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 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation docs/csharp/csharp.csproj:16 — `docs/csharp/csharp.csproj` 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`.
X5 · Nullable reference types · Nullable reference types not enabled everywhere · ×1
  • Nullable reference types not enabled everywhere — 0/1 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.
Minor — 58 finding(s)
D12 · Dependency Hygiene · Outdated · ×58
  • Outdated: FsCheck — FsCheck 2.16.6 → 3.6.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Microsoft.CodeCoverage — Microsoft.CodeCoverage 18.0.1 → 18.12.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Microsoft.NET.Test.Sdk — Microsoft.NET.Test.Sdk 18.0.1 → 18.12.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Microsoft.TestPlatform.ObjectModel — Microsoft.TestPlatform.ObjectModel 18.0.1 → 18.12.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Microsoft.TestPlatform.TestHost — Microsoft.TestPlatform.TestHost 18.0.1 → 18.12.0 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Mono.Cecil — Mono.Cecil 0.11.4 → 0.11.6 available (referenced by FSharpx.Collections.Tests).
  • Outdated: System.Runtime.CompilerServices.Unsafe — System.Runtime.CompilerServices.Unsafe 6.0.0 → 6.1.2 available (referenced by FSharpx.Collections.Tests).
  • Outdated: YoloDev.Expecto.TestSdk — YoloDev.Expecto.TestSdk 0.8.0 → 0.16.1 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Fable.Core — Fable.Core 4.5.0 → 5.6.1 available (referenced by FSharpx.Collections.Tests).
  • Outdated: Fake.Core.CommandLineParsing — Fake.Core.CommandLineParsing 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Context — Fake.Core.Context 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.DependencyManager.Paket — Fake.Core.DependencyManager.Paket 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Environment — Fake.Core.Environment 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.FakeVar — Fake.Core.FakeVar 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Process — Fake.Core.Process 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.ReleaseNotes — Fake.Core.ReleaseNotes 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.SemVer — Fake.Core.SemVer 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.String — Fake.Core.String 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Target — Fake.Core.Target 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Tasks — Fake.Core.Tasks 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Trace — Fake.Core.Trace 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.Core.Xml — Fake.Core.Xml 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.DotNet.AssemblyInfoFile — Fake.DotNet.AssemblyInfoFile 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.DotNet.Cli — Fake.DotNet.Cli 6.1.4 → 6.2.0 available (referenced by build).
  • Outdated: Fake.DotNet.MSBuild — Fake.DotNet.MSBuild 6.1.4 → 6.2.0 available (referenced by build).
  • + 33 more in this group — see findings.md.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-e8ec752c35ea47eb911d73a89f839797/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-e8ec752c35ea47eb911d73a89f839797/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .9artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnuget—nuget: not applicable — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan0—
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1d475-f79d-7115-8b9a-e07bfe1791f4 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

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

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