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

shayanhabibi/fickl

Measured 17 November 2026, 14:26 UTC, at code version 6426685

First survey, so nothing to compare with yet Code coverage: not measured

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

CAI score 67.3out of 100 Adequate
CriticalWeakAdequateStrongExemplary

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 large codebase: 418,319 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 4.1 person-years · Weakest lens: Code Health, 63.1

Findings by how serious they are

114 critical 224 serious 376 minor

14 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
17 November 2026, 14:26 UTC

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

The 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 ▸

54of 54 dimensions measured by tools.
446of 714 findings point to an exact file and line, so you can open each one in the code. The other 268 concern the repository as a whole, such as missing documentation.
54dimensions across 7 lenses, read from 418,319 lines of product code in 2 projects.
Chapters

Executive summary

shayanhabibi/fickl falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 67.3 out of 100 and is rated Adequate, and 100 of its 114 critical findings are security problems.

Code Health, at 63.1, is the weakest lens and counts most in the score. The best first step for the work it takes is fixing the test command with no tests behind it, worth about 1.6 points. Removing the copied code would lift Code Health itself, worth about 3.0 points. Raising Code Health to 70 would lift the score to about 69.8.

Ninety-two pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Three secrets can leak from the build pipeline, and eight parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, limiting each secret to its own step and having someone learn the forgotten files would close these risks. Fixing the weaknesses the scanner points to would fix the two security weaknesses in the code, and setting a waiting period for automatic updates would deal with the automatic dependency update that takes a new release at once. The four sets of files in separate parts that keep changing together need that dependency made explicit.

The product code is 418,319 lines, about €600,000 to rebuild.

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

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

If Code Health rose from 63.1 to 70, the lowest score rated Strong, the score would rise from 67.3 to about 69.8.

Code composition: what the lines of code are
Supporting code 0%Tests 100%
Rebuild cost: about €600,000 · Estimate
Cost to rebuild€200,000 to €1,000,000, for 3,304 to 10,481 hours of work, about 4.1 person-years for 2 to 8 engineers
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.9 at a score of 67. 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.
SizeLarge: 418,319 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

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 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability.
Raises the score by about 1.6 points · Low effort · Test Reliability
2
Act on each finding's own remediation rather than one rule: the move depends on what recurs.
Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
Raises the score by about 3.0 points · Medium effort · Code Duplication
3
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Raises the score by about 2.8 points · Medium effort · Large Files

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 €600,000 to build again, about 4.1 person-years of work. Its weakest lens is Code Health, at 63.1 (Adequate). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability. Of all the actions in this report, it raises the score most for the work it takes: about 1.6 points for low effort, because it clears the 1 Test Reliability findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — bounded-context dependency graph

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

arch Allocations Allocations Surface Surface ctx:AST AST AST ctx:Build Build Build ctx:Cli Cli Cli ctx:Compiler Compiler Compiler ctx:Cli->ctx:Compiler ctx:Transforms Transforms AST · Babel · Beam · Dart … ctx:Cli->ctx:Transforms ctx:Declarations Declarations Declarations ctx:Cli->ctx:Declarations ctx:Compiler->ctx:AST ctx:Compiler->ctx:Transforms ctx:Core Core Core ctx:Transforms->ctx:AST ctx:Fickl.Build Fickl.Build Build ctx:Fickl.Build->ctx:Build ctx:Fickl.Core Fickl.Core Core ctx:Fickl.Core->ctx:Core ctx:Declarations->ctx:AST ctx:Declarations->ctx:Transforms ctx:QuickTest (src/quicktest) QuickTest (src/quicktest) QuickTest (src/quicktest) ctx:QuickTest (src/quicktest)->ctx:Core ctx:fable-compiler-js fable-compiler-js fable-compiler-js ctx:fable-compiler-js->ctx:Core ctx:fable-library-beam fable-library-beam Beam ctx:fable-library-beam->ctx:Core ctx:fable-library-dart fable-library-dart Dart ctx:fable-library-dart->ctx:Core ctx:fable-standalone fable-standalone Standalone · Worker ctx:fable-standalone->ctx:Transforms __more__ +16 more contexts

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.

855 modules, with 1868 dependencies between them. 7 loops run through 37 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 815 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 (global)2 System.Collections3 src.fable-library-ts4 System.Collections.Generic5 fable_library_rust.LrcPtr6 fable_library_rust.Mutable.NonSyncCell7 System8 FSharp.Compiler.Text9 Fable.AST10 Fable.Transforms.Rust.AST.Types11 Internal.Utilities.Collections.Tagged12 Internal.Utilities.Library13 FSharp.Compiler.AbstractIL.IL14 FSharp.Compiler.Syntax15 Fable.AST.Babel16 Fable.AST.Fable17 Fable.Transforms.Python.AST18 Internal.Utilities.Text.Lexing19 FSharp.Compiler.TypedTree20 FSharp.Compiler.TcGlobals21 FSharp.Compiler.Import22 FSharp.Compiler.InfoReader23 FSharp.Compiler.NameResolution24 FSharp.Compiler.Symbols25 FSharp.Compiler.Diagnostics26 FSharp.Compiler.DiagnosticsLogger27 FSharp.Compiler.CompilerConfig28 FSharp.Compiler.TypedTreeOps29 FSharp.Compiler.Infos30 FSharp.Compiler.AccessibilityLogic31 FSharp.Compiler.ConstraintSolver32 FSharp.Compiler.EditorServices33 FSharp.Compiler.CheckBasics34 FSharp.Compiler.CodeAnalysis35 Fable36 Fable.Compiler.Util37 Fable.Transforms.FSharp2Fable38 Fable.Transforms.Fable2Babel39 Fable.Transforms.Printer40 Fable.Standalone.Main
1 (global)
2 System.Collections
3 src.fable-library-ts
4 System.Collections.Generic52
5 fable_library_rust.LrcPtr1
6 fable_library_rust.Mutable.NonSyncCell1
7 System22
8 FSharp.Compiler.Text86
9 Fable.AST1421
10 Fable.Transforms.Rust.AST.Types159213
11 Internal.Utilities.Collections.Tagged232
12 Internal.Utilities.Library362
13 FSharp.Compiler.AbstractIL.IL9821066
14 FSharp.Compiler.Syntax281966
15 Fable.AST.Babel425213
16 Fable.AST.Fable7351087
17 Fable.Transforms.Python.AST738521
18 Internal.Utilities.Text.Lexing2122
19 FSharp.Compiler.TypedTree4824622232632
20 FSharp.Compiler.TcGlobals2215
21 FSharp.Compiler.Import21761
22 FSharp.Compiler.InfoReader2221022112
23 FSharp.Compiler.NameResolution28251324314237123
24 FSharp.Compiler.Symbols42214223611111
25 FSharp.Compiler.Diagnostics55312
26 FSharp.Compiler.DiagnosticsLogger22131512
27 FSharp.Compiler.CompilerConfig301247912246
28 FSharp.Compiler.TypedTreeOps1541552112117251
29 FSharp.Compiler.Infos5510232521181
30 FSharp.Compiler.AccessibilityLogic118216
31 FSharp.Compiler.ConstraintSolver32519113052211611
32 FSharp.Compiler.EditorServices15140182123722
33 FSharp.Compiler.CheckBasics21221422111311212
34 FSharp.Compiler.CodeAnalysis110167119281346128
35 Fable1312121311
36 Fable.Compiler.Util544
37 Fable.Transforms.FSharp2Fable243140152
38 Fable.Transforms.Fable2Babel6181781
39 Fable.Transforms.Printer2522
40 Fable.Standalone.Main131111216521
Uses a module listed above itPart of a loopThe module itself
1 (global)2 System.Collections3 src.fable-library-ts4 System.Collections.Generic5 fable_library_rust.LrcPtr6 fable_library_rust.Mutable.NonSyncCell7 System8 FSharp.Compiler.Text9 Fable.AST10 Fable.Transforms.Rust.AST.Types11 Internal.Utilities.Collections.Tagged12 Internal.Utilities.Library13 FSharp.Compiler.AbstractIL.IL14 FSharp.Compiler.Syntax15 Fable.AST.Babel16 Fable.AST.Fable17 Fable.Transforms.Python.AST18 Internal.Utilities.Text.Lexing19 FSharp.Compiler.TypedTree20 FSharp.Compiler.TcGlobals21 FSharp.Compiler.Import22 FSharp.Compiler.InfoReader23 FSharp.Compiler.NameResolution24 FSharp.Compiler.Symbols25 FSharp.Compiler.Diagnostics26 FSharp.Compiler.DiagnosticsLogger27 FSharp.Compiler.CompilerConfig28 FSharp.Compiler.TypedTreeOps29 FSharp.Compiler.Infos30 FSharp.Compiler.AccessibilityLogic31 FSharp.Compiler.ConstraintSolver32 FSharp.Compiler.EditorServices33 FSharp.Compiler.CheckBasics34 FSharp.Compiler.CodeAnalysis35 Fable36 Fable.Compiler.Util37 Fable.Transforms.FSharp2Fable38 Fable.Transforms.Fable2Babel39 Fable.Transforms.Printer40 Fable.Standalone.Main(global)1System.Collections2src.fable-library-ts3System.Collections.Generic4fable_library_rust.LrcPtr5fable_library_rust.Mutable.NonSyncCell6System7FSharp.Compiler.Text8Fable.AST9Fable.Transforms.Rust.AST.Types10Internal.Utilities.Collections.Tagged11Internal.Utilities.Library12FSharp.Compiler.AbstractIL.IL13FSharp.Compiler.Syntax14Fable.AST.Babel15Fable.AST.Fable16Fable.Transforms.Python.AST17Internal.Utilities.Text.Lexing18FSharp.Compiler.TypedTree19FSharp.Compiler.TcGlobals20FSharp.Compiler.Import21FSharp.Compiler.InfoReader22FSharp.Compiler.NameResolution23FSharp.Compiler.Symbols24FSharp.Compiler.Diagnostics25FSharp.Compiler.DiagnosticsLogger26FSharp.Compiler.CompilerConfig27FSharp.Compiler.TypedTreeOps28FSharp.Compiler.Infos29FSharp.Compiler.AccessibilityLogic30FSharp.Compiler.ConstraintSolver31FSharp.Compiler.EditorServices32FSharp.Compiler.CheckBasics33FSharp.Compiler.CodeAnalysis34Fable35Fable.Compiler.Util36Fable.Transforms.FSharp2Fable37Fable.Transforms.Fable2Babel38Fable.Transforms.Printer39Fable.Standalone.Main40521122861421159213232362982106628196642521373510877385212122482462223263222152176122210221122825132431423712342214223611111553122213151230124791224615415521121172515510232521181118216325191130522116111514018212372221221422111311212110167119281346128131212131154424314015261817812522131111216521+815 more modules (most-connected shown)

At a glance — Code Health · 63.1 · Adequate · gated by R10 ·

At a glance — Architecture · 94.9 · Exemplary ·

At a glance — Maturity · 71.7 · Strong ·

At a glance — Readiness · 67.1 · Adequate ·

At a glance — Security · 72.3 · Adequate · gated by D29 ·

At a glance — Event Sourcing · 100.0 · Exemplary ·

At a glance — Performance · 70.0 · Strong ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection102High / Critical
A02:2025 — Security Misconfiguration13Medium
A03:2025 — Software Supply Chain Failures8High / Critical

Roadmap

Top priorities: Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract; Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package; Resolve the 31 Outdated (npm) finding(s) in Dependency Hygiene — start with package.json.

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

Do thisHelpsEffortDimension
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability.+1.6 ptsLowTest Reliability
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.+3.0 ptsMediumCode Duplication
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.+2.8 ptsMediumLarge Files
Resolve the 1 CommentedOutCode finding(s) in Explicit Debt — start with REDACTED.+1.1 ptsLowExplicit Debt
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with docs.fsproj.+1.0 ptsLowADR Quality
Resolve the 31 Outdated (npm) finding(s) in Dependency Hygiene — start with package.json.+1.8 ptsMediumDependency Hygiene
F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.+1.3 ptsMediumAsync & latency hygiene
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.+1.1 ptsMediumDeployment & Rollback

File quality

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

FileScoreBandWorst signal
REDACTED3.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedDependency Vulnerabilities: High CVE: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
src/Fable.Transforms/Rust/Replacements.fs7.0MixedChange Coupling: Boundary-crossing change coupling: Replacements.fs ↔ Mutable.rs
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED7.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED7.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED7.9MixedStatic Analysis (SAST): Medium: REDACTED

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

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

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

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

Could not be resolved — 14

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

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

What we checked — 54 dimensions across the health lenses
D5D6D11D12D13D14D15D16D17D19D20D21D24D26D27D28D29D30D31D34D35D36D43D44AX10AX3AX4AX5AX6AX8AX9ES1GD1M1M2M3M4P1P10P2P3P4P6PF3R1R10R2R3R5R6R7R8R9X14

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, 446 of 714 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 · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic

Every finding is locatable in findings.md. Run 01a1e9e6-e764-75e7-a7d2-d3f1c432230e.

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.

  • D1 Cyclomatic Complexity — 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. Cyclomatic Complexity couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
  • D2 Cognitive Complexity — 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. Cognitive Complexity couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
  • D3 God Classes — 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. God Classes couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
  • D4 Code Duplication — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Code Duplication couldn't be assessed within its 20-minute budget on a solution this large — not included in this run.
  • D14 License Compliance — 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 a Python REDACTED/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D14 License Compliance — 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 package.json, but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/Fable.Compiler/ProjectCracker.fs, src/Fable.Transforms/Replacements.Util.fs, src/Fable.Transforms/Replacements.fs, src/Fable.Transforms/FableTransforms.fs, src/Fable.Transforms/Babel/Fable2Babel.fs, … that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Cannot open project 'src/Fable.Core/Fable.Core.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 1 deducted marker(s) and the 0.1/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (354,641 lines, 85% 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 — 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D32 Data Compliance (PII/GDPR) — 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. `src/fable-library-py/fable_library/async_.py`, `src/fable-library-py/fable_library/async_builder.py`, `src/fable-library-py/fable_library/bases.py`, `src/fable-library-py/fable_library/choice.pyi`, `src/fable-library-py/fable_library/core/array.pyi`, … (+25 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • R10 Code Duplication — 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. 8 further occurrence(s) are not listed individually; the score already reflects all 48.
  • SC1 Supply-chain hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 22 further occurrence(s) are not listed individually; the score already reflects all 62.
  • X10 Duplicated predicate — 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. 2 further occurrence(s) are not listed individually; the score already reflects all 42.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X23 Unguarded diagnostic materialisation — 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.
  • X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X28 Index access outside its own emptiness guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check'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.
  • X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 110 further occurrence(s) are not listed individually; the score already reflects all 150.
  • X7 Silent fallback defaults — 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. X7 measured the part of this repository it reads (C#, Python, TypeScript/JavaScript, Rust, Go, Java, Kotlin, Scala, PHP, Ruby, Swift, Dart and Elixir), and its Erlang source is outside the check's reach, so the card covers only part of the product. That is a gap in this analyzer's language reach — not a finding that the unread source is free of silent defaults.

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.

  • 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.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • 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 REDACTED (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.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

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

2 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 103 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). .NET suite (the runs D8 measures coverage on): measured (0 flaky); JavaScript/TypeScript (jest via `npm ci --ignore-scripts` in tests/React/ (0 tests)): measured (0 flaky).

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

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.4 / 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.4 / 10 · rule-coverage 100% · ceiling Verified

12 outdated, 0 vulnerable, 0 deprecated packages. Those are the NuGet packages; this repository's npm dependencies were read too — 243 outdated of 479 package(s) across 6 lockfile(s).

Outdated (npm): @asamuzakjp/css-color · ×31
Outdated: FSharp.Coredocs/docs.fsproj:30
Outdated (npm): @adobe/css-tools · ×212
Outdated: G-Research.FSharp.Analyzers · ×11

What to do

  1. Resolve the 31 Outdated (npm) finding(s) in Dependency Hygiene — start with package.json. — One of this dimension's main actionable groups (31 recommendation-level).
  2. Resolve the 1 Outdated finding(s) in Dependency Hygiene — start with docs.fsproj. — One of this dimension's main actionable groups (1 recommendation-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 280 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 63 direct `PackageReference`(s), and 163 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares a Python REDACTED/requirements.txt (pip/uv/Poetry) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots8.1 / 10Strong✓ 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 8.1 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: src/Fable.Transforms/Replacements.fs (109×100=10900); src/Fable.Transforms/Beam/Replacements.fs (30×279=8370); src/Fable.Transforms/Babel/Fable2Babel.fs (112×67=7504) Repeated repair below the complexity floor: src/Fable.Transforms/FSharp2Fable.fs (31 of 57 changes were fixes); src/Fable.Transforms/State.fs (8 of 11 changes were fixes); src/fable-library-ts/Decimal.ts (8 of 10 changes were fixes)

Hotspot: src/Fable.Transforms/Replacements.fs · ×41src/Fable.Transforms/Replacements.fs:2345
Repeated repair: src/Fable.Transforms/FSharp2Fable.fs · ×29src/Fable.Transforms/FSharp2Fable.fs:4598

What to do

  1. Resolve the 41 Hotspot finding(s) in Churn × Complexity Hotspots — start with Replacements.fs (5), Seq.fs (4), Fable2Babel.fs. — One of this dimension's main actionable groups (41 warning-level).
  2. Resolve the 29 Repeated repair finding(s) in Churn × Complexity Hotspots — start with List.fs (2), FSharp2Fable.fs, State.fs. — One of this dimension's main actionable groups (29 warning-level).

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

D16 · Bus Factor9.1 / 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.1 / 10 · rule-coverage 100% · ceiling Documented

47 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/Fable.Transforms/Beam/Fable2Beam.fs. Counted over 539 of the 705 production source files in this repository: 161 are under the ~2,400-byte size floor this dimension measures over, and the remaining 5 have no attributable history left to measure.

Off-boarding risk: anonymized user #1 · ×5
Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

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

D17 · Explicit Debt9.8 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

1 deducted debt markers + unmeasured dead symbols across 62 LoC in the .NET projects (0.1/KLoC) → score 9.8. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .fs (85% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).

CommentedOutCodeREDACTED:44

What to do

  1. Resolve the 1 CommentedOutCode finding(s) in Explicit Debt — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

D19 · Documentation Quality7.5 / 10Strong✓ Tool-verified

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

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

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

1 of 2 documentation facets pass in full; short on: F2 example. 43 document(s) read across 13 unit(s).

Documentation: no build, run or usage example · ×4src/fable-library-py/README.md:1

What to do

  1. Resolve the 4 Documentation finding(s) in Documentation Quality — start with README.md (4). — One of this dimension's main actionable groups (4 recommendation-level).

Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.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/docs.fsproj:3

What to do

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

D21 · Naming Consistency7.4 / 10Strong✓ Tool-verified

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

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

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

10 naming inconsistencies among 377 declarations measured against a convention their peers follow.

`test Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` · ×2tests/Beam/ArithmeticTests.fs:790
`messageID` spells `ID` where 61 names in the project spell it `Id`src/fcs-fable/SR.fs:33
`et_STRING` spells `STRING` where 41 names in the project spell it `string`src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:328
`nt_STRUCT` spells `STRUCT` where 12 names in the project spell it `struct`src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:853
`e_IMAGE_CEE_CS_CALLCONV_GENERIC` spells `GENERIC` where 42 names in the project spell it `generic`src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:1060

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

What to do

  1. Resolve the 2 `test Bitwise NOT on large unsigned integer works` spells `NO` where 173… finding(s) in Naming Consistency — start with ArithmeticTests.fs, TestArithmetic.fs. — One of this dimension's main actionable groups (2 recommendation-level).
  2. Resolve the 1 `messageID` spells `ID` where 61 names in the project spell it `Id` finding(s) in Naming Consistency — start with SR.fs. — One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 `et_STRING` spells `STRING` where 41 names in the project spell it… finding(s) in Naming Consistency — start with ilbinary.fs. — One of this dimension's main actionable groups (1 recommendation-level).

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

D24 · Comment Value10.0 9.7 / 10Exemplary○ Nothing flagged

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 97% · ceiling Documented

0 of 415 judged comments only repeat the code they sit on (0.0 %). 15 comment(s) in another language or script were not judged.

✓ On the Gold path — maintain.

Detailed fixes: d24_recommendation.md.

D26 · Project Cohesion10.0 / 10Exemplary✓ Tool-verified

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

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

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

0 of 2 projects flagged as possibly oversized/incoherent.

✓ On the Gold path — maintain.

Detailed fixes: d26_recommendation.md.

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

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

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

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

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

92 % of calls cross a namespace and 2 % 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)1.5 / 10Critical✓ Tool-verified

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

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

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

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

102 finding(s): 0 critical, 99 high, 3 medium, 0 low. 89 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 32 file(s) — `.devcontainer/scripts/zsh_dotnet_completion.sh` (line 15), `src/fable-library-py/fable_library/async_.py` (line 54, lines 58–62, lines 68–71, …), `src/fable-library-py/fable_library/async_builder.py` (line 29, line 117, line 137, …), `src/fable-library-py/fable_library/bases.py` (line 164, lines 201–204, lines 222–225), `src/fable-library-py/fable_library/choice.pyi` (line 9, lines 11–13, lines 15–17, …), … (+27 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 3 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 3 REDACTED finding(s) charged to Static Analysis (SAST) — the other 89 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (92 issue-level, 3 of them charged here).
  2. Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
  3. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

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

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

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

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

4 finding(s): 0 critical, 1 high, 2 medium, 1 low.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

D31 · IaC & Container Security9.7 / 10Exemplary✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

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

13 finding(s): 0 critical, 0 high, 0 medium, 13 low.

REDACTED

✓ On the Gold path — maintain.

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

D34 · Knowledge Freshness9.4 / 10Adequategated by 8 critical findings✓ Tool-verified

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

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

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

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

Orphaned knowledge · ×8src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:1
Orphaned file · ×26src/fcs-fable/service_slim.fs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 8 Orphaned knowledge finding(s) in Knowledge Freshness — start with ilwrite.fs, infos.fs, Exprs.fs. — One of this dimension's main actionable groups (8 issue-level).
  2. Resolve the 26 Orphaned file finding(s) in Knowledge Freshness — start with service_slim.fs, PhpPrinter.fs, AccessibilityLogic.fs. — One of this dimension's main actionable groups (26 recommendation-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 Coupling9.7 / 10Adequategated by 4 critical findings✓ 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 9.7 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: HashMap.rs↔HashSet.rs 100%; MutableMap.fs↔MutableSet.fs 92%; Replacements.fs↔Mutable.rs 83%

Boundary-crossing change coupling: Replacements.fs ↔ Mutable.rs · ×4src/Fable.Transforms/Rust/Replacements.fs:1
Change coupling: HashMap.rs ↔ HashSet.rs · ×7src/fable-library-rust/src/HashMap.rs:1
Change-coupling hub: Option.fs → Array.fs, List.fs, Native.rssrc/fable-library-rust/src/Option.fs
Change coupling clique: Async.ts, Observable.ts, Timer.tssrc/fable-library-ts/Async.ts

What to do

  1. Resolve the 4 Boundary-crossing change coupling finding(s) in Change Coupling — start with Replacements.fs (3), DartPrinter.fs. — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 7 Change coupling finding(s) in Change Coupling — start with HashMap.rs, MutableMap.fs, Array.fs. — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with Option.fs. — One of this dimension's main actionable groups (1 warning-level).

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

D36 · Supply-chain Provenance & Signing5.0 / 10Adequate✓ 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 5.0 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED
REDACTED
REDACTED
REDACTED

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

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

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

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

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

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

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

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

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

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

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

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.

AX6 · Interface segregation9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

  • `NumericArray` declares 19 required operations under just 15 distinct name(s): `every`, `fill`, `filter`, `find`, `findIndex`, `forEach`, `indexOf`, `join`, `lastIndexOf`, `reduce`, `reduce`, `reduce`, `reduceRight`, `reduceRight`, `reduceRight`, `reverse`, `slice`, `some`, `sort`. Counted over its REQUIRED operations — a method signature or a function-typed property with no `?`, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 19 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 19 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — src/fable-library-ts/Util.ts:9
  • `ObjectConstructor` declares 18 abstract members: `assign`, `create`, `defineProperties`, `defineProperty`, `entries`, `freeze`, `getOwnPropertyDescriptor`, `getOwnPropertyNames`, `getPrototypeOf`, `is`, `isExtensible`, `isFrozen`, `isSealed`, `keys`, `preventExtensions`, `seal`, `setPrototypeOf`, `values`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:196
  • `Math` declares 43 abstract members: `abs`, `acos`, `acosh`, `asin`, `asinh`, `atan`, `atan2`, `atanh`, `cbrt`, `ceil`, `clz32`, `cos`, `cosh`, `exp`, `expm1`, `floor`, `fround`, `hypot`, `imul`, `log`, `log10`, `log1p`, `log2`, `max`, `min`, `pow`, `random`, `round`, `sign`, `sin`, `sinh`, `sqrt`, `tan`, `tanh`, `trunc`, `PI`, `LN2`, `E`, `LN10`, `SQRT2`, and 3 more. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:229
  • `Date` declares 43 abstract members: `getDate`, `getDay`, `getFullYear`, `getHours`, `getMilliseconds`, `getMinutes`, `getMonth`, `getSeconds`, `getTime`, `getTimezoneOffset`, `getUTCDate`, `getUTCDay`, `getUTCFullYear`, `getUTCHours`, `getUTCMilliseconds`, `getUTCMinutes`, `getUTCMonth`, `getUTCSeconds`, `setDate`, `setFullYear`, `setHours`, `setMilliseconds`, `setMinutes`, `setMonth`, `setSeconds`, `setTime`, `setUTCDate`, `setUTCFullYear`, `setUTCHours`, `setUTCMilliseconds`, `setUTCMinutes`, `setUTCMonth`, `setUTCSeconds`, `toDateString`, `toISOString`, `toJSON`, `toLocaleDateString`, `toLocaleString`, `toLocaleTimeString`, `toString`, and 3 more. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:274
  • `DataView` declares 23 abstract members: `getBigInt64`, `getBigUint64`, `getFloat32`, `getFloat64`, `getInt16`, `getInt32`, `getInt8`, `getUint16`, `getUint32`, `getUint8`, `setBigInt64`, `setBigUint64`, `setFloat32`, `setFloat64`, `setInt16`, `setInt32`, `setInt8`, `setUint16`, `setUint32`, `setUint8`, `byteLength`, `byteOffset`, `buffer`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:472
  • `TypedArray`1<T>` declares 19 abstract members: `fill`, `filter`, `find`, `findIndex`, `forEach`, `includes`, `indexOf`, `lastIndexOf`, `map`, `reduce`, `reduceRight`, `reverse`, `set`, `slice`, `some`, `sort`, `subarray`, `values`, `Item`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:523
  • `Console` declares 19 abstract members: `assert`, `clear`, `count`, `debug`, `dir`, `dirxml`, `error`, `group`, `groupCollapsed`, `groupEnd`, `info`, `log`, `profile`, `profileEnd`, `table`, `time`, `timeEnd`, `trace`, `warn`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:750
  • `MemberFunctionOrValue` declares 26 abstract members: `IsPublic`, `FullName`, `IsConstructor`, `IsSetter`, `ImplementedAbstractSignatures`, `IsOverrideOrExplicitInterfaceImplementation`, `IsGetter`, `ApparentEnclosingEntity`, `ReturnParameter`, `Attributes`, `CompiledName`, `IsInstance`, `IsValue`, `GenericParameters`, `IsInline`, `IsInternal`, `IsProperty`, `DeclaringEntity`, `HasSpread`, `IsExtension`, `IsMutable`, `CurriedParameterGroups`, `IsDispatchSlot`, `DisplayName`, `IsPrivate`, `XmlDoc`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.AST/Fable.fs:119
  • `Entity` declares 29 abstract members: `TryFindMember`, `DeclaringEntity`, `IsEnum`, `GenericParameters`, `CompiledName`, `DisplayName`, `MembersFunctionsAndValues`, `IsFSharpRecord`, `BaseType`, `AllInterfaces`, `IsFSharpUnion`, `Attributes`, `IsFSharpExceptionDeclaration`, `IsInternal`, `IsNamespace`, `IsFSharpModule`, `DeclaredInterfaces`, `IsByRef`, `IsInterface`, `FSharpFields`, `IsFSharpAbbreviation`, `IsAbstractClass`, `UnionCases`, `IsMeasure`, `IsPublic`, `IsPrivate`, `Ref`, `IsValueType`, `FullName`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.AST/Fable.fs:149
  • `Compiler` declares 19 abstract members: `AddLog`, `AddSignatureDependency`, `AddWatchDependency`, `GetImplementationFile`, `GetInlineExpr`, `GetRootModule`, `IncrementCounter`, `TryGetEntity`, `WillPrecompileInlineFunction`, `IsPrecompilingInlineFunction`, `OutputType`, `SourceFiles`, `Plugins`, `OutputDir`, `ProjectFile`, `CurrentFile`, `Options`, `ProjectOptions`, `LibraryDir`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Transforms/Global/Compiler.fs:70
  • `IBabelCompiler` declares 18 abstract members: `GetAllAllTopDirectivesPrologue`, `GetAllImports`, `GetImportAs`, `GetImportExpr`, `GetRecordCopier`, `GetRecordCopierDeclarations`, `GetSymbolDeclarations`, `GetSymbolKey`, `InTypePosition`, `MarkValueImport`, `SaveTopDirectivePrologue`, `TransformAsExpr`, `TransformAsStatements`, `TransformFunction`, `TransformImport`, `UsesRecordCopier`, `WarnOnlyOnce`, `IsTypeScript`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Transforms/Babel/Fable2Babel.fs:77
  • `IPhpCompiler` declares 27 abstract members: `AddEntityName`, `AddImport`, `AddLocalVar`, `AddRequire`, `AddType`, `AddUse`, `ClearRequire`, `ClearThisArgument`, `EnterBreakable`, `FindLableLevel`, `GetEntityName`, `IsImport`, `IsThisArgument`, `LeaveBreakable`, `MakeUniqueVar`, `NewScope`, `RestoreScope`, `SetDecisionTargets`, `SetPhpNamespace`, `SetThisArgument`, `TryFindType`, `UseVar`, `UseVarByRef`, `NsUse`, `PhpNamespace`, `DecisionTargets`, `Require`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Transforms/Php/Fable2Php.fs:11
  • `IBackgroundCompiler` declares 25 abstract members: `BeforeBackgroundFileCheck`, `FileChecked`, `FileParsed`, `FrameworkImportsCache`, `ProjectChecked`, `CheckFileInProject`, `CheckFileInProjectAllowingStaleCachedResults`, `ClearCache`, `ClearCaches`, `DownsizeCaches`, `FindReferencesInFile`, `GetAssemblyData`, `GetBackgroundCheckResultsForFileInProject`, `GetBackgroundParseResultsForFileInProject`, `GetCachedCheckFileResult`, `GetProjectOptionsFromScript`, `GetProjectSnapshotFromScript`, `GetSemanticClassificationForFile`, `InvalidateConfiguration`, `NotifyFileChanged`, `NotifyProjectCleaned`, `ParseAndCheckFileInProject`, `ParseAndCheckProject`, `ParseFile`, `TryGetRecentCheckResultsForFile`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/fcs-fable/src/Compiler/Service/BackgroundCompiler.fs:36

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
  • Where the width is an overload set rather than separate responsibilities, collapse the overloads instead — segregating those relieves no caller.
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

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

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

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

ES1 · Fold determinism10.0 / 10Exemplary✓ Tool-verified

Other · Event Sourcing — Whether the event-sourcing replay fold reconstructs state purely from the event (no wall clock, UUID or randomness) so replay is reproducible.

Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

M1 · Documentation (README)6.0 / 10Adequate✓ Tool-verified

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

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

What to do

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation5.0 / 10Adequate✓ 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.

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

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

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

P2 · Observability6.9 / 10Adequate✓ Tool-verified

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

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

  • Only 4/14 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `docs`, `src/Fable.Build`, `src/Fickl.Build`, `src/fable-compiler-js`, `src/fable-compiler-js/src` and 5 more.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
  • Add a health-check endpoint (ASP.NET Core's MapHealthChecks, or a /health route in your Giraffe/Suave app) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling7.0 / 10Strong✓ 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.

What to do

  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

What to do

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

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

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

PF3 · Async & latency hygiene7.0 / 10Strong✓ Tool-verified

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

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

  • `GetOrComputeValue` holds an async function that calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — src/fcs-fable/src/Compiler/Facilities/BuildGraph.fs:64
  • `Parallel` holds an async function that calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — src/fcs-fable/src/Compiler/Facilities/DiagnosticsLogger.fs:1069

What to do

  • F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.
R1 · Type Safety7.2 / 10Strong✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

R10 · Code Duplication3.7 / 10Weak✓ Tool-verified

React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.

  • src/fable-library-ts/Date.ts:719 · src/fable-library-ts/DateOffset.ts:110 — the two spans are one implementation copied and then locally edited — 972 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Date.ts:719
  • src/fable-library-ts/Date.ts:629 · src/fable-library-ts/DateTimeFormat.ts:559 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — src/fable-library-ts/Date.ts:629
  • src/fable-library-ts/Date.ts:304 · src/fable-library-ts/DateTimeFormat.ts:292 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:304
  • src/fable-library-ts/Transfer.ts:36 · src/fable-library-ts/Transfer.ts:83 — the two spans are one implementation copied and then locally edited — 271 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Transfer.ts:36
  • src/fable-library-ts/TimeSpan.ts:192 · src/fable-library-ts/TimeSpanTemporal.ts:243 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeSpan.ts:192
  • src/fable-library-ts/DateOnly.ts:76 · src/fable-library-ts/DateOnlyTemporal.ts:109 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateOnly.ts:76
  • src/fable-library-ts/Date.ts:59 · src/fable-library-ts/DateTimeFormat.ts:73 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — src/fable-library-ts/Date.ts:59
  • src/fable-library-ts/Date.ts:178 · src/fable-library-ts/Date.ts:211 · src/fable-library-ts/Date.ts:243 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:178
  • src/fable-library-ts/DateTimeFormat.ts:178 · src/fable-library-ts/DateTimeFormat.ts:211 · src/fable-library-ts/DateTimeFormat.ts:243 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeFormat.ts:178
  • src/fable-library-ts/Rune.ts:210 · src/fable-library-ts/Util.ts:540 — the two spans are one implementation copied and then locally edited — 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Rune.ts:210
  • src/fable-library-ts/Util.ts:773 · src/fable-library-ts/Util.ts:811 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Util.ts:773
  • src/fable-library-ts/Date.ts:157 · src/fable-library-ts/DateTimeFormat.ts:157 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:157
  • src/fable-library-ts/Observable.ts:76 · src/fable-library-ts/Observable.ts:93 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Observable.ts:76
  • src/fable-library-ts/Uri.ts:101 · src/fable-library-ts/Uri.ts:127 — the two spans are one implementation copied and then locally edited — 57 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Uri.ts:101
  • src/fable-library-ts/DateOnlyTemporal.ts:75 · src/fable-library-ts/TimeOnlyTemporal.ts:120 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateOnlyTemporal.ts:75
  • src/fable-library-ts/TimeSpan.ts:233 · src/fable-library-ts/TimeSpanTemporal.ts:285 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeSpan.ts:233
  • src/fable-library-ts/BitConverter.ts:21 · src/fable-library-ts/BitConverter.ts:35 · src/fable-library-ts/BitConverter.ts:49 · src/fable-library-ts/BitConverter.ts:63 — all 4 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/BitConverter.ts:21
  • src/fable-library-ts/Date.ts:104 · src/fable-library-ts/Date.ts:227 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:104
  • src/fable-library-ts/DateTimeFormat.ts:121 · src/fable-library-ts/DateTimeFormat.ts:227 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeFormat.ts:121
  • src/fable-library-ts/Encoding.ts:108 · src/fable-library-ts/Encoding.ts:143 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Encoding.ts:108
  • src/fable-library-ts/TimeOnly.ts:99 · src/fable-library-ts/TimeSpan.ts:216 · src/fable-library-ts/TimeSpanTemporal.ts:267 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeOnly.ts:99
  • src/fable-library-ts/TimeOnly.ts:7 · src/fable-library-ts/TimeOnlyTemporal.ts:38 — the two spans are one implementation copied and then locally edited — 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/TimeOnly.ts:7
  • src/fable-library-ts/Date.ts:613 · src/fable-library-ts/DateTimeFormat.ts:494 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:613
  • src/fable-library-ts/BitConverter.ts:90 · src/fable-library-ts/BitConverter.ts:102 · src/fable-library-ts/BitConverter.ts:114 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/BitConverter.ts:90
  • src/fable-library-ts/Char.ts:81 · src/fable-library-ts/Char.ts:93 — all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — src/fable-library-ts/Char.ts:81
  • src/fable-library-ts/Date.ts:410 · src/fable-library-ts/Date.ts:514 · src/fable-library-ts/DateTimeFormat.ts:436 — the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:410
  • src/fable-library-ts/DateTimeOffsetTemporal.ts:302 · src/fable-library-ts/DateTimeTemporal.ts:76 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeOffsetTemporal.ts:302
  • src/fable-library-ts/TimeSpan.ts:38 · src/fable-library-ts/TimeSpanTemporal.ts:60 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeSpan.ts:38
  • src/fable-library-ts/AsyncBuilder.ts:221 · src/fable-library-ts/AsyncBuilder.ts:230 — 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. — src/fable-library-ts/AsyncBuilder.ts:221
  • src/fable-library-ts/Date.ts:473 · src/fable-library-ts/Date.ts:492 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:473
  • src/fable-library-ts/Numeric.ts:57 · src/fable-library-ts/Numeric.ts:67 — 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. — src/fable-library-ts/Numeric.ts:57
  • REDACTED:85 · REDACTED:95 — 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. — REDACTED:85
  • src/fable-library-ts/Types.ts:163 · src/fable-library-ts/Types.ts:179 — the two spans are one implementation copied and then locally edited — 92 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Types.ts:163
  • src/fable-library-ts/Util.ts:269 · src/fable-library-ts/Util.ts:330 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Util.ts:269
  • src/fable-library-ts/Char.ts:139 · src/fable-library-ts/Char.ts:149 · src/fable-library-ts/Char.ts:159 · src/fable-library-ts/Char.ts:169 · +1 more site(s) not listed — all 5 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Char.ts:139
  • src/fable-library-ts/DateTimeFormat.ts:381 · src/fable-library-ts/DateTimeFormat.ts:391 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeFormat.ts:381
  • src/fable-library-ts/Decimal.ts:179 · src/fable-library-ts/Decimal.ts:381 — 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. — src/fable-library-ts/Decimal.ts:179
  • src/fable-library-ts/Reflection.ts:493 · src/fable-library-ts/Reflection.ts:501 — 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. — src/fable-library-ts/Reflection.ts:493
  • src/fable-library-ts/CollectionUtil.ts:98 · src/fable-library-ts/CollectionUtil.ts:128 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/CollectionUtil.ts:98
  • src/fable-library-ts/CollectionUtil.ts:167 · src/fable-library-ts/Util.ts:1163 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/CollectionUtil.ts:167

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R2 · Cyclomatic Complexity8.6 / 10Strong✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • (anonymous) has cyclomatic complexity 65 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:475
  • dateToStringWithCustomFormat has cyclomatic complexity 65 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Date.ts:94
  • dateToStringWithCustomFormat has cyclomatic complexity 58 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateTimeFormat.ts:111
  • formatReplacement has cyclomatic complexity 47 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:238
  • hasValidDateParts has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateTimeFormat.ts:515
  • parseRaw has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — src/fable-library-ts/Date.ts:629, src/fable-library-ts/DateTimeFormat.ts:559
  • walk has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:550
  • evaluate has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:411
  • parse has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpanTemporal.ts:243
  • split has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:827
  • parse has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpan.ts:192
  • formatGeneral has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:429
  • exprToString has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:518
  • sub has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:604
  • toPlain has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Transfer.ts:36
  • isValid has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Int32.ts:104
  • ofPlain has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Transfer.ts:83
  • parse has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateOnly.ts:76
  • splitNumber has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/NumberStyles.ts:35
  • parse has cyclomatic complexity 13 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateOnlyTemporal.ts:109
  • (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:280
  • op_Division has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Decimal.ts:333
  • toString has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpan.ts:169
  • (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:613
  • compare has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:981
  • parseStyled has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/BigInt.ts:199
  • fit has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Decimal.ts:135
  • structuralHash has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:816
  • (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:165
  • parse has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeOnly.ts:88
  • roundToModeWithLimits has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:1064
  • equals has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:899
  • fromFloat has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Decimal.ts:520
  • toString has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpanTemporal.ts:221
R3 · Large Files5.3 / 10Adequate✓ Tool-verified

React / JS · Code Health — How many source files exceed the large-file threshold.

Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.

  • src/fable-library-ts/Util.ts has 1372 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Util.ts:1
  • REDACTED has 850 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • src/fable-library-ts/Date.ts has 839 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Date.ts:1
  • src/fable-library-ts/Reflection.ts has 740 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Reflection.ts:1
  • src/fable-library-ts/quotation.ts has 617 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/quotation.ts:1
  • src/fable-library-ts/DateTimeFormat.ts has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/DateTimeFormat.ts:1
  • src/fable-library-ts/Decimal.ts has 562 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Decimal.ts:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R5 · Dependency Freshness9.3 / 10Exemplary✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.

R7 · Dead Code9.9 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

  • 47 file(s) (~787 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package.
  • 54 file(s) (~13579 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — src/fable-library-ts
  • 1 file(s) (~6 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — tests/React
  • Unreachable from the 3 application, 11 tooling and 52 test entry point(s) detected in this repo. Gate removals on `npm run tsc` — an undetected custom entry would make these reachable.
  • no import path from any entry point (3 application, 11 tooling, 52 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×2) — REDACTED, src/fable-standalone/src/Worker/util.js

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene5.0 / 10Adequate✓ Tool-verified

React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.

Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.

  • Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — package.json:28
  • Declared in src/fable-compiler-js/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×3) — src/fable-compiler-js/package.json:27, src/fable-compiler-js/package.json:28, src/fable-compiler-js/package.json:31
  • Declared in src/fcs-fable/test/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — src/fcs-fable/test/package.json:13
  • Declared in src/tools/source-maps/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2) — src/tools/source-maps/package.json:7, src/tools/source-maps/package.json:8
  • Declared in tests/React/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×3) — tests/React/package.json:12, tests/React/package.json:14, tests/React/package.json:15

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports8.3 / 10Strong✓ Tool-verified

React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.

Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.

  • src/fable-library-ts/BigInt.ts → src/fable-library-ts/Decimal.ts → src/fable-library-ts/BigInt.ts — src/fable-library-ts/BigInt.ts:3

What to do

  • Break each cycle by extracting the shared piece into a module both sides can import.
X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

Reference — by lens

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

LensScoreRatingImpact
Code Health63.1Adequate — gated by R10Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture94.9ExemplarySolid.
Maturity71.7StrongSolid.
Readiness67.1AdequateAcceptable, with room to improve.
Security72.3Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Event Sourcing100.0ExemplaryStrongest area.
Performance70.0StrongSolid.
Unscored — 3 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 — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 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 — 74 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 user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — docker build failed (exit 1) — 56 | # Trigger the dotnet first run experience by running a command 57 | >>> RUN source .zshrc && dotnet --help 58 | # Add dotnet zsh completion 59 | COPY scripts/zsh_dotnet_completion.sh /home/vscode/zsh_dotnet_completion.sh -------------------- ERROR: failed to solve: process "/bin/zsh -c source .zshrc && dotnet --help" did not complete successfully: exit code: 127; likely cause (the repository): a RUN step of the repository's REDACTED exited with code 127 (`/bin/zsh -c source .zshrc && dotnet --help`): the build's own command failed, for example a compile or test error; runtime evidence skipped The cause is in the repository, not in our sandbox: a RUN step of the repository's REDACTED exited with code 127 (`/bin/zsh -c source .zshrc && dotnet --help`): the build's own command failed, for example a compile or test error. Nothing here says the surface is inaccessible, only that it was never rendered.
  • 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.
  • D1 Cyclomatic Complexity — Cyclomatic Complexity not included (time budget)
  • D10 Test Quality — ~151702 lines of test source are present (.fs, .py, .ts, .js, .mjs) 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 .dart, .erl, .fs, .php, .py, .rs, .ts, 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.
  • D2 Cognitive Complexity — Cognitive Complexity not included (time budget)
  • D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed F#, JavaScript, Rust surface was not measured.
  • D23 Boundary Type-Coupling — single shared-core project — no cross-context coupling to assess
  • D25 ADR Conformance — no ADRs to check
  • D3 God Classes — God Classes not included (time budget)
  • D32 Data Compliance (PII/GDPR) — 30 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D4 Code Duplication — Code Duplication not included (time budget)
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • 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 — no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half could not be measured — the jest suite in tests/React/ ran and not one test passed (No tests found, exiting with code 1), so the coverage would describe the failed run, not the code. 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 — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 19 strongly-typed id(s); 1704 value object(s); 56 domain event(s); its domain events are published by services or handlers — no domain entity raises one; no aggregate is declared and no domain structure surrounds the state-guarding types: not claimed as DDD
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES2 Immutable events — not applicable — the code was read and holds no persisted event, so there is nothing for this check to judge
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • 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.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • R4 Test Coverage — 52 test file(s) reach none of 58 production file(s) via imports — exercised outside the JS import graph (integration/bundled), not import-reachable
  • 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 — X12 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — X16 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no async method does work a token could cancel
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — X23 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — X27 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X28 Index access outside its own emptiness guard — X28 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X31 Test-only surface in a production module — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X5 Nullable reference types — X5 reached only 5% of this repository's production lines — fsharp (355,600 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score.
  • 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 — 114 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 67 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned knowledge · ×8
  • Orphaned knowledge src/fcs-fable/src/Compiler/AbstractIL/ilwrite.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/fcs-fable/src/Compiler/Checking/infos.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/fcs-fable/src/Compiler/Symbols/Exprs.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/fcs-fable/src/Compiler/Optimize/InnerLambdasToTopLevelFuncs.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/fcs-fable/src/Compiler/Checking/SignatureConformance.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/Fable.Transforms/Dart/DartPrinter.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/Fable.PublishUtils/PublishUtils.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/fable-library-php/Set.php: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.
D35 · Change Coupling · Boundary-crossing change coupling · ×4
  • Boundary-crossing change coupling: Replacements.fs ↔ Mutable.rs src/Fable.Transforms/Rust/Replacements.fs:1 — `src/Fable.Transforms/Rust/Replacements.fs` (context Fable.Transforms) and `src/fable-library-rust/src/Mutable.rs` (context fable-library-rust) sit in DIFFERENT parts of the tree yet change together 83% of the time (19 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are `705b6b70` fix(rust): Inline hashing, more Decimal tests (#5236); `93c2df5b` fix(rust): Fix IEnumerable casting, interop and type testing (#4946); `974f63e2` [Rust] Updated derived traits mapping (#3944) — run `git show` on any of them.
  • Boundary-crossing change coupling: Replacements.fs ↔ Option.fs src/Fable.Transforms/Rust/Replacements.fs:1 — `src/Fable.Transforms/Rust/Replacements.fs` (context Fable.Transforms) and `src/fable-library-rust/src/Option.fs` (context fable-library-rust) sit in DIFFERENT parts of the tree yet change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `e381f0a4` [Rust] Add support for null strings (#4033); `aaad817f` [Rust] - Initial support for null values (#4023); `88f0c4c3` [Rust] fable-library-rust update (#2932) — run `git show` on any of them.
  • Boundary-crossing change coupling: Replacements.fs ↔ double.py src/Fable.Transforms/Python/Replacements.fs:1 — `src/Fable.Transforms/Python/Replacements.fs` (context Fable.Transforms) and `src/fable-library-py/fable_library/double.py` (context fable-library-py) sit in DIFFERENT parts of the tree yet change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `383bb93c` fix(python): match .NET NaN and signed-zero semantics in comparison, …; `4c67c82a` [Python] Fix type annotations for curried functions and numeric types…; `c27608b7` [Python] misc iteration on pyo3 strings ++ (#4130) — run `git show` on any of them.
  • Boundary-crossing change coupling: DartPrinter.fs ↔ Util.dart src/Fable.Transforms/Dart/DartPrinter.fs:1 — `src/Fable.Transforms/Dart/DartPrinter.fs` (context Fable.Transforms) and `src/fable-library-dart/Util.dart` (context fable-library-dart) sit in DIFFERENT parts of the tree yet change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `f391f7a9` [Dart] Fix more arithmetic tests (#4461); `b7c178a3` Dart: Enable more option tests; `de89ab1c` Dart fixes — run `git show` on any of them.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
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/React/ — The jest suite in tests/React/ was installed and launched successfully, and the runner then found no test files to run — No tests found, exiting with code 1. 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
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
R9 · Circular Imports · Import cycle (2 files) · ×1
  • Import cycle (2 files) src/fable-library-ts/BigInt.ts:3 — src/fable-library-ts/BigInt.ts → src/fable-library-ts/Decimal.ts → src/fable-library-ts/BigInt.ts
Serious — 224 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×41
  • Hotspot: src/Fable.Transforms/Replacements.fs src/Fable.Transforms/Replacements.fs:2345 — src/Fable.Transforms/Replacements.fs changed 109 times in last 90 days, max cyclomatic complexity 100 in Replacements.operators at line 2345. 51 of those changes were fix/bug commits, and the other 58 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Replacements.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Beam/Replacements.fs src/Fable.Transforms/Beam/Replacements.fs:5865 — src/Fable.Transforms/Beam/Replacements.fs changed 30 times in last 90 days, max cyclomatic complexity 279 in Replacements.tryCall at line 5865. 26 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Beam/Replacements.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Babel/Fable2Babel.fs src/Fable.Transforms/Babel/Fable2Babel.fs:3192 — src/Fable.Transforms/Babel/Fable2Babel.fs changed 112 times in last 90 days, max cyclomatic complexity 67 in Util.transformValue at line 3192. 52 of those changes were fix/bug commits, and the other 60 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Babel/Fable2Babel.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/FSharp2Fable.Util.fs src/Fable.Transforms/FSharp2Fable.Util.fs:3773 — src/Fable.Transforms/FSharp2Fable.Util.fs changed 82 times in last 90 days, max cyclomatic complexity 40 in Util.callAttachedMember at line 3773. 30 of those changes were fix/bug commits, and the other 52 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/FSharp2Fable.Util.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Transforms.Util.fs src/Fable.Transforms/Transforms.Util.fs:1962 — src/Fable.Transforms/Transforms.Util.fs changed 38 times in last 90 days, max cyclomatic complexity 54 in AST.getSubExpressions at line 1962. 7 of those changes were fix/bug commits, and the other 31 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Transforms.Util.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Rust/Replacements.fs src/Fable.Transforms/Rust/Replacements.fs:1389 — src/Fable.Transforms/Rust/Replacements.fs changed 19 times in last 90 days, max cyclomatic complexity 103 in Replacements.strings at line 1389. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Rust/Replacements.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Python/Replacements.fs src/Fable.Transforms/Python/Replacements.fs:1148 — src/Fable.Transforms/Python/Replacements.fs changed 20 times in last 90 days, max cyclomatic complexity 91 in Replacements.operators at line 1148. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Python/Replacements.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:465 — REDACTED changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in String.format at line 465. 16 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Cli/Main.fs src/Fable.Cli/Main.fs:1787 — src/Fable.Cli/Main.fs changed 27 times in last 90 days, max cyclomatic complexity 57 in Main.compilationCycle at line 1787. 16 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Cli/Main.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Rust/Fable2Rust.fs src/Fable.Transforms/Rust/Fable2Rust.fs:1150 — src/Fable.Transforms/Rust/Fable2Rust.fs changed 24 times in last 90 days, max cyclomatic complexity 57 in TypeInfo.transformType at line 1150. 19 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Rust/Fable2Rust.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Dart/Replacements.fs src/Fable.Transforms/Dart/Replacements.fs:976 — src/Fable.Transforms/Dart/Replacements.fs changed 17 times in last 90 days, max cyclomatic complexity 77 in Replacements.operators at line 976. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Dart/Replacements.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Beam/Fable2Beam.fs src/Fable.Transforms/Beam/Fable2Beam.fs:316 — src/Fable.Transforms/Beam/Fable2Beam.fs changed 10 times in last 90 days, max cyclomatic complexity 122 in Compiler.transformExpr at line 316. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Beam/Fable2Beam.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Babel/BabelPrinter.fs src/Fable.Transforms/Babel/BabelPrinter.fs:509 — src/Fable.Transforms/Babel/BabelPrinter.fs changed 30 times in last 90 days, max cyclomatic complexity 36 in PrinterExtensions.Printer.Print at line 509. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Babel/BabelPrinter.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/fable-library-ts/Util.ts src/fable-library-ts/Util.ts:256 — src/fable-library-ts/Util.ts changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Util.ensureResolvedAsyncIterable at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/Util.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Python/Fable2Python.Transforms.fs src/Fable.Transforms/Python/Fable2Python.Transforms.fs:930 — src/Fable.Transforms/Python/Fable2Python.Transforms.fs changed 14 times in last 90 days, max cyclomatic complexity 66 in Transforms.transformOperation at line 930. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Python/Fable2Python.Transforms.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Cli/Entry.fs src/Fable.Cli/Entry.fs:370 — src/Fable.Cli/Entry.fs changed 21 times in last 90 days, max cyclomatic complexity 42 in Runner.Run at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Cli/Entry.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/fable-standalone/src/Worker/Worker.fs src/fable-standalone/src/Worker/Worker.fs:339 — src/fable-standalone/src/Worker/Worker.fs changed 12 times in last 90 days, max cyclomatic complexity 43 in Main.loop at line 339. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-standalone/src/Worker/Worker.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Compiler/ProjectCracker.fs src/Fable.Compiler/ProjectCracker.fs:1104 — src/Fable.Compiler/ProjectCracker.fs changed 12 times in last 90 days, max cyclomatic complexity 42 in ProjectCracker.getFullProjectOpts at line 1104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Compiler/ProjectCracker.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fickl.Declarations/Declarations.fs src/Fickl.Declarations/Declarations.fs:592 — src/Fickl.Declarations/Declarations.fs changed 20 times in last 90 days, max cyclomatic complexity 22 in Declarations.transformFile at line 592. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fickl.Declarations/Declarations.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Replacements.Util.fs src/Fable.Transforms/Replacements.Util.fs:1490 — src/Fable.Transforms/Replacements.Util.fs changed 14 times in last 90 days, max cyclomatic complexity 24 in Util.|UniversalFableCoreHelpers|_| at line 1490. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Replacements.Util.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/FableTransforms.fs src/Fable.Transforms/FableTransforms.fs:86 — src/Fable.Transforms/FableTransforms.fs changed 17 times in last 90 days, max cyclomatic complexity 18 in FableTransforms.isTailRecursive at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/FableTransforms.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Dart/Fable2Dart.fs src/Fable.Transforms/Dart/Fable2Dart.fs:826 — src/Fable.Transforms/Dart/Fable2Dart.fs changed 6 times in last 90 days, max cyclomatic complexity 44 in Util.transformValue at line 826. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Dart/Fable2Dart.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Transforms/Beam/Fable2Beam.Util.fs src/Fable.Transforms/Beam/Fable2Beam.Util.fs:199 — src/Fable.Transforms/Beam/Fable2Beam.Util.fs changed 4 times in last 90 days, max cyclomatic complexity 58 in Util.containsThisValue at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Beam/Fable2Beam.Util.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Compiler/MSBuildCrackerResolver.fs src/Fable.Compiler/MSBuildCrackerResolver.fs:352 — src/Fable.Compiler/MSBuildCrackerResolver.fs changed 9 times in last 90 days, max cyclomatic complexity 25 in MSBuildCrackerResolverModule.mkOptionsFromDesignTimeBuildAux at line 352. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Compiler/MSBuildCrackerResolver.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Fable.Cli/Pipeline.fs src/Fable.Cli/Pipeline.fs:281 — src/Fable.Cli/Pipeline.fs changed 8 times in last 90 days, max cyclomatic complexity 28 in PythonFileWriter.Fable.Transforms.Printer.Writer.MakeImportPath at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Cli/Pipeline.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 16 more in this group — see findings.md.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×40
  • NuGet dependencies are not locked docs/docs.fsproj:21 — docs/docs.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked notes/benchmarks/core-runtime/allocations/Allocations.csproj:3 — notes/benchmarks/core-runtime/allocations/Allocations.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked notes/benchmarks/watch-latency/throttle-race/ThrottleRace.fsproj:14 — notes/benchmarks/watch-latency/throttle-race/ThrottleRace.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked notes/benchmarks/workloads/beam/App.fsproj:10 — notes/benchmarks/workloads/beam/App.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked notes/benchmarks/workloads/py/App.fsproj:10 — notes/benchmarks/workloads/py/App.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Directory.Build.props:26 — src/Directory.Build.props declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.AST/Fable.AST.fsproj:15 — src/Fable.AST/Fable.AST.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.Analyzers/Fable.Analyzers.fsproj:13 — src/Fable.Analyzers/Fable.Analyzers.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.Build/Fable.Build.fsproj:49 — src/Fable.Build/Fable.Build.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.Cli/Fable.Cli.fsproj:62 — src/Fable.Cli/Fable.Cli.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.Compiler/Fable.Compiler.fsproj:39 — src/Fable.Compiler/Fable.Compiler.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.Core/Fable.Core.fsproj:31 — src/Fable.Core/Fable.Core.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.PublishUtils/Fable.PublishUtils.fsproj:12 — src/Fable.PublishUtils/Fable.PublishUtils.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fable.Transforms/Rust/AST/Tests/Rust.AST.Tests.fsproj:25 — src/Fable.Transforms/Rust/AST/Tests/Rust.AST.Tests.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/Fickl.Build/Fickl.Build.fsproj:21 — src/Fickl.Build/Fickl.Build.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fable-compiler-js/src/fable-compiler-js.fsproj:10 — src/fable-compiler-js/src/fable-compiler-js.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fable-standalone/src/Fable.Standalone.fsproj:13 — src/fable-standalone/src/Fable.Standalone.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fable-standalone/src/Worker/Worker.fsproj:14 — src/fable-standalone/src/Worker/Worker.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fable-standalone/test/bench-compiler/bench-compiler.fsproj:45 — src/fable-standalone/test/bench-compiler/bench-compiler.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fcs-fable/codegen/codegen.fsproj:49 — src/fcs-fable/codegen/codegen.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fcs-fable/fcs-fable.fsproj:427 — src/fcs-fable/fcs-fable.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fcs-fable/src/Compiler/FSharp.Compiler.Service.fsproj:599 — src/fcs-fable/src/Compiler/FSharp.Compiler.Service.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fcs-fable/test/bench/fcs-fable-bench.fsproj:23 — src/fcs-fable/test/bench/fcs-fable-bench.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/fcs-fable/test/fcs-fable-test.fsproj:21 — src/fcs-fable/test/fcs-fable-test.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • NuGet dependencies are not locked src/tools/ASTViewer/ASTViewer.fsproj:12 — src/tools/ASTViewer/ASTViewer.fsproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
  • + 15 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Repeated repair · ×29
  • Repeated repair: src/Fable.Transforms/FSharp2Fable.fs src/Fable.Transforms/FSharp2Fable.fs:4598 — src/Fable.Transforms/FSharp2Fable.fs changed 57 times in last 90 days and 31 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is Compiler.getInlineExprs at line 4598), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(ts): type a StringEnum case as its enum inside tuples”; “fix(js/ts): resolve a recursive trait call that ends in an overload taking obj”; “fix(js/ts): compile explicit constructors with a BCL base or [<AttachMembers>] correctly”; “fix(ts): emit valid type arguments for an SRTP call to a generic static member”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/FSharp2Fable.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/Fable.Transforms/State.fs src/Fable.Transforms/State.fs:216 — src/Fable.Transforms/State.fs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is ImplFile.From at line 216), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(all): match warning suppressions against normalized file names”; “fix(all): keep Fable warnings for files FCS spells with backslashes”; “fix(all): recompile inline users of a file with a signature (#5179)”; “fix(all): recompile files inlining from a file with a signature in watch mode”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/State.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/Decimal.ts src/fable-library-ts/Decimal.ts:333 — src/fable-library-ts/Decimal.ts changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is Decimal.op_Division at line 333), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts): support MidpointRounding in Math.Round (#5233)”; “fix(ts): fable-library type-checks under noUncheckedIndexedAccess”; “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts): honor NumberStyles when parsing floats (#5217)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/Decimal.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-rust/src/Native.rs src/fable-library-rust/src/Native.rs:405 — src/fable-library-rust/src/Native.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is fable_library_rust::Native::Native_::compare at line 405), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rust): Inline hashing, more Decimal tests (#5236)”; “fix(rust): Remove trailing comma from macro args (#5031)”; “fix(rust): Use common null storage (#4995)”; “fix(rust): Remove reflection registration on boxing (#4983)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-rust/src/Native.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/Async.ts src/fable-library-ts/Async.ts:194 — src/fable-library-ts/Async.ts changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is Async.runParallel at line 194), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(ts): fable-library type-checks under noUncheckedIndexedAccess”; “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts): respect maxDegreeOfParallelism and cancel on failure in Async.Parallel (#5098)”; “fix(js/ts): add missing Async and Task members, cancel timed-out StartChild, bind Async in task { } (#5097)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/Async.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-py/fable_library/async_.py src/fable-library-py/fable_library/async_.py:85 — src/fable-library-py/fable_library/async_.py changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is async_.call_on_owner_loop at line 85), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(python): preserve reusable replies and unit continuations (#5082)”; “fix(js/ts/python): preserve cancelled cleanup and generic unit callbacks (#5062)”; “fix(python): settle cancelled tasks awaited by async workflows (#5064)”; “fix(js/ts/python): settle cancelled delays and finalizers once (#5038)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-py/fable_library/async_.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/Numeric.ts src/fable-library-ts/Numeric.ts:79 — src/fable-library-ts/Numeric.ts changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is Numeric.bigintToExponential at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts): round exact midpoints to even in numeric formats (#5245)”; “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts): support %o in sprintf and interpolated strings (#5175)”; “fix(js): support %o in printf formats”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/Numeric.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/Fable.Compiler/Library.fs src/Fable.Compiler/Library.fs:169 — src/Fable.Compiler/Library.fs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is CodeServices.getAssemblyAutoOpenHints at line 169), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts): allow referencing a project that has an [<EntryPoint>]”; “fix(cli): explain an undefined name caused by an assembly-level AutoOpen”; “fix(js/ts): emit root-absolute import paths as written”; “fix(all): keep F# diagnostics for scripts on Windows (#5218)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Compiler/Library.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-rust/src/Reflection.rs src/fable-library-rust/src/Reflection.rs:78 — src/fable-library-rust/src/Reflection.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is fable_library_rust::Reflection::Reflection_::canonical_type_name at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rust): Remove reflection registration on boxing (#4983)”; “fix(rust): Support reflection for no_std (#4941)”; “fix(rust): Fix interface casting, move reflection into declarations (#4939)”; “fix(rust): Observables and Events cleanup (#4908)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-rust/src/Reflection.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/AsyncBuilder.ts src/fable-library-ts/AsyncBuilder.ts:214 — src/fable-library-ts/AsyncBuilder.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is AsyncBuilder.TryFinally at line 214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts/python): preserve cancelled cleanup and generic unit callbacks (#5062)”; “fix(js/ts/python): settle cancelled delays and finalizers once (#5038)”; “fix(js/ts/python): synchronize cancellation registrations (#5036)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/AsyncBuilder.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/BigInt.ts src/fable-library-ts/BigInt.ts:199 — src/fable-library-ts/BigInt.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is BigInt.parseStyled at line 199), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts): support NumberStyles in BigInteger.Parse and TryParse”; “fix(ts): fable-library type-checks under noUncheckedIndexedAccess”; “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts): parse numbers like .NET and raise its exception types (#5200)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/BigInt.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-beam/fable_list.erl src/fable-library-beam/fable_list.erl:835 — src/fable-library-beam/fable_list.erl changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is fable_list.random_sample_by at line 835), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts/python/dart/rust/beam): use FSharp.Core's algorithms for random collection functions (#5197)”; “fix(js/ts/python/dart/beam): add FSharp.Core's argument checks to collection functions (#5154)”; “fix(js/ts/python/dart/beam): align collection exception types with FSharp.Core (#5153)”; “fix(beam): preserve union collection ordering (#5016)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-beam/fable_list.erl`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/Double.ts src/fable-library-ts/Double.ts:10 — src/fable-library-ts/Double.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is Double.tryParse at line 10), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts): round float32 results like .NET (#5222)”; “fix(js/ts): honor NumberStyles when parsing floats (#5217)”; “fix(js/ts): parse numbers like .NET and raise its exception types (#5200)”; “fix(js): bitwise not, int64 shifts, MidpointRounding, NaN Equals and radix parsing”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/Double.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-py/fable_library/async_builder.py src/fable-library-py/fable_library/async_builder.py:64 — src/fable-library-py/fable_library/async_builder.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is CancellationToken.cancel at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts/python): preserve cancelled cleanup and generic unit callbacks (#5062)”; “fix(python): settle cancelled tasks awaited by async workflows (#5064)”; “fix(js/ts/python): settle cancelled delays and finalizers once (#5038)”; “fix(js/ts/python): synchronize cancellation registrations (#5036)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-py/fable_library/async_builder.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-beam/fable_utils.erl src/fable-library-beam/fable_utils.erl:288 — src/fable-library-beam/fable_utils.erl changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is fable_utils.get_enumerator at line 288), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(beam): keep parameter name in ArgumentException”; “fix(beam): normalize exception messages and string split separators (#5053)”; “fix(beam): preserve unmatched filtered exceptions (#5001)”; “fix(beam): support AggregateException (#4999)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-beam/fable_utils.erl`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-rust/src/Async.rs src/fable-library-rust/src/Async.rs:485 — src/fable-library-rust/src/Async.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is Task::poll at line 485), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rust): Cleanup AsyncBuilder and TaskBuilder (#4936)”; “fix(rust): Async perf: stop the async runtime sleeping, and add Parallel (#4920)”; “revert: "feat(rust): Observables, Events and IEnumerable (PR 6 of 7 Rust impro…"”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-rust/src/Async.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-dart/Array.fs src/fable-library-dart/Array.fs:1295 — src/fable-library-dart/Array.fs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is ArrayModule.randomSampleWithNext at line 1295), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts/python/dart/rust/beam): use FSharp.Core's algorithms for random collection functions (#5197)”; “fix(js/ts/python/dart/beam): add FSharp.Core's argument checks to collection functions (#5154)”; “fix(js/ts/python/dart/beam): align collection exception types with FSharp.Core (#5153)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-dart/Array.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/Fable.Transforms/Rust/AST/Rust.AST.Helpers.fs src/Fable.Transforms/Rust/AST/Rust.AST.Helpers.fs:340 — src/Fable.Transforms/Rust/AST/Rust.AST.Helpers.fs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is Literals.normalizeStringLiteral at line 340), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rust): Add main function for no_std (#5054)”; “fix(rust): Remove trailing comma from macro args (#5031)”; “fix(rust): Add support for System.Text.Rune (#4997)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/Fable.Transforms/Rust/AST/Rust.AST.Helpers.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/DateOnlyTemporal.ts src/fable-library-ts/DateOnlyTemporal.ts:109 — src/fable-library-ts/DateOnlyTemporal.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is DateOnlyTemporal.parse at line 109), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts): reject date and time members the runtime does not implement”; “fix(ts): fable-library type-checks under noUncheckedIndexedAccess”; “fix(ts): print annotation-only imports as type-only imports (#186)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/DateOnlyTemporal.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-rust/src/String.rs src/fable-library-rust/src/String.rs:657 — src/fable-library-rust/src/String.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is fable_library_rust::String::String_::getSlice at line 657), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rust): Inline hashing, more Decimal tests (#5236)”; “fix(rust): Add support for System.Text.Rune (#4997)”; “fix(rust): Less allocations when enumerating strings (#4970)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-rust/src/String.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/Encoding.ts src/fable-library-ts/Encoding.ts:26 — src/fable-library-ts/Encoding.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is Encoding.utf8_encode at line 26), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(ts): fable-library type-checks under noUncheckedIndexedAccess”; “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts): avoid full array copy in Encoding.GetString (#5069)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/Encoding.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-dart/List.fs src/fable-library-dart/List.fs:453 — src/fable-library-dart/List.fs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is ListModule.map3 at line 453), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts/python/dart/rust/beam): use FSharp.Core's algorithms for random collection functions (#5197)”; “fix(js/ts/python/dart/beam): add FSharp.Core's argument checks to collection functions (#5154)”; “fix(js/ts/python/dart/beam): align collection exception types with FSharp.Core (#5153)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-dart/List.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-py/fable_library/List.fs src/fable-library-py/fable_library/List.fs:470 — src/fable-library-py/fable_library/List.fs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is ListModule.map3 at line 470), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(js/ts/python/dart/rust/beam): use FSharp.Core's algorithms for random collection functions (#5197)”; “fix(js/ts/python/dart/beam): add FSharp.Core's argument checks to collection functions (#5154)”; “fix(js/ts/python/dart/beam): align collection exception types with FSharp.Core (#5153)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-py/fable_library/List.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-ts/MailboxProcessor.ts src/fable-library-ts/MailboxProcessor.ts:82 — src/fable-library-ts/MailboxProcessor.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is MailboxProcessor.receive at line 82), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(ts): print annotation-only imports as type-only imports (#186)”; “fix(js/ts/python): preserve cancelled cleanup and generic unit callbacks (#5062)”; “fix(js/ts/python): settle cancelled delays and finalizers once (#5038)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-ts/MailboxProcessor.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/fable-library-py/fable_library/mailbox_processor.py src/fable-library-py/fable_library/mailbox_processor.py:155 — src/fable-library-py/fable_library/mailbox_processor.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is MailboxProcessor.__process_events at line 155), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(python): preserve reusable replies and unit continuations (#5082)”; “fix(js/ts/python): preserve cancelled cleanup and generic unit callbacks (#5062)”; “fix(js/ts/python): settle cancelled delays and finalizers once (#5038)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 17:25:46 +00:00' --until='2026-11-15 17:25:46 +00:00' --full-history --no-merges -- src/fable-library-py/fable_library/mailbox_processor.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 4 more in this group — see findings.md.
D35 · Change Coupling · Change coupling · ×7
  • Change coupling: HashMap.rs ↔ HashSet.rs src/fable-library-rust/src/HashMap.rs:1 — `src/fable-library-rust/src/HashMap.rs` and `src/fable-library-rust/src/HashSet.rs` change together 100% of the time (14 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are `2594fdda` [Rust] Fix missing HashSet implementations and tests (#4523); `80527585` Support Rust 2024 language edition (#4063); `974f63e2` [Rust] Updated derived traits mapping (#3944) — run `git show` on any of them.
  • Change coupling: MutableMap.fs ↔ MutableSet.fs src/fable-library-ts/MutableMap.fs:1 — `src/fable-library-ts/MutableMap.fs` and `src/fable-library-ts/MutableSet.fs` change together 92% of the time (12 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `9517eafd` perf(js/ts): probe dictionary buckets without allocating (#5196); `3c4d43f3` perf(js/ts): apply validated runtime allocation reductions; `aea61b56` fix(js/ts): Fix Dictionary.Remove and HashSet.Remove to remove empty … — run `git show` on any of them.
  • Change coupling: Array.fs ↔ List.fs src/fable-library-rust/src/Array.fs:1 — `src/fable-library-rust/src/Array.fs` and `src/fable-library-rust/src/List.fs` change together 79% of the time (31 of the 39 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 31 shared commits counted here, the most recent 3 are `a3386bc8` [Rust] Add missing Random implementations and tests (#4478); `e381f0a4` [Rust] Add support for null strings (#4033); `09117e0b` [Rust] Updated some collections equality (#3945) — run `git show` on any of them.
  • Change coupling: Interfaces.fs ↔ Native.rs src/fable-library-rust/src/Interfaces.fs:1 — `src/fable-library-rust/src/Interfaces.fs` and `src/fable-library-rust/src/Native.rs` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `8a551bc9` feat(rust): System.Uri (PR 7 of 7 Rust improvements) (#4790); `c97042bf` revert: "feat(rust): Observables, Events and IEnumerable (PR 6 of 7 R…; `20175eea` feat(rust): Observables, Events and IEnumerable (PR 6 of 7 Rust impro… — run `git show` on any of them.
  • Change coupling: numeric.py ↔ string_.py src/fable-library-py/fable_library/numeric.py:1 — `src/fable-library-py/fable_library/numeric.py` and `src/fable-library-py/fable_library/string_.py` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `c27608b7` [Python] misc iteration on pyo3 strings ++ (#4130); `b31d07d4` [Python] Add task RunSynchronously (#3145) (at that commit the file was still `src/fable-library-py/fable_library/string.py`); `8512b275` [Python] typing fixes (#3068) (at that commit the file was still `src/fable-library-py/fable_library/string.py`) — run `git show` on any of them.
  • Change coupling: BigInt.rs ↔ Decimal.rs src/fable-library-rust/src/BigInt.rs:1 — `src/fable-library-rust/src/BigInt.rs` and `src/fable-library-rust/src/Decimal.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `705b6b70` fix(rust): Inline hashing, more Decimal tests (#5236); `6db7ed04` [Rust] Enabled some Comparison tests (#3442); `c3b8bdad` [JS/TS/Rust] Added bigint log, log2, log10, minMag, maxMag (#3433) — run `git show` on any of them.
  • Change coupling: HashSet.rs ↔ String.rs src/fable-library-rust/src/HashSet.rs:1 — `src/fable-library-rust/src/HashSet.rs` and `src/fable-library-rust/src/String.rs` change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `80527585` Support Rust 2024 language edition (#4063); `6db7ed04` [Rust] Enabled some Comparison tests (#3442); `6708396d` [Rust] Added Default for array, string, hashmap, hashset, guid (#3165) — run `git show` on any of them.
R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×5
  • Duplicated block (9 lines × 2 locations) src/fable-library-ts/AsyncBuilder.ts:221 — src/fable-library-ts/AsyncBuilder.ts:221 · src/fable-library-ts/AsyncBuilder.ts:230 — 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 locations) src/fable-library-ts/Date.ts:473 — src/fable-library-ts/Date.ts:473 · src/fable-library-ts/Date.ts:492 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (9 lines × 2 locations) src/fable-library-ts/Numeric.ts:57 — src/fable-library-ts/Numeric.ts:57 · src/fable-library-ts/Numeric.ts:67 — 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 locations) REDACTED:85 — REDACTED:85 · REDACTED:95 — 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 locations) src/fable-library-ts/Util.ts:269 — src/fable-library-ts/Util.ts:269 · src/fable-library-ts/Util.ts:330 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (12 lines × 2 locations) · ×3
  • Duplicated block (12 lines × 2 locations) src/fable-library-ts/Date.ts:104 — src/fable-library-ts/Date.ts:104 · src/fable-library-ts/Date.ts:227 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (12 lines × 2 locations) src/fable-library-ts/DateTimeFormat.ts:121 — src/fable-library-ts/DateTimeFormat.ts:121 · src/fable-library-ts/DateTimeFormat.ts:227 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (12 lines × 2 locations) src/fable-library-ts/Encoding.ts:108 — src/fable-library-ts/Encoding.ts:108 · src/fable-library-ts/Encoding.ts:143 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (10 lines × 2 locations) · ×3
  • Duplicated block (10 lines × 2 locations) src/fable-library-ts/Char.ts:81 — src/fable-library-ts/Char.ts:81 · src/fable-library-ts/Char.ts:93 — all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2 locations) src/fable-library-ts/DateTimeOffsetTemporal.ts:302 — src/fable-library-ts/DateTimeOffsetTemporal.ts:302 · src/fable-library-ts/DateTimeTemporal.ts:76 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (10 lines × 2 locations) src/fable-library-ts/TimeSpan.ts:38 — src/fable-library-ts/TimeSpan.ts:38 · src/fable-library-ts/TimeSpanTemporal.ts:60 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (7 lines × 2 locations) · ×3
  • Duplicated block (7 lines × 2 locations) src/fable-library-ts/DateTimeFormat.ts:381 — src/fable-library-ts/DateTimeFormat.ts:381 · src/fable-library-ts/DateTimeFormat.ts:391 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (7 lines × 2 locations) src/fable-library-ts/Decimal.ts:179 — src/fable-library-ts/Decimal.ts:179 · src/fable-library-ts/Decimal.ts:381 — 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 locations) src/fable-library-ts/Reflection.ts:493 — src/fable-library-ts/Reflection.ts:493 · src/fable-library-ts/Reflection.ts:501 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
PF3 · Async & latency hygiene · Sync-over-async blocking · ×2
  • Sync-over-async blocking src/fcs-fable/src/Compiler/Facilities/BuildGraph.fs:64 — `GetOrComputeValue` holds an async function that calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs.
  • Sync-over-async blocking src/fcs-fable/src/Compiler/Facilities/DiagnosticsLogger.fs:1069 — `Parallel` holds an async function that calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs.
R10 · Code Duplication · Duplicated block (21 lines × 3 locations) · ×2
  • Duplicated block (21 lines × 3 locations) src/fable-library-ts/Date.ts:178 — src/fable-library-ts/Date.ts:178 · src/fable-library-ts/Date.ts:211 · src/fable-library-ts/Date.ts:243 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (21 lines × 3 locations) src/fable-library-ts/DateTimeFormat.ts:178 — src/fable-library-ts/DateTimeFormat.ts:178 · src/fable-library-ts/DateTimeFormat.ts:211 · src/fable-library-ts/DateTimeFormat.ts:243 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (15 lines × 2 locations) · ×2
  • Duplicated block (15 lines × 2 locations) src/fable-library-ts/Date.ts:157 — src/fable-library-ts/Date.ts:157 · src/fable-library-ts/DateTimeFormat.ts:157 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (15 lines × 2 locations) src/fable-library-ts/Observable.ts:76 — src/fable-library-ts/Observable.ts:76 · src/fable-library-ts/Observable.ts:93 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (13 lines × 2 locations) · ×2
  • Duplicated block (13 lines × 2 locations) src/fable-library-ts/DateOnlyTemporal.ts:75 — src/fable-library-ts/DateOnlyTemporal.ts:75 · src/fable-library-ts/TimeOnlyTemporal.ts:120 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (13 lines × 2 locations) src/fable-library-ts/TimeSpan.ts:233 — src/fable-library-ts/TimeSpan.ts:233 · src/fable-library-ts/TimeSpanTemporal.ts:285 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (10 lines × 3 locations) · ×2
  • Duplicated block (10 lines × 3 locations) src/fable-library-ts/BitConverter.ts:90 — src/fable-library-ts/BitConverter.ts:90 · src/fable-library-ts/BitConverter.ts:102 · src/fable-library-ts/BitConverter.ts:114 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (10 lines × 3 locations) src/fable-library-ts/Date.ts:410 — src/fable-library-ts/Date.ts:410 · src/fable-library-ts/Date.ts:514 · src/fable-library-ts/DateTimeFormat.ts:436 — the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (6 lines × 2 locations) · ×2
  • Duplicated block (6 lines × 2 locations) src/fable-library-ts/CollectionUtil.ts:98 — src/fable-library-ts/CollectionUtil.ts:98 · src/fable-library-ts/CollectionUtil.ts:128 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (6 lines × 2 locations) src/fable-library-ts/CollectionUtil.ts:167 — src/fable-library-ts/CollectionUtil.ts:167 · src/fable-library-ts/Util.ts:1163 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity · Complex function parseRaw (cyclomatic 27, cognitive 50) · ×2
  • Complex function parseRaw (cyclomatic 27, cognitive 50) src/fable-library-ts/Date.ts:629 — parseRaw has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
  • Complex function parseRaw (cyclomatic 27, cognitive 50) src/fable-library-ts/DateTimeFormat.ts:559 — parseRaw has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
D17 · Explicit Debt · CommentedOutCode · ×1
  • CommentedOutCode REDACTED:44 — commented-out configuration entry `anthropic_api_key`
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×1
  • REDACTED
D35 · Change Coupling · Change-coupling hub · ×1
  • Change-coupling hub: Option.fs → Array.fs, List.fs, Native.rs src/fable-library-rust/src/Option.fs — `src/fable-library-rust/src/Option.fs` changes together with 3 other files — `src/fable-library-rust/src/Array.fs`, `src/fable-library-rust/src/List.fs`, `src/fable-library-rust/src/Native.rs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D35 · Change Coupling · Change coupling clique · ×1
  • Change coupling clique: Async.ts, Observable.ts, Timer.ts src/fable-library-ts/Async.ts — 3 files — `src/fable-library-ts/Async.ts`, `src/fable-library-ts/Observable.ts`, `src/fable-library-ts/Timer.ts` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
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 — no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half could not be measured — the jest suite in tests/React/ ran and not one test passed (No tests found, exiting with code 1), so the coverage would describe the failed run, not the code. 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.
R10 · Code Duplication · Duplicated block with local edits (139 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (139 matched lines × 2 locations) src/fable-library-ts/Date.ts:719 — src/fable-library-ts/Date.ts:719 · src/fable-library-ts/DateOffset.ts:110 — the two spans are one implementation copied and then locally edited — 972 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (83 lines × 2 locations) · ×1
  • Duplicated block (83 lines × 2 locations) src/fable-library-ts/Date.ts:629 — src/fable-library-ts/Date.ts:629 · src/fable-library-ts/DateTimeFormat.ts:559 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (57 lines × 2 locations) · ×1
  • Duplicated block (57 lines × 2 locations) src/fable-library-ts/Date.ts:304 — src/fable-library-ts/Date.ts:304 · src/fable-library-ts/DateTimeFormat.ts:292 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (45 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (45 matched lines × 2 locations) src/fable-library-ts/Transfer.ts:36 — src/fable-library-ts/Transfer.ts:36 · src/fable-library-ts/Transfer.ts:83 — the two spans are one implementation copied and then locally edited — 271 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (36 lines × 2 locations) · ×1
  • Duplicated block (36 lines × 2 locations) src/fable-library-ts/TimeSpan.ts:192 — src/fable-library-ts/TimeSpan.ts:192 · src/fable-library-ts/TimeSpanTemporal.ts:243 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (35 lines × 2 locations) · ×1
  • Duplicated block (35 lines × 2 locations) src/fable-library-ts/DateOnly.ts:76 — src/fable-library-ts/DateOnly.ts:76 · src/fable-library-ts/DateOnlyTemporal.ts:109 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (34 lines × 2 locations) · ×1
  • Duplicated block (34 lines × 2 locations) src/fable-library-ts/Date.ts:59 — src/fable-library-ts/Date.ts:59 · src/fable-library-ts/DateTimeFormat.ts:73 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block with local edits (21 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (21 matched lines × 2 locations) src/fable-library-ts/Rune.ts:210 — src/fable-library-ts/Rune.ts:210 · src/fable-library-ts/Util.ts:540 — the two spans are one implementation copied and then locally edited — 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (18 lines × 2 locations) · ×1
  • Duplicated block (18 lines × 2 locations) src/fable-library-ts/Util.ts:773 — src/fable-library-ts/Util.ts:773 · src/fable-library-ts/Util.ts:811 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (14 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (14 matched lines × 2 locations) src/fable-library-ts/Uri.ts:101 — src/fable-library-ts/Uri.ts:101 · src/fable-library-ts/Uri.ts:127 — the two spans are one implementation copied and then locally edited — 57 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (12 lines × 4 locations) · ×1
  • Duplicated block (12 lines × 4 locations) src/fable-library-ts/BitConverter.ts:21 — src/fable-library-ts/BitConverter.ts:21 · src/fable-library-ts/BitConverter.ts:35 · src/fable-library-ts/BitConverter.ts:49 · src/fable-library-ts/BitConverter.ts:63 — all 4 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (12 lines × 3 locations) · ×1
  • Duplicated block (12 lines × 3 locations) src/fable-library-ts/TimeOnly.ts:99 — src/fable-library-ts/TimeOnly.ts:99 · src/fable-library-ts/TimeSpan.ts:216 · src/fable-library-ts/TimeSpanTemporal.ts:267 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (12 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (12 matched lines × 2 locations) src/fable-library-ts/TimeOnly.ts:7 — src/fable-library-ts/TimeOnly.ts:7 · src/fable-library-ts/TimeOnlyTemporal.ts:38 — the two spans are one implementation copied and then locally edited — 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (11 lines × 2 locations) · ×1
  • Duplicated block (11 lines × 2 locations) src/fable-library-ts/Date.ts:613 — src/fable-library-ts/Date.ts:613 · src/fable-library-ts/DateTimeFormat.ts:494 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (9 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (9 matched lines × 2 locations) src/fable-library-ts/Types.ts:163 — src/fable-library-ts/Types.ts:163 · src/fable-library-ts/Types.ts:179 — the two spans are one implementation copied and then locally edited — 92 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (8 lines × 5 locations) · ×1
  • Duplicated block (8 lines × 5 locations) src/fable-library-ts/Char.ts:139 — src/fable-library-ts/Char.ts:139 · src/fable-library-ts/Char.ts:149 · src/fable-library-ts/Char.ts:159 · src/fable-library-ts/Char.ts:169 · +1 more site(s) not listed — all 5 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 65, cognitive 111) · ×1
  • Complex function (anonymous) (cyclomatic 65, cognitive 111) REDACTED:475 — (anonymous) has cyclomatic complexity 65 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function dateToStringWithCustomFormat (cyclomatic 65, cognitive 87) · ×1
  • Complex function dateToStringWithCustomFormat (cyclomatic 65, cognitive 87) src/fable-library-ts/Date.ts:94 — dateToStringWithCustomFormat has cyclomatic complexity 65 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function dateToStringWithCustomFormat (cyclomatic 58, cognitive 76) · ×1
  • Complex function dateToStringWithCustomFormat (cyclomatic 58, cognitive 76) src/fable-library-ts/DateTimeFormat.ts:111 — dateToStringWithCustomFormat has cyclomatic complexity 58 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function formatReplacement (cyclomatic 47, cognitive 58) · ×1
  • Complex function formatReplacement (cyclomatic 47, cognitive 58) REDACTED:238 — formatReplacement has cyclomatic complexity 47 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function hasValidDateParts (cyclomatic 31, cognitive 32) · ×1
  • Complex function hasValidDateParts (cyclomatic 31, cognitive 32) src/fable-library-ts/DateTimeFormat.ts:515 — hasValidDateParts has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function walk (cyclomatic 24, cognitive 28) · ×1
  • Complex function walk (cyclomatic 24, cognitive 28) src/fable-library-ts/quotation.ts:550 — walk has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function evaluate (cyclomatic 22, cognitive 26) · ×1
  • Complex function evaluate (cyclomatic 22, cognitive 26) src/fable-library-ts/quotation.ts:411 — evaluate has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parse (cyclomatic 21, cognitive 30) · ×1
  • Complex function parse (cyclomatic 21, cognitive 30) src/fable-library-ts/TimeSpanTemporal.ts:243 — parse has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function split (cyclomatic 20, cognitive 37) · ×1
  • Complex function split (cyclomatic 20, cognitive 37) REDACTED:827 — split has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parse (cyclomatic 20, cognitive 27) · ×1
  • Complex function parse (cyclomatic 20, cognitive 27) src/fable-library-ts/TimeSpan.ts:192 — parse has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function formatGeneral (cyclomatic 20, cognitive 26) · ×1
  • Complex function formatGeneral (cyclomatic 20, cognitive 26) REDACTED:429 — formatGeneral has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function exprToString (cyclomatic 20, cognitive 26) · ×1
  • Complex function exprToString (cyclomatic 20, cognitive 26) src/fable-library-ts/quotation.ts:518 — exprToString has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function sub (cyclomatic 20, cognitive 21) · ×1
  • Complex function sub (cyclomatic 20, cognitive 21) src/fable-library-ts/quotation.ts:604 — sub has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function toPlain (cyclomatic 18, cognitive 17) · ×1
  • Complex function toPlain (cyclomatic 18, cognitive 17) src/fable-library-ts/Transfer.ts:36 — toPlain has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function isValid (cyclomatic 17, cognitive 19) · ×1
  • Complex function isValid (cyclomatic 17, cognitive 19) src/fable-library-ts/Int32.ts:104 — isValid has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function ofPlain (cyclomatic 17, cognitive 15) · ×1
  • Complex function ofPlain (cyclomatic 17, cognitive 15) src/fable-library-ts/Transfer.ts:83 — ofPlain has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parse (cyclomatic 16, cognitive 36) · ×1
  • Complex function parse (cyclomatic 16, cognitive 36) src/fable-library-ts/DateOnly.ts:76 — parse has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function splitNumber (cyclomatic 14, cognitive 14) · ×1
  • Complex function splitNumber (cyclomatic 14, cognitive 14) src/fable-library-ts/NumberStyles.ts:35 — splitNumber has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parse (cyclomatic 13, cognitive 38) · ×1
  • Complex function parse (cyclomatic 13, cognitive 38) src/fable-library-ts/DateOnlyTemporal.ts:109 — parse has cyclomatic complexity 13 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 13, cognitive 18) · ×1
  • Complex function (anonymous) (cyclomatic 13, cognitive 18) src/fable-library-ts/Util.ts:280 — (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function op_Division (cyclomatic 13, cognitive 14) · ×1
  • Complex function op_Division (cyclomatic 13, cognitive 14) src/fable-library-ts/Decimal.ts:333 — op_Division has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function toString (cyclomatic 13, cognitive 13) · ×1
  • Complex function toString (cyclomatic 13, cognitive 13) src/fable-library-ts/TimeSpan.ts:169 — toString has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 12, cognitive 16) · ×1
  • Complex function (anonymous) (cyclomatic 12, cognitive 16) REDACTED:613 — (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function compare (cyclomatic 12, cognitive 16) · ×1
  • Complex function compare (cyclomatic 12, cognitive 16) src/fable-library-ts/Util.ts:981 — compare has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseStyled (cyclomatic 12, cognitive 13) · ×1
  • Complex function parseStyled (cyclomatic 12, cognitive 13) src/fable-library-ts/BigInt.ts:199 — parseStyled has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function fit (cyclomatic 12, cognitive 13) · ×1
  • Complex function fit (cyclomatic 12, cognitive 13) src/fable-library-ts/Decimal.ts:135 — fit has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function structuralHash (cyclomatic 12, cognitive 13) · ×1
  • Complex function structuralHash (cyclomatic 12, cognitive 13) src/fable-library-ts/Util.ts:816 — structuralHash has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 12, cognitive 12) · ×1
  • Complex function (anonymous) (cyclomatic 12, cognitive 12) REDACTED:165 — (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parse (cyclomatic 12, cognitive 10) · ×1
  • Complex function parse (cyclomatic 12, cognitive 10) src/fable-library-ts/TimeOnly.ts:88 — parse has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function roundToModeWithLimits (cyclomatic 12, cognitive 9) · ×1
  • Complex function roundToModeWithLimits (cyclomatic 12, cognitive 9) src/fable-library-ts/Util.ts:1064 — roundToModeWithLimits has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function equals (cyclomatic 11, cognitive 11) · ×1
  • Complex function equals (cyclomatic 11, cognitive 11) src/fable-library-ts/Util.ts:899 — equals has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function fromFloat (cyclomatic 11, cognitive 10) · ×1
  • Complex function fromFloat (cyclomatic 11, cognitive 10) src/fable-library-ts/Decimal.ts:520 — fromFloat has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function toString (cyclomatic 11, cognitive 10) · ×1
  • Complex function toString (cyclomatic 11, cognitive 10) src/fable-library-ts/TimeSpanTemporal.ts:221 — toString has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · src/fable-library-ts/Util.ts · ×1
  • src/fable-library-ts/Util.ts: 1372 lines of code src/fable-library-ts/Util.ts:1 — src/fable-library-ts/Util.ts has 1372 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 850 lines of code REDACTED:1 — REDACTED has 850 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/fable-library-ts/Date.ts · ×1
  • src/fable-library-ts/Date.ts: 839 lines of code src/fable-library-ts/Date.ts:1 — src/fable-library-ts/Date.ts has 839 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/fable-library-ts/Reflection.ts · ×1
  • src/fable-library-ts/Reflection.ts: 740 lines of code src/fable-library-ts/Reflection.ts:1 — src/fable-library-ts/Reflection.ts has 740 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/fable-library-ts/quotation.ts · ×1
  • src/fable-library-ts/quotation.ts: 617 lines of code src/fable-library-ts/quotation.ts:1 — src/fable-library-ts/quotation.ts has 617 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/fable-library-ts/DateTimeFormat.ts · ×1
  • src/fable-library-ts/DateTimeFormat.ts: 589 lines of code src/fable-library-ts/DateTimeFormat.ts:1 — src/fable-library-ts/DateTimeFormat.ts has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/fable-library-ts/Decimal.ts · ×1
  • src/fable-library-ts/Decimal.ts: 562 lines of code src/fable-library-ts/Decimal.ts:1 — src/fable-library-ts/Decimal.ts has 562 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R7 · Dead Code · Dead file (~72 LoC) · ×1
  • Dead file (~72 LoC) REDACTED — no import path from any entry point (3 application, 11 tooling, 52 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~31 LoC) · ×1
  • Dead file (~31 LoC) src/fable-standalone/src/Worker/util.js — no import path from any entry point (3 application, 11 tooling, 52 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unused dependency 'ghreleases' · ×1
  • Unused dependency 'ghreleases' package.json:28 — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@fable-org/fable-metadata' · ×1
  • Unused dependency '@fable-org/fable-metadata' src/fable-compiler-js/package.json:27 — Declared in src/fable-compiler-js/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@fable-org/fable-standalone' · ×1
  • Unused dependency '@fable-org/fable-standalone' src/fable-compiler-js/package.json:28 — Declared in src/fable-compiler-js/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'esbuild' · ×1
  • Unused dependency 'esbuild' src/fable-compiler-js/package.json:31 — Declared in src/fable-compiler-js/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'fable-compiler-js' · ×1
  • Unused dependency 'fable-compiler-js' src/fcs-fable/test/package.json:13 — Declared in src/fcs-fable/test/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@matthid/source-map-visualization' · ×1
  • Unused dependency '@matthid/source-map-visualization' src/tools/source-maps/package.json:7 — Declared in src/tools/source-maps/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'source-map-support' · ×1
  • Unused dependency 'source-map-support' src/tools/source-maps/package.json:8 — Declared in src/tools/source-maps/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@fluentui/react' · ×1
  • Unused dependency '@fluentui/react' tests/React/package.json:12 — Declared in tests/React/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@testing-library/react' · ×1
  • Unused dependency '@testing-library/react' tests/React/package.json:14 — Declared in tests/React/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@testing-library/user-event' · ×1
  • Unused dependency '@testing-library/user-event' tests/React/package.json:15 — Declared in tests/React/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Minor — 153 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×40
  • Duplicated predicate src/fcs-fable/src/Compiler/Checking/PostInferenceChecks.fs:1521 — `(ilMethRef.CallingConv.IsInstance || ilMethRef.CallingConv.IsInstanceExplicit) && not args.IsEmpty` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Checking/PostInferenceChecks.fs, src/fcs-fable/src/Compiler/Checking/TailCallChecks.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/fable-library-beam/Range.fs:15 — `(stepGreaterThanZero && comparedWithLast <= 0) || (not stepGreaterThanZero && comparedWithLast >= 0)` appears character-identically in 4 files — src/fable-library-beam/Range.fs, src/fable-library-dart/Range.fs, src/fable-library-py/fable_library/Range.fs, src/fable-library-ts/Range.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/fable-library-ts/Seq.fs:122 — `FABLE_COMPILER_TYPESCRIPT || FABLE_COMPILER_JAVASCRIPT` appears character-identically in 2 files — src/fable-library-ts/Seq.fs, src/fable-library-ts/System.Collections.Generic.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/fable-library-dart/Array.fs:777 — `array1.Length <> array2.Length || array2.Length <> array3.Length` appears character-identically in 2 files — src/fable-library-dart/Array.fs, src/fable-library-ts/Array.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/Fable.Transforms/Dart/Fable2Dart.fs:349 — `ctx.UsedNames.RootScope.Contains(name) || ctx.UsedNames.CurrentDeclarationScope.Contains(name)` appears character-identically in 3 files — src/Fable.Transforms/Dart/Fable2Dart.fs, src/Fable.Transforms/Python/Fable2Python.Util.fs, src/Fable.Transforms/Rust/Fable2Rust.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/Fable.Transforms/Babel/Fable2Babel.fs:2049 — `ctx.UsedNames.RootScope.Contains(name) || ctx.UsedNames.DeclarationScopes.Contains(name)` appears character-identically in 3 files — src/Fable.Transforms/Babel/Fable2Babel.fs, src/Fable.Transforms/Dart/Fable2Dart.fs, src/Fable.Transforms/Rust/Fable2Rust.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/Fable.Transforms/Babel/Fable2Babel.fs:8863 — `entries.Length > 1 && not isValidGetterSetterPair` appears character-identically in 2 files — src/Fable.Transforms/Babel/Fable2Babel.fs, src/Fable.Transforms/Python/Fable2Python.Transforms.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/Fable.Cli/Entry.fs:539 — `file.EndsWith(".fs", StringComparison.Ordinal) || file.EndsWith(".fsx", StringComparison.Ordinal)` appears character-identically in 2 files — src/Fable.Cli/Entry.fs, src/Fable.Cli/Main.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/Fable.Transforms/Dart/Replacements.fs:4273 — `fullName.StartsWith("Fable.Core.", StringComparison.Ordinal) && fullName.EndsWith("Attribute", StringComparison.Ordinal)` appears character-identically in 2 files — src/Fable.Transforms/Dart/Replacements.fs, src/Fable.Transforms/Replacements.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/fcs-fable/src/Compiler/Checking/CheckFormatStrings.fs:451 — `g.checkNullness && g.langFeatureNullness` appears character-identically in 4 files — src/fcs-fable/src/Compiler/Checking/CheckFormatStrings.fs, src/fcs-fable/src/Compiler/Checking/Expressions/CheckExpressions.fs, src/fcs-fable/src/Compiler/CodeGen/EraseUnions.fs, src/fcs-fable/src/Compiler/CodeGen/IlxGen.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/fcs-fable/src/Compiler/Checking/PostInferenceChecks.fs:2602 — `g.langFeatureNullness && g.checkNullness` appears character-identically in 4 files — src/fcs-fable/src/Compiler/Checking/PostInferenceChecks.fs, src/fcs-fable/src/Compiler/Checking/import.fs, src/fcs-fable/src/Compiler/CodeGen/IlxGen.fs, src/fcs-fable/src/Compiler/CodeGen/IlxGenSupport.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/fable-library-dart/System.Text.fs:106 — `i < buf.Count && len + buf[i].Length <= index` appears character-identically in 4 files — src/fable-library-dart/System.Text.fs, src/fable-library-py/fable_library/System.Text.fs, src/fable-library-rust/src/System.Text.fs, src/fable-library-ts/System.Text.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/fable-library-beam/Seq.fs:1286 — `if (isDone || i < index) && e.MoveNext()` appears character-identically in 5 files — src/fable-library-beam/Seq.fs, src/fable-library-dart/Seq.fs, src/fable-library-py/fable_library/Seq.fs, src/fable-library-rust/src/Seq.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/Fable.Transforms/FSharp2Fable.Util.fs:4302 — `memb.IsDispatchSlot || memb.IsOverrideOrExplicitInterfaceImplementation` appears character-identically in 2 files — src/Fable.Transforms/FSharp2Fable.Util.fs, src/Fable.Transforms/Rust/Fable2Rust.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/fable-library-beam/Seq.fs:543 — `not found && e1.MoveNext() && e2.MoveNext()` appears character-identically in 5 files — src/fable-library-beam/Seq.fs, src/fable-library-dart/Seq.fs, src/fable-library-py/fable_library/Seq.fs, src/fable-library-rust/src/Seq.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/fcs-fable/src/Compiler/Checking/ConstraintSolver.fs:2217 — `not minfo.IsDispatchSlot && not minfo.IsVirtual && minfo.IsInstance` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Checking/ConstraintSolver.fs, src/fcs-fable/src/Compiler/Checking/PostInferenceChecks.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/Fable.Compiler/ProjectCracker.fs:465 — `path.Contains("*") || path.Contains("?")` appears character-identically in 2 files — src/Fable.Compiler/ProjectCracker.fs, src/fable-compiler-js/src/Platform.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/fcs-fable/src/Compiler/Driver/ScriptClosure.fs:440 — `result.StdOut.Length > 0 || result.StdError.Length > 0` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Driver/ScriptClosure.fs, src/fcs-fable/src/Compiler/Interactive/fsi.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/fable-library-dart/Array.fs:207 — `source1.Length <> source2.Length || source2.Length <> source3.Length` appears character-identically in 3 files — src/fable-library-dart/Array.fs, src/fable-library-rust/src/Array.fs, src/fable-library-ts/Array.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/Fable.Cli/Printers.fs:36 — `t.HasTypeDefinition && t.TypeDefinition.TryFullName.IsSome` appears character-identically in 2 files — src/Fable.Cli/Printers.fs, src/fcs-fable/ast_print.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/fcs-fable/src/Compiler/CodeGen/IlxGen.fs:5703 — `tc.IsIsReferenceType || tc.IsSupportsNull` appears character-identically in 2 files — src/fcs-fable/src/Compiler/CodeGen/IlxGen.fs, src/fcs-fable/src/Compiler/TypedTree/TypedTreeOps.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/fcs-fable/src/Compiler/Driver/fsc.fs:533 — `tcConfigB.utf8output && Console.OutputEncoding <> Encoding.UTF8` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Driver/fsc.fs, src/fcs-fable/src/Compiler/Interactive/fsi.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/fcs-fable/src/Compiler/Service/IncrementalBuild.fs:851 — `tcState.CreatesGeneratedProvidedTypes || hasTypeProviderAssemblyAttrib` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Service/IncrementalBuild.fs, src/fcs-fable/src/Compiler/Service/TransparentCompiler.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/fcs-fable/src/Compiler/Utilities/sformat.fs:464 — `ty.IsArray || ty.IsByRef || ty.IsPointer` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Utilities/sformat.fs, src/fcs-fable/src/Compiler/Utilities/sr.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/fcs-fable/src/Compiler/Checking/AugmentWithHashCompare.fs:1430 — `tycon.IsRecordTycon || tycon.IsStructOrEnumTycon` appears character-identically in 2 files — src/fcs-fable/src/Compiler/Checking/AugmentWithHashCompare.fs, src/fcs-fable/src/Compiler/TypedTree/TypedTreeOps.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.
  • + 15 more in this group — see findings.md.
D12 · Dependency Hygiene · Outdated (npm) · ×31
  • Outdated (npm): @asamuzakjp/css-color — @asamuzakjp/css-color 3.2.0 → 7.2.0 available.
  • Outdated (npm): @types/jsdom — @types/jsdom 21.1.7 → 30.0.0 available.
  • Outdated (npm): ansi-escapes — ansi-escapes 4.3.2 → 7.3.0 available.
  • Outdated (npm): bl — bl 3.0.1 → 7.0.15 available.
  • Outdated (npm): camelcase — camelcase 6.3.0 → 10.0.0 available.
  • Outdated (npm): chokidar — chokidar 3.6.0 → 6.0.0 available.
  • Outdated (npm): commander — commander 2.20.3 → 15.1.0 available.
  • Outdated (npm): data-urls — data-urls 5.0.0 → 8.0.0 available.
  • Outdated (npm): entities — entities 6.0.1 → 9.0.0 available.
  • Outdated (npm): escape-string-regexp — escape-string-regexp 2.0.0 → 5.0.0 available.
  • Outdated (npm): execa — execa 5.1.1 → 10.2.1 available.
  • Outdated (npm): find-up — find-up 4.1.0 → 8.0.0 available.
  • Outdated (npm): get-stream — get-stream 6.0.1 → 9.0.1 available.
  • Outdated (npm): html-encoding-sniffer — html-encoding-sniffer 4.0.0 → 7.0.0 available.
  • Outdated (npm): human-signals — human-signals 2.1.0 → 8.0.1 available.
  • Outdated (npm): js-tokens — js-tokens 4.0.0 → 10.0.0 available.
  • Outdated (npm): jsdom tests/React/package.json:7 — jsdom 26.1.0 → 31.0.1 available.
  • Outdated (npm): json-parse-even-better-errors — json-parse-even-better-errors 2.3.1 → 6.0.0 available.
  • Outdated (npm): locate-path — locate-path 5.0.0 → 8.0.0 available.
  • Outdated (npm): mimic-fn — mimic-fn 2.1.0 → 5.0.0 available.
  • Outdated (npm): onetime — onetime 5.1.2 → 8.0.0 available.
  • Outdated (npm): p-limit — p-limit 3.1.0 → 7.3.3 available.
  • Outdated (npm): p-locate — p-locate 4.1.0 → 7.0.0 available.
  • Outdated (npm): parse-json — parse-json 5.2.0 → 8.3.0 available.
  • Outdated (npm): pkg-dir — pkg-dir 4.2.0 → 9.0.0 available.
  • + 6 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned file · ×26
  • Orphaned file src/fcs-fable/service_slim.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/Fable.Transforms/Php/PhpPrinter.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/fcs-fable/src/Compiler/Checking/AccessibilityLogic.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/fcs-fable/src/Compiler/TypedTree/QuotationPickler.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/fcs-fable/src/Compiler/Service/ServiceAssemblyContent.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/fcs-fable/src/Compiler/Utilities/lib.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/fable-library-dart/Date.dart: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/fable-library-php/Map.php: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/fable-library-php/List.php: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/fcs-fable/src/Compiler/Optimize/LowerLocalMutables.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/fcs-fable/src/Compiler/Symbols/SymbolPatterns.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/fcs-fable/src/Compiler/TypedTree/tainted.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/Fable.Transforms/Replacements.Api.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/fable-library-ts/Uri.ts: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/fcs-fable/src/Compiler/Service/ExternalSymbol.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/fable-library-dart/RegExp.dart: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/fcs-fable/src/Compiler/Utilities/EditDistance.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/fcs-fable/ast_print.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/fable-library-php/Serialization.php: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/fable-library-php/Util.php: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/Fable.Transforms/Printer.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/tools/ASTViewer/ASTViewer.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/fcs-fable/src/Compiler/Facilities/ReferenceResolver.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/Fable.AST/Common.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/fable-library-php/Seq.php: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.
  • + 1 more in this group — see findings.md.
AX6 · Interface segregation · Fat interface · ×13
  • Fat interface: NumericArray (19 required operations) src/fable-library-ts/Util.ts:9 — `NumericArray` declares 19 required operations under just 15 distinct name(s): `every`, `fill`, `filter`, `find`, `findIndex`, `forEach`, `indexOf`, `join`, `lastIndexOf`, `reduce`, `reduce`, `reduce`, `reduceRight`, `reduceRight`, `reduceRight`, `reverse`, `slice`, `some`, `sort`. Counted over its REQUIRED operations — a method signature or a function-typed property with no `?`, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 19 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 19 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface.
  • Fat interface: ObjectConstructor (18 abstract members) src/Fable.Core/Fable.Core.JS.fs:196 — `ObjectConstructor` declares 18 abstract members: `assign`, `create`, `defineProperties`, `defineProperty`, `entries`, `freeze`, `getOwnPropertyDescriptor`, `getOwnPropertyNames`, `getPrototypeOf`, `is`, `isExtensible`, `isFrozen`, `isSealed`, `keys`, `preventExtensions`, `seal`, `setPrototypeOf`, `values`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: Math (43 abstract members) src/Fable.Core/Fable.Core.JS.fs:229 — `Math` declares 43 abstract members: `abs`, `acos`, `acosh`, `asin`, `asinh`, `atan`, `atan2`, `atanh`, `cbrt`, `ceil`, `clz32`, `cos`, `cosh`, `exp`, `expm1`, `floor`, `fround`, `hypot`, `imul`, `log`, `log10`, `log1p`, `log2`, `max`, `min`, `pow`, `random`, `round`, `sign`, `sin`, `sinh`, `sqrt`, `tan`, `tanh`, `trunc`, `PI`, `LN2`, `E`, `LN10`, `SQRT2`, and 3 more. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: Date (43 abstract members) src/Fable.Core/Fable.Core.JS.fs:274 — `Date` declares 43 abstract members: `getDate`, `getDay`, `getFullYear`, `getHours`, `getMilliseconds`, `getMinutes`, `getMonth`, `getSeconds`, `getTime`, `getTimezoneOffset`, `getUTCDate`, `getUTCDay`, `getUTCFullYear`, `getUTCHours`, `getUTCMilliseconds`, `getUTCMinutes`, `getUTCMonth`, `getUTCSeconds`, `setDate`, `setFullYear`, `setHours`, `setMilliseconds`, `setMinutes`, `setMonth`, `setSeconds`, `setTime`, `setUTCDate`, `setUTCFullYear`, `setUTCHours`, `setUTCMilliseconds`, `setUTCMinutes`, `setUTCMonth`, `setUTCSeconds`, `toDateString`, `toISOString`, `toJSON`, `toLocaleDateString`, `toLocaleString`, `toLocaleTimeString`, `toString`, and 3 more. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: DataView (23 abstract members) src/Fable.Core/Fable.Core.JS.fs:472 — `DataView` declares 23 abstract members: `getBigInt64`, `getBigUint64`, `getFloat32`, `getFloat64`, `getInt16`, `getInt32`, `getInt8`, `getUint16`, `getUint32`, `getUint8`, `setBigInt64`, `setBigUint64`, `setFloat32`, `setFloat64`, `setInt16`, `setInt32`, `setInt8`, `setUint16`, `setUint32`, `setUint8`, `byteLength`, `byteOffset`, `buffer`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: TypedArray`1<T> (19 abstract members) src/Fable.Core/Fable.Core.JS.fs:523 — `TypedArray`1<T>` declares 19 abstract members: `fill`, `filter`, `find`, `findIndex`, `forEach`, `includes`, `indexOf`, `lastIndexOf`, `map`, `reduce`, `reduceRight`, `reverse`, `set`, `slice`, `some`, `sort`, `subarray`, `values`, `Item`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: Console (19 abstract members) src/Fable.Core/Fable.Core.JS.fs:750 — `Console` declares 19 abstract members: `assert`, `clear`, `count`, `debug`, `dir`, `dirxml`, `error`, `group`, `groupCollapsed`, `groupEnd`, `info`, `log`, `profile`, `profileEnd`, `table`, `time`, `timeEnd`, `trace`, `warn`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: MemberFunctionOrValue (26 abstract members) src/Fable.AST/Fable.fs:119 — `MemberFunctionOrValue` declares 26 abstract members: `IsPublic`, `FullName`, `IsConstructor`, `IsSetter`, `ImplementedAbstractSignatures`, `IsOverrideOrExplicitInterfaceImplementation`, `IsGetter`, `ApparentEnclosingEntity`, `ReturnParameter`, `Attributes`, `CompiledName`, `IsInstance`, `IsValue`, `GenericParameters`, `IsInline`, `IsInternal`, `IsProperty`, `DeclaringEntity`, `HasSpread`, `IsExtension`, `IsMutable`, `CurriedParameterGroups`, `IsDispatchSlot`, `DisplayName`, `IsPrivate`, `XmlDoc`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: Entity (29 abstract members) src/Fable.AST/Fable.fs:149 — `Entity` declares 29 abstract members: `TryFindMember`, `DeclaringEntity`, `IsEnum`, `GenericParameters`, `CompiledName`, `DisplayName`, `MembersFunctionsAndValues`, `IsFSharpRecord`, `BaseType`, `AllInterfaces`, `IsFSharpUnion`, `Attributes`, `IsFSharpExceptionDeclaration`, `IsInternal`, `IsNamespace`, `IsFSharpModule`, `DeclaredInterfaces`, `IsByRef`, `IsInterface`, `FSharpFields`, `IsFSharpAbbreviation`, `IsAbstractClass`, `UnionCases`, `IsMeasure`, `IsPublic`, `IsPrivate`, `Ref`, `IsValueType`, `FullName`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: Compiler (19 abstract members) src/Fable.Transforms/Global/Compiler.fs:70 — `Compiler` declares 19 abstract members: `AddLog`, `AddSignatureDependency`, `AddWatchDependency`, `GetImplementationFile`, `GetInlineExpr`, `GetRootModule`, `IncrementCounter`, `TryGetEntity`, `WillPrecompileInlineFunction`, `IsPrecompilingInlineFunction`, `OutputType`, `SourceFiles`, `Plugins`, `OutputDir`, `ProjectFile`, `CurrentFile`, `Options`, `ProjectOptions`, `LibraryDir`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IBabelCompiler (18 abstract members) src/Fable.Transforms/Babel/Fable2Babel.fs:77 — `IBabelCompiler` declares 18 abstract members: `GetAllAllTopDirectivesPrologue`, `GetAllImports`, `GetImportAs`, `GetImportExpr`, `GetRecordCopier`, `GetRecordCopierDeclarations`, `GetSymbolDeclarations`, `GetSymbolKey`, `InTypePosition`, `MarkValueImport`, `SaveTopDirectivePrologue`, `TransformAsExpr`, `TransformAsStatements`, `TransformFunction`, `TransformImport`, `UsesRecordCopier`, `WarnOnlyOnce`, `IsTypeScript`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IPhpCompiler (27 abstract members) src/Fable.Transforms/Php/Fable2Php.fs:11 — `IPhpCompiler` declares 27 abstract members: `AddEntityName`, `AddImport`, `AddLocalVar`, `AddRequire`, `AddType`, `AddUse`, `ClearRequire`, `ClearThisArgument`, `EnterBreakable`, `FindLableLevel`, `GetEntityName`, `IsImport`, `IsThisArgument`, `LeaveBreakable`, `MakeUniqueVar`, `NewScope`, `RestoreScope`, `SetDecisionTargets`, `SetPhpNamespace`, `SetThisArgument`, `TryFindType`, `UseVar`, `UseVarByRef`, `NsUse`, `PhpNamespace`, `DecisionTargets`, `Require`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IBackgroundCompiler (25 abstract members) src/fcs-fable/src/Compiler/Service/BackgroundCompiler.fs:36 — `IBackgroundCompiler` declares 25 abstract members: `BeforeBackgroundFileCheck`, `FileChecked`, `FileParsed`, `FrameworkImportsCache`, `ProjectChecked`, `CheckFileInProject`, `CheckFileInProjectAllowingStaleCachedResults`, `ClearCache`, `ClearCaches`, `DownsizeCaches`, `FindReferencesInFile`, `GetAssemblyData`, `GetBackgroundCheckResultsForFileInProject`, `GetBackgroundParseResultsForFileInProject`, `GetCachedCheckFileResult`, `GetProjectOptionsFromScript`, `GetProjectSnapshotFromScript`, `GetSemanticClassificationForFile`, `InvalidateConfiguration`, `NotifyFileChanged`, `NotifyProjectCleaned`, `ParseAndCheckFileInProject`, `ParseAndCheckProject`, `ParseFile`, `TryGetRecentCheckResultsForFile`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
D31 · IaC & Container Security · Low IaC · ×13
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D16 · Bus Factor · Off-boarding risk · ×5
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 27 significant file(s) lose their only recent owner: src/Fable.Transforms/Beam/Fable2Beam.fs, src/fable-library-py/src/native_array.rs, src/Fable.Transforms/Beam/Prelude.fs, src/fable-library-beam/fable_date.erl, src/Fable.Transforms/Beam/Fable2Beam.Util.fs, src/Fable.Core/Fable.Core.Py.fs, src/fable-library-beam/fable_async.erl, src/Fable.Transforms/Beam/ErlangPrinter.fs (+19 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: src/fable-standalone/src/Main.fs, src/fable-standalone/src/Worker/Worker.fs, src/fcs-fable/TcImports_shim.fs, src/fable-standalone/src/Interfaces.fs, src/fable-standalone/src/Worker/Shared.fs, src/Fable.Build/Quicktest/TypeScript.fs, src/Fable.Build/Package.fs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 5 significant file(s) lose their only recent owner: src/fable-library-rust/src/String.rs, src/fable-library-rust/src/NativeArray.rs, src/fable-library-rust/src/Interop.rs, src/fable-library-rust/src/HashMap.rs, src/fable-library-rust/src/Rune.rs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 3 significant file(s) lose their only recent owner: src/fable-library-dart/quotation.dart, src/fable-library-rust/src/QuotationTypes.fs, src/fable-library-rust/src/Interfaces.fs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #5 — If anonymized user #5 becomes unavailable, 3 significant file(s) lose their only recent owner: src/Fable.Core/Fable.Core.JsInterop.fs, src/fable-library-ts/Option.ts, src/fable-library-ts/Range.fs. Pair on, review, or document these before any departure.
D19 · Documentation Quality · Documentation · ×4
  • Documentation: no build, run or usage example src/fable-library-py/README.md:1 — `fable-library-py` is a published crate (`[package]` without `publish = false`) and neither `src/fable-library-py/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
  • Documentation: no build, run or usage example src/fable-library-rust/README.md:1 — `fable-library-rust` is a published crate (`[package]` without `publish = false`) and neither `src/fable-library-rust/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
  • Documentation: no build, run or usage example src/fable-library-ts/README.md:1 — `fable-library-ts` is a published package (`package.json` without `"private": true`) and neither `src/fable-library-ts/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
  • Documentation: no build, run or usage example src/fable-metadata/README.md:1 — `fable-metadata` is a published package (`package.json` without `"private": true`) and neither `src/fable-metadata/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D21 · Naming Consistency · `test Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` · ×2
  • `test Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` tests/Beam/ArithmeticTests.fs:790 — 173 of 176 names in project docs spell the token `No` (173 of 176; unit: names in project docs containing `No`). Peers: CustomOptions.UseNoPrefixMsgStyle (src/Fable.Cli/CustomLogging.fs:17); ErlangPrinter.stripNoEffect (src/Fable.Transforms/Beam/ErlangPrinter.fs:10); Helpers.hasNoOverloadSuffixOnMember (src/Fable.Transforms/FSharp2Fable.Util.fs:861); Helpers.hasNoOverloadSuffix (src/Fable.Transforms/FSharp2Fable.Util.fs:889); Util.checkNoOverloadSuffix (src/Fable.Transforms/FSharp2Fable.Util.fs:2548). Rename to `test Bitwise NoT on large unsigned integer works`. [rule N6]
  • `test Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` tests/Python/TestArithmetic.fs:285 — 173 of 176 names in project docs spell the token `No` (173 of 176; unit: names in project docs containing `No`). Peers: CustomOptions.UseNoPrefixMsgStyle (src/Fable.Cli/CustomLogging.fs:17); ErlangPrinter.stripNoEffect (src/Fable.Transforms/Beam/ErlangPrinter.fs:10); Helpers.hasNoOverloadSuffixOnMember (src/Fable.Transforms/FSharp2Fable.Util.fs:861); Helpers.hasNoOverloadSuffix (src/Fable.Transforms/FSharp2Fable.Util.fs:889); Util.checkNoOverloadSuffix (src/Fable.Transforms/FSharp2Fable.Util.fs:2548). Rename to `test Bitwise NoT on large unsigned integer works`. [rule N6]
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×2
  • Hand-rolled JSON/XML parsing via regex src/Fable.Transforms/Printer.fs:12 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. F# runs on .NET, which ships a real parser for it (System.Text.Json, System.Xml.Linq); use it here.
  • Hand-rolled JSON/XML parsing via regex src/Fable.PublishUtils/PublishUtils.fs:367 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. F# runs on .NET, which ships a real parser for it (System.Text.Json, System.Xml.Linq); use it here.
D12 · Dependency Hygiene · Outdated · ×1
  • Outdated: FSharp.Core docs/docs.fsproj:30 — FSharp.Core 4.7.2 → 11.0.101 available (referenced by Fable.Core).
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (47 single-owned of 539 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; 539 of the 705 production source files in this repository met that bar). They are anonymized user #6 (2 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/fable-library-dart/Async.dart, src/fable-library-dart/AsyncBuilder.dart.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found docs/docs.fsproj:3 — 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/docs.fsproj` makes this repository a deployable product (line 3).
D21 · Naming Consistency · `messageID` spells `ID` where 61 names in the project spell it `Id` · ×1
  • `messageID` spells `ID` where 61 names in the project spell it `Id` src/fcs-fable/SR.fs:33 — 61 of 62 names in project docs spell the token `Id` (61 of 62; unit: names in project docs containing `Id`). Peers: Annotation.makeFableLibImportTypeId (src/Fable.Transforms/Babel/Fable2Babel.fs:1313); Annotation.makeImportTypeId (src/Fable.Transforms/Python/Fable2Python.Annotation.fs:546); SR.nrUnexpectedEmptyLongId (src/fcs-fable/codegen/FSComp.fs:1011); SR.ilSignInvalidAlgId (src/fcs-fable/codegen/FSComp.fs:1140); SR.tcAnonRecdDuplicateFieldId (src/fcs-fable/codegen/FSComp.fs:1700). Rename to `messageId`. [rule N6]
D21 · Naming Consistency · `et_STRING` spells `STRING` where 41 names in the project spell it `string` · ×1
  • `et_STRING` spells `STRING` where 41 names in the project spell it `string` src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:328 — 41 of 42 names in project docs spell the token `string` (41 of 42; unit: names in project docs containing `string`). Peers: ToString.to_string (src/Fable.Transforms/Rust/AST/Rust.AST.Adapters.fs:34); Printer.scan_string (src/Fable.Transforms/Rust/AST/Rust.AST.Pretty.fs:373); Printer.print_string (src/Fable.Transforms/Rust/AST/Rust.AST.Pretty.fs:561); State.binop_to_string (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:189); State.doc_comment_to_string (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:202). Rename to `et_string`. [rule N6]
D21 · Naming Consistency · `nt_STRUCT` spells `STRUCT` where 12 names in the project spell it `struct` · ×1
  • `nt_STRUCT` spells `STRUCT` where 12 names in the project spell it `struct` src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:853 — 12 of 13 names in project docs spell the token `struct` (12 of 13; unit: names in project docs containing `struct`). Peers: Parser.contains_exterior_struct_lit (src/Fable.Transforms/Rust/AST/Rust.AST.Parser.fs:431); State.print_struct (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:1406); State.print_struct(struct_def) (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:1406); State.print_expr_struct (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:1702); TcGlobals.struct_tuple1_tcr (src/fcs-fable/src/Compiler/TypedTree/TcGlobals.fs:1333). Rename to `nt_struct`. [rule N6]
D21 · Naming Consistency · `e_IMAGE_CEE_CS_CALLCONV_GENERIC` spells `GENERIC` where 42 names in the project spell it `generic` · ×1
  • `e_IMAGE_CEE_CS_CALLCONV_GENERIC` spells `GENERIC` where 42 names in the project spell it `generic` src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:1060 — 42 of 43 names in project docs spell the token `generic` (42 of 43; unit: names in project docs containing `generic`). Peers: State.generic_params_to_string (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:819); State.generic_params_to_string(generic_params) (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:819); State.print_generic_args (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:865); State.print_generic_arg (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:957); State.print_generic_arg(generic_arg) (src/Fable.Transforms/Rust/AST/Rust.AST.State.fs:957). Rename to `e_IMAGE_CEE_CS_CALLCONV_generic`. [rule N6]
D21 · Naming Consistency · `portablePDB` spells `PDB` where 25 names in the project spell it `Pdb` · ×1
  • `portablePDB` spells `PDB` where 25 names in the project spell it `Pdb` src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:3819 — 25 of 27 names in project FSharp.Compiler.Service spell the token `Pdb` (25 of 27; unit: names in project FSharp.Compiler.Service containing `Pdb`). Peers: cenv.generatePdb (src/fcs-fable/src/Compiler/AbstractIL/ilreflect.fs:470); cenv.generatePdb (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:529); ILBinaryWriter.GenPdbImport (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:2329); ILBinaryWriter.GenPdbImports (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:2338); ILBinaryWriter.writePdb (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:3710). Rename to `portablePdb`. [rule N6]
D21 · Naming Consistency · `embeddedPDB` spells `PDB` where 25 names in the project spell it `Pdb` · ×1
  • `embeddedPDB` spells `PDB` where 25 names in the project spell it `Pdb` src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:3820 — 25 of 27 names in project FSharp.Compiler.Service spell the token `Pdb` (25 of 27; unit: names in project FSharp.Compiler.Service containing `Pdb`). Peers: cenv.generatePdb (src/fcs-fable/src/Compiler/AbstractIL/ilreflect.fs:470); cenv.generatePdb (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:529); ILBinaryWriter.GenPdbImport (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:2329); ILBinaryWriter.GenPdbImports (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:2338); ILBinaryWriter.writePdb (src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:3710). Rename to `embeddedPdb`. [rule N6]
D21 · Naming Consistency · `test Passing a function reference in a TCO context does not capture unneeded outer args` spells `TC` where 13 names in the project spell it `Tc` · ×1
  • `test Passing a function reference in a TCO context does not capture unneeded outer args` spells `TC` where 13 names in the project spell it `Tc` tests/Python/TestTailCall.fs:298 — 13 of 14 names in project docs spell the token `Tc` (13 of 14; unit: names in project docs containing `Tc`). Peers: TcImports.BuildTcImports (src/fcs-fable/TcImports_shim.fs:44); CheckDeclarations.AddCcuToTcEnv (src/fcs-fable/src/Compiler/Checking/CheckDeclarations.fs:5580); CheckDeclarations.CreateInitialTcEnv (src/fcs-fable/src/Compiler/Checking/CheckDeclarations.fs:5615); IncrClassReprInfo.RepInfoTcGlobals (src/fcs-fable/src/Compiler/Checking/CheckIncrementalClasses.fs:255); CheckExpressions.TryTcStmt (src/fcs-fable/src/Compiler/Checking/Expressions/CheckExpressions.fs:5485). Rename to `test Passing a function reference in a TcO context does not capture unneeded outer args`. [rule N6]
D21 · Naming Consistency · `Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` · ×1
  • `Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` tests/Rust/tests/src/ArithmeticTests.fs:135 — 173 of 176 names in project docs spell the token `No` (173 of 176; unit: names in project docs containing `No`). Peers: CustomOptions.UseNoPrefixMsgStyle (src/Fable.Cli/CustomLogging.fs:17); ErlangPrinter.stripNoEffect (src/Fable.Transforms/Beam/ErlangPrinter.fs:10); Helpers.hasNoOverloadSuffixOnMember (src/Fable.Transforms/FSharp2Fable.Util.fs:861); Helpers.hasNoOverloadSuffix (src/Fable.Transforms/FSharp2Fable.Util.fs:889); Util.checkNoOverloadSuffix (src/Fable.Transforms/FSharp2Fable.Util.fs:2548). Rename to `Bitwise NoT on large unsigned integer works`. [rule N6]
D30 · Dependency Vulnerabilities · Low CVE · ×1
  • REDACTED
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 26 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/fcs-fable/service_slim.fs, src/Fable.Transforms/Php/PhpPrinter.fs, src/fcs-fable/src/Compiler/Checking/AccessibilityLogic.fs, src/fcs-fable/src/Compiler/TypedTree/QuotationPickler.fs, src/fcs-fable/src/Compiler/Service/ServiceAssemblyContent.fs, src/fcs-fable/src/Compiler/Utilities/lib.fs, src/fable-library-dart/Date.dart, src/fable-library-php/Map.php (and 18 more) (34 orphaned of 544 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; 544 of the 705 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
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.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 4/14 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `docs`, `src/Fable.Build`, `src/Fickl.Build`, `src/fable-compiler-js`, `src/fable-compiler-js/src` and 5 more.
Minor — 223 finding(s)
D12 · Dependency Hygiene · Outdated (npm) · ×212
  • Outdated (npm): @adobe/css-tools — @adobe/css-tools 4.4.4 → 5.0.0 available.
  • Outdated (npm): @babel/code-frame — @babel/code-frame 7.29.7 → 8.0.6 available.
  • Outdated (npm): @babel/compat-data — @babel/compat-data 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/core — @babel/core 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/generator — @babel/generator 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/helper-annotate-as-pure — @babel/helper-annotate-as-pure 7.29.7 → 8.0.0 available.
  • Outdated (npm): @babel/helper-compilation-targets — @babel/helper-compilation-targets 7.29.7 → 8.0.7 available.
  • Outdated (npm): @babel/helper-globals — @babel/helper-globals 7.29.7 → 8.0.6 available.
  • Outdated (npm): @babel/helper-module-imports — @babel/helper-module-imports 7.29.7 → 8.0.0 available.
  • Outdated (npm): @babel/helper-module-transforms — @babel/helper-module-transforms 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/helper-plugin-utils — @babel/helper-plugin-utils 7.29.7 → 8.0.1 available.
  • Outdated (npm): @babel/helper-string-parser — @babel/helper-string-parser 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/helper-validator-identifier — @babel/helper-validator-identifier 7.29.7 → 8.0.6 available.
  • Outdated (npm): @babel/helper-validator-option — @babel/helper-validator-option 7.29.7 → 8.0.0 available.
  • Outdated (npm): @babel/helpers — @babel/helpers 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/parser — @babel/parser 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/plugin-syntax-jsx — @babel/plugin-syntax-jsx 7.29.7 → 8.0.1 available.
  • Outdated (npm): @babel/plugin-syntax-typescript — @babel/plugin-syntax-typescript 7.29.7 → 8.0.3 available.
  • Outdated (npm): @babel/plugin-transform-modules-commonjs — @babel/plugin-transform-modules-commonjs 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/plugin-transform-react-jsx — @babel/plugin-transform-react-jsx 7.29.7 → 8.0.1 available.
  • Outdated (npm): @babel/runtime — @babel/runtime 7.28.6 → 8.1.2 available.
  • Outdated (npm): @babel/template — @babel/template 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/traverse — @babel/traverse 7.29.7 → 8.1.2 available.
  • Outdated (npm): @babel/types — @babel/types 7.29.7 → 8.1.2 available.
  • Outdated (npm): @bcoe/v8-coverage — @bcoe/v8-coverage 0.2.3 → 1.0.2 available.
  • + 187 more in this group — see findings.md.
D12 · Dependency Hygiene · Outdated · ×11
  • Outdated: G-Research.FSharp.Analyzers — G-Research.FSharp.Analyzers 0.26.0 → 0.27.0 available (referenced by Fable.Core).
  • Outdated: Ionide.Analyzers — Ionide.Analyzers 0.20.0 → 0.22.0 available (referenced by Fable.Core).
  • Outdated: Microsoft.SourceLink.GitHub — Microsoft.SourceLink.GitHub 10.0.403 → 11.0.100 available (referenced by Fable.Core).
  • Outdated: Microsoft.Extensions.Logging.Console — Microsoft.Extensions.Logging.Console 10.0.14 → 11.0.0 available (referenced by Fable.Cli).
  • Outdated: AltCover — AltCover 9.0.145 → 9.0.184 available (referenced by Fable.Tests).
  • Outdated: FSharp.Data.Adaptive — FSharp.Data.Adaptive 1.2.27 → 1.2.28 available (referenced by Fable.Tests.Adaptive).
  • Outdated: Microsoft.NET.Test.Sdk — Microsoft.NET.Test.Sdk 18.11.0 → 18.12.0 available (referenced by Fable.Tests.Rust).
  • Outdated: xunit.v3.mtp-off — xunit.v3.mtp-off 4.0.2 → 4.0.3 available (referenced by Fable.Tests.Rust).
  • Outdated: Microsoft.Extensions.FileSystemGlobbing — Microsoft.Extensions.FileSystemGlobbing 10.0.14 → 11.0.0 available (referenced by Fable.Build).
  • Outdated: Microsoft.Extensions.Logging.Abstractions — Microsoft.Extensions.Logging.Abstractions 10.0.14 → 11.0.0 available (referenced by Fable.Compiler).
  • Outdated: FSharp.Analyzers.SDK — FSharp.Analyzers.SDK 0.41.0 → 0.43.0 available (referenced by Fable.Analyzers).

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 --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=3200" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4200 --max-count=3996" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history-3.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-3.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-dbc7f2fea2d245bb99d995e2d6c0412c/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 .102artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesdotnet—dotnet list Fable.sln package --vulnerable --include-transitive --format json4artifacts/raw/dotnet-vulnerable.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .13artifacts/raw/trivy-config.json
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. semgrep could not parse 30 file(s) — `src/fable-library-py/fable_library/async_.py`, `src/fable-library-py/fable_library/async_builder.py`, `src/fable-library-py/fable_library/bases.py`, `src/fable-library-py/fable_library/choice.pyi`, `src/fable-library-py/fable_library/core/array.pyi`, … (+25 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.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 01a1e9e6-e764-75e7-a7d2-d3f1c432230e · 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