Swate — Watchdog Audit

Executive summary

This large, complex asset is currently weak overall, with a health score of 49%. While the underlying architecture and domain modeling are strong, the system’s operational readiness is critically low at 38%. For a codebase of this size, this gap represents a significant risk to delivery speed, reliability, and security exposure. The business value tied up here is substantial, requiring nearly one person-year to rebuild, making stability essential for protecting that investment.

The most urgent risk is operational fragility. With readiness scores this low, the system lacks the testing, observability, and security gates needed for safe, frequent changes. This creates a high probability of defects reaching production and increases the cost of every modification. The lack of automated security checks means vulnerabilities can slip through, exposing the organization to compliance and data risks. Addressing this is not just a technical fix but a business imperative to protect uptime and trust.

A secondary concern is the velocity tax on development. Code quality signals indicate that changes in weaker areas cost 4–9% more effort than in clean code. This inefficiency compounds over time, slowing down feature delivery and increasing long-term maintenance costs. While the architecture is sound, the current state of the code makes it harder for engineers to work efficiently, leading to slower time-to-market and higher operational expenses.

On the positive side, the system’s core architecture and domain modeling are excellent, providing a solid foundation for future improvements. The high maturity score suggests that the code is well-structured and understandable, which will aid in future remediation efforts. These strengths mean that fixing the readiness issues will be more effective and less disruptive than starting from scratch.

The first action should be to add automated security scanning to the CI pipeline. This step is low-cost, high-impact, and pays for itself within months by preventing security regressions. It is the highest-leverage move to reduce risk and improve confidence in the system. Once this is in place, the team can focus on improving test coverage and reducing technical debt in the weaker areas, ensuring sustainable growth and reliability.

Code Health 74% Strong Architecture 94% ★ Exemplary Maturity 73% Strong Readiness 38% Weak · gated by D13, R4, P3 Security 70% Adequate · gated by D30 Domain Modelling 100% ★ Exemplary Accessibility 40% Weak · gated by AC2

How the score is built — each lens's share of the headline Width is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.

Readiness 38% · 46% weightAccessibility 40% · 25% weightSecurity 70% · 14% weightMaturity 73% · 8% weightCode Health 74% · 4% weightArchitecture 94% · 2% weightDomain Modelling 100% · 1% weight

Raise Readiness 38 → 70 (the Healthy floor) ⇒ headline 49 → ~57.

Code composition — where the lines go

Tests 100%

Rebuild cost & value ~ Modeled — €43,000–€220,000

Cost to rebuild	€43,000–€220,000 (0.4–1.4 person-years (723–2,293 h), ~1–2 engineers)
Domain complexity	Standard — harder problems cost more per line
Quality factor	0.7× (at 49% quality) — the last 20% of quality is most of the work
Size & shape	Large · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

This codebase represents roughly ~0.9 person-years of build effort (about ~€130,000 to rebuild). Its weakest lens is Readiness at 38% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.2) — domain model × a 0.7× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).

Top priorities

The highest-leverage moves; the full ranked list is in the Roadmap below.

Resolve the 2 Leaked secret finding(s) in Secret Scanning — start with docker.compose.production.yml, docker.compose.new.yml.

+9.5 pts · Low effort · Secret Scanning

Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — so a security regression fails the build instead of landing.

+9.8 pts · Medium effort · Security & performance tooling

1 of the 3 unreached modules is an entry point — the browser loads it as a top-level script, so no import specifier addresses it and no public entry publishes it. An importing test cannot be written for it as it ships, and two different things are worth doing here — they are not the same thing. To EXERCISE it, a browser or end-to-end suite that loads the page; that is worth having, but it will NOT clear this row, because reachability is measured over the import graph and running a file by path adds no edge to it. To CLEAR it, make it addressable: lift the logic into a module a test can import and leave the entry point a thin shim over it, or put its body behind a main-guard (`import.meta.url === argv[1]`) and export it. Add tests that import the other 2 — directly or through their public entry.

+9.8 pts · Medium effort · Test Coverage

Diagnosis — what's actually going on

Value concentrated against a weak lens · High · Value at risk

This is a Large asset (~0.9 person-years to rebuild), and its weakest lens is Readiness at 38%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.

Evidence: valuation: Large, ~0.9 person-years rebuild (100,710 LoC) · weakest lens: Readiness 38%

→ Direct remediation budget at Readiness first — highest risk-reduction per euro on an asset this size.

The top fix pays for itself · High · Economics

The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 27.6–165.8 engineer-days every year, paid as drag on the ~277,996 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–2 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 4–9% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.

Evidence: D15 churn: 68,547 line(s) changed over a 90-day window ⇒ ~277,996/year · D1/D2/D4 code quality: averaging 6.4/10 ⇒ a 4–9% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)

→ Do the top-ranked fix now if this code will still be yours in 2 months.

Highest-leverage move · Medium · Leverage

Of everything flagged, the best return on effort is: Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — so a security regression fails the build instead of landing. The rest can wait behind it.

Evidence: priority ranking: top of 5 ranked by impact/effort

→ Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — so a security regression fails the build instead of landing.

A velocity tax on every change · Medium · Economics

The code-quality signals (complexity, duplication, cohesion) average 6.4/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 4–9% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)

Evidence: D1/D2/D4 code quality: averaging 6.4/10 across the code-quality signals actually measured

→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.

Architecture — module dependency matrix

Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)

829 modules, 825 dependencies. 2 dependency cycles across 4 modules, marked above the diagonal.

Showing the 40 most-connected modules; 789 more are not drawn.

Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
depends on →	1 ARCtrl	2 InteropLogging	4 Main.Bindings.SimpleGit	5 Routing	11 Swate.Components.Composite.Table.Types	12 Swate.Components.Composite.TermSearch.Types	13 Swate.Components.Composite.Widgets.Types	14 Swate.Components.Page.FileExplorer.Types	16 Swate.Components.Shared.ARCtrlHelper	18 Swate.Components.Shared.ProvenanceGrouping.Types	20 Swate.Electron.Shared.FileIOTypes	21 Swate.Electron.Shared.GitTypes	23 Types.FileImport	27 Swate.Components.Page.ArcFileEditor.Types	30 Swate.Components.Shared.ProvenanceGrouping.Edit	31 Swate.Components.Shared.ProvenanceGrouping.Grouping	32 Renderer.Types	33 Spreadsheet	34 Swate.Components.Shared.ProvenanceGrouping.Session	35 Model	37 Swate.Components.Page.ProvenanceGrouping.Types	39 Swate.Components.Page.ProvenanceGrouping
1 ARCtrl
2 InteropLogging
3 Main.ArcMerge
4 Main.Bindings.SimpleGit
5 Routing
6 Swate.Components
7 Swate.Components.Api.GitLabApi
8 Swate.Components.Composite.Authentication.Types
9 Swate.Components.Composite.MarkdownText.Plugins
10 Swate.Components.Composite.Notes.Types
11 Swate.Components.Composite.Table.Types
12 Swate.Components.Composite.TermSearch.Types
13 Swate.Components.Composite.Widgets.Types
14 Swate.Components.Page.FileExplorer.Types
15 Swate.Components.Shared
16 Swate.Components.Shared.ARCtrlHelper
17 Swate.Components.Shared.Database
18 Swate.Components.Shared.ProvenanceGrouping.Types
19 Swate.Electron.Shared.DTOs.ProvenanceGroupingDto
20 Swate.Electron.Shared.FileIOTypes
21 Swate.Electron.Shared.GitTypes
22 Swate.Electron.Shared.IPCTypes
23 Types.FileImport
24 Main.Git.GitService			4								1	12
25 Renderer.Components.LeftSidebar.FileExplorer.Types								2	2		1
26 Swate.Components.Composite.AnnotationTable	3				5	1
27 Swate.Components.Page.ArcFileEditor.Types							1		2
28 Swate.Components.Page.Landing									1
29 Swate.Components.Shared.ProvenanceGrouping.ARCtrlConverter										10
30 Swate.Components.Shared.ProvenanceGrouping.Edit										22
31 Swate.Components.Shared.ProvenanceGrouping.Grouping										13
32 Renderer.Types									1			3		1
33 Spreadsheet						1			3				1	2
34 Swate.Components.Shared.ProvenanceGrouping.Session										2					2
35 Model		1		2														1
36 Renderer.Context.GitWorkflow												22					1
37 Swate.Components.Page.ProvenanceGrouping.Types										14					4	1			1
38 MessagesModule		1																1		1
39 Swate.Components.Page.ProvenanceGrouping										16						6			5		7
40 Swate.Components.Page.ProvenanceGrouping.DragHandlers										2						1			1		1	1

Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself

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

The Good

D3 · .NET / C# God Classes 8.6 D4 · .NET / C# Code Duplication 9.3 R1 · React / TS Type Safety 10.0 R10 · React / TS Code Duplication 8.8 R2 · React / TS Cyclomatic Complexity 10.0 R7 · React / TS Dead Code 10.0

The Bad

D1 · .NET / C# Cyclomatic Complexity 5.4

The Ugly

D2 · .NET / C# Cognitive Complexity 4.5 R3 · React / TS Large Files 4.5

At a glance — Architecture · 94% · Exemplary ·

The Good

D27 · .NET / C# Navigability 7.6 D35 · .NET / C# Change Coupling 9.8 AX10 · Repo Code composition 9.8 R9 · React / TS Circular Imports 10.0

At a glance — Maturity · 73% · Strong ·

The Good

D15 · .NET / C# Churn × Complexity Hotspots 8.4 D19 · .NET / C# Documentation Quality 8.0 D21 · .NET / C# Naming Consistency 10.0 D34 · .NET / C# Knowledge Freshness 10.0 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Bad

D16 · .NET / C# Bus Factor 7.0 M1 · Repo Documentation (README) 6.7 M2 · Repo Architecture documentation 5.0

The Ugly

D20 · .NET / C# ADR Quality 0.0

At a glance — Readiness · 38% · Weak · gated by D13, R4, P3 ·

The Good

D9 · .NET / C# Test Distribution 10.0 D10 · .NET / C# Test Quality 10.0 D14 · .NET / C# License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P6 · Repo Release Hygiene 10.0 R5 · React / TS Dependency Freshness 10.0

The Bad

P4 · Repo Deployment & Rollback 5.0 R6 · React / TS Tooling 6.7

The Ugly

D13 · .NET / C# Secret Scanning 0.0 P3 · Repo Security & performance tooling 0.0 R4 · React / TS Test Coverage 2.5 R8 · React / TS Dependency Hygiene 4.0

At a glance — Security · 70% · Adequate · gated by D30 ·

The Good

D29 · .NET / C# Static Analysis (SAST) 8.0 D43 · .NET / C# Malicious Dependencies 10.0 D44 · .NET / C# Platform End-of-Life 10.0 S1 · Repo Web-Security Posture 8.0

The Bad

D28 · .NET / C# Secrets (history) 5.0 D31 · .NET / C# IaC & Container Security 5.2 D36 · .NET / C# Supply-chain Provenance & Signing 5.0

The Ugly

D30 · .NET / C# Dependency Vulnerabilities 0.0

At a glance — Domain Modelling · 100% · Exemplary ·

The Good

DM10 · Repo One transaction, one aggregate 10.0 DM8 · Repo Value-object opportunities 10.0

At a glance — Accessibility · 40% · Weak · gated by AC2 ·

The Good

AC6 · Repo Visual & motion safety 10.0

The Ugly

AC2 · Repo Forms & labels 1.0 AC3 · Repo Page structure 4.6 AC7 · Repo A11y enforcement 4.0

Security & Compliance — OWASP Top-10 mapping

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

OWASP category	Findings	Severity
A06:2021 — Vulnerable & Outdated Components	32	High / Critical
A03:2021 — Injection	25	High / Critical
A05:2021 — Security Misconfiguration	11	High / Critical
A02:2021 — Cryptographic Failures	8	High / Critical

Roadmap

First, integrate static analysis and secret scanning into the CI pipeline to block security regressions and resolve existing leaked credentials. Next, refactor the unreachable entry point module to make it importable for testing, while simultaneously removing unused dependencies and correcting package classifications. Finally, enhance deployment reliability by adding health checks to the compose service and ensuring image tags remain immutable for straightforward rollbacks.

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

Do this	Helps	Effort	Dimension
Resolve the 2 Leaked secret finding(s) in Secret Scanning — start with docker.compose.production.yml, docker.compose.new.yml.	+9.5 pts	Low	Secret Scanning
Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — so a security regression fails the build instead of landing.	+9.8 pts	Medium	Security & performance tooling
1 of the 3 unreached modules is an entry point — the browser loads it as a top-level script, so no import specifier addresses it and no public entry publishes it. An importing test cannot be written for it as it ships, and two different things are worth doing here — they are not the same thing. To EXERCISE it, a browser or end-to-end suite that loads the page; that is worth having, but it will NOT clear this row, because reachability is measured over the import graph and running a file by path adds no edge to it. To CLEAR it, make it addressable: lift the logic into a module a test can import and leave the entry point a thin shim over it, or put its body behind a main-guard (`import.meta.url === argv[1]`) and export it. Add tests that import the other 2 — directly or through their public entry.	+9.8 pts	Medium	Test Coverage
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.	+9.8 pts	Medium	Dependency Hygiene
Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.	+9.5 pts	Medium	Deployment & Rollback
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.	+9.0 pts	Medium	Forms & labels
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.	+9.0 pts	Medium	A11y enforcement
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.	+8.9 pts	Medium	Page structure

File quality

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

File	Score	Band	Worst signal
package-lock.json	0.0	Slop	Dependency Vulnerabilities: Critical CVE: [GHSA redacted]
build/Dockerfile.publish	0.7	Slop	IaC & Container Security: High IaC: DS-0002
.github/workflows/release-pipeline.yml	2.3	Slop	Static Analysis (SAST): High: github-actions-mutable-action-tag
src/Client/Api.fs	4.3	Mixed	Secrets (history): Secret: generic-api-key
src/Electron/src/Main/IPC/IArcVaultsApi.fs	4.8	Mixed	Cyclomatic Complexity: ArcVaultsApi.api (cyclomatic 133)
.github/workflows/run-tests.yml	5.1	Mixed	Static Analysis (SAST): High: github-actions-mutable-action-tag
src/Electron/src/Main/Git/GitService.fs	5.5	Mixed	Cyclomatic Complexity: GitService.confirmMergeResolution (cyclomatic 18)
.github/workflows/ensure-formatting.yml	5.8	Mixed	Static Analysis (SAST): High: github-actions-mutable-action-tag
src/Electron/src/Main/IPC/IGitApi.fs	6.3	Mixed	Cyclomatic Complexity: IGitApi.api (cyclomatic 78)
.db/docker-compose.yml	6.3	Mixed	IaC & Container Security: Medium IaC: WD-COMPOSE-0002
src/Components/src/Page/ProvenanceGrouping/Controls.fs	7.0	Mixed	Cyclomatic Complexity: Controls.PropertyRailItem (cyclomatic 60)
src/Server/Api/IOntologyAPI.fs	7.0	Mixed	Cyclomatic Complexity: V2.ontologyApi (cyclomatic 25)
src/Client/OfficeInterop/OfficeInterop.fs	7.0	Mixed	Cyclomatic Complexity: Main.tryParseToArcFile (cyclomatic 23)
src/Electron/src/Main/Git/GitLfsService.fs	7.0	Mixed	Cyclomatic Complexity: GitLfsService.planOutboundPush (cyclomatic 23)
src/Client/SharedComponents/Metadata/Forms.fs	7.0	Mixed	Cyclomatic Complexity: FormComponents.TextInput (cyclomatic 22)
src/Electron/src/Renderer/Context/GitWorkflow.fs	7.0	Mixed	Cyclomatic Complexity: GitWorkflow.update (cyclomatic 109)
src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs	7.0	Mixed	Cyclomatic Complexity: DataHubBrowser.ExplorePanel (cyclomatic 34)
src/Components/src/Composite/AnnotationTable/ContextMenu.fs	7.0	Mixed	Cyclomatic Complexity: AnnotationTableContextMenuUtil.getFittedCells (cyclomatic 21)
src/Components/src/Composite/AnnotationTable/Modals.fs	7.0	Mixed	Cognitive Complexity: ContextMenuModals.MoveColumnModal (cognitive 22)
src/Client/MainComponents/Widgets.fs	7.0	Mixed	Code Duplication: Near-duplicate member pair (223 shared lines)

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

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

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

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

Could not be resolved — 42

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

Methodology & how to trust this report

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

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

What we checked — 49 dimensions across the health lenses

D1D2D3D4D9D10D13D14D15D16D19D20D21D27D28D29D30D31D34D35D36D43D44AC2AC3AC6AC7AX10DM10DM8M1M2M3M4P1P3P4P6R1R10R2R3R4R5R6R7R8R9S1

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

How to trust any code-health report — three questions

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a0b370-6806-7474-9bda-74a7b2c04f36.

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.

D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 30 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 63 test source file(s) (.fs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This repository has NuGet-managed production source (.fs), whose `<PackageReference>` dependencies are exactly what this dimension assesses — but `dotnet list package` returned no packages, so there was nothing to assess. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED. This is a gap in the analysis run (restore or project-load failed), not a verdict about this repository. Dependencies declared for the other ecosystems present here (.fs, .mts, .ts, .tsx) are not read yet either.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: D22 has no public-API collector for any other ecosystem, and the remedy is to write one — no change to the scan image can close it.
D31 IaC & Container Security — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Build/Dockerfile.publish.dockerignore carries no `FROM` instruction, so it declares no build stage and every Dockerfile rule this engine owns — the runtime-hardening, key-material, mutable-clone, no-op-shim, build-context, trust-anchor, install-guard, setuid and world-writable-path rules — is outside its own premise there and returned nothing. That silence is deliberate and correct: with no base image there is no image to reason about. It is reported here because it is NOT the same fact as a clean file, and coverage is stated as 2 of 3 Infrastructure-as-Code manifest(s) fully judged rather than as 100%. The vendor scanners (trivy, checkov) do read these files and their findings above stand; only this engine's own stage-keyed rules are absent. No owner action: a build file with no FROM is a legitimate include fragment.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `src/Components/src/Composite/Actionbar/Actionbar.stories.tsx`, `src/Components/src/Composite/AnnotationTable/AnnotationTable.stories.tsx`, `src/Components/src/Composite/AnnotationTable/ResetTableConfirmationModal.stories.tsx`, `src/Components/src/Composite/ArcSelector/ArcSelector.stories.tsx`, `src/Components/src/Composite/ArcVaultActions/ArcVaultActions.stories.tsx`, … (+32 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.
D39 IL Efficiency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. `dotnet build` exited 1 with a compiler/MSBuild diagnostic, so there were no assemblies to read IL from. The build itself is D18's row, with the ask; nothing further is charged here.
AX3 Project dependency cycles — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over which project references which — facts that live in .csproj references. This repository either commits no MSBuild project at all (its C# may still have been parsed as syntax-only projects, which carry no references between them) or its projects failed to load, so there was no graph to read. That is a gap in this analyzer's reach — not a finding that the repository is free of what this check looks for.
AX4 Dependency direction — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the direction each project reference points — facts that live in .csproj references. This repository either commits no MSBuild project at all (its C# may still have been parsed as syntax-only projects, which carry no references between them) or its projects failed to load, so there was no graph to read. That is a gap in this analyzer's reach — not a finding that the repository is free of what this check looks for.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AX8 Test isolation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over which projects are test projects, and what they reference — facts that live in .csproj references. This repository either commits no MSBuild project at all (its C# may still have been parsed as syntax-only projects, which carry no references between them) or its projects failed to load, so there was no graph to read. That is a gap in this analyzer's reach — not a finding that the repository is free of what this check looks for.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
DM9 Scattered domain decisions — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not measured — scattered-decision detection needs expression-level symbol resolution: a comparison operand bound to the member it judges (arm one) and a construction bound to the type it produces (arm two). A Roslyn compilation carries both; arm two alone also runs on any frontend that declares whether a construction is produced or passed, and this target loaded neither.
ED5 Idempotency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
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 Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

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

Dimensions

D1 · Cyclomatic Complexity5.4 / 10Adequate✓ Tool-verified

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

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

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

82 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ProvenanceGrouping.Main at 180. A further 15 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being Export.parseToJsonString at 26 — they are counted neither in the figure above nor in this dimension's score. 12 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/Components/src/ARCtrl/Json.fs (Export.parseToJsonString at 26), src/Client/Update.fs (Update.update at 23), src/Client/Update/OfficeInteropUpdate.fs (OfficeInterop.update at 20), src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs (ArcMergeHelper.applyEntityEvent at 20), src/Components/src/Composite/AnnotationTable/Modals.fs (EditColumnModal.updateColumn at 19), and 7 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

ProvenanceGrouping.Main (cyclomatic 180)src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21

ArcVaultsApi.api (cyclomatic 133)src/Electron/src/Main/IPC/IArcVaultsApi.fs:127

GitWorkflow.update (cyclomatic 109)src/Electron/src/Renderer/Context/GitWorkflow.fs:1045

IGitApi.api (cyclomatic 78)src/Electron/src/Main/IPC/IGitApi.fs:104

Interface.update (cyclomatic 77)src/Client/Update/InterfaceUpdate.fs:87

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

What to do

Resolve the 1 ProvenanceGrouping.Main (cyclomatic 180) finding(s) in Cyclomatic Complexity — start with ProvenanceGrouping.fs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 ArcVaultsApi.api (cyclomatic 133) finding(s) in Cyclomatic Complexity — start with IArcVaultsApi.fs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 GitWorkflow.update (cyclomatic 109) finding(s) in Cyclomatic Complexity — start with GitWorkflow.fs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D2 · Cognitive Complexity4.5 / 10Weak✓ Tool-verified

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

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

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

115 method(s) exceeded the cognitive complexity threshold of 15; the worst was ProvenanceGrouping.Main at 192.

ProvenanceGrouping.Main (cognitive 192)src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21

GitProvisioningService.cloneRepository (cognitive 154)src/Electron/src/Main/Git/GitProvisioningService.fs:314

ArcVaultsApi.api (cognitive 152)src/Electron/src/Main/IPC/IArcVaultsApi.fs:127

TextInputWithMarkdown.TextInputWithMarkdown (cognitive 117)src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:63

TutorialOverlay.Main (cognitive 92)src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs:143

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

What to do

Resolve the 1 ProvenanceGrouping.Main (cognitive 192) finding(s) in Cognitive Complexity — start with ProvenanceGrouping.fs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 GitProvisioningService.cloneRepository (cognitive 154) finding(s) in Cognitive Complexity — start with GitProvisioningService.fs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 ArcVaultsApi.api (cognitive 152) finding(s) in Cognitive Complexity — start with IArcVaultsApi.fs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

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

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

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

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

29 god class(es) detected.

FileTooLong: Git/GitService.fs · ×25src/Electron/src/Main/Git/GitService.fs

TooManyFunctions: Session · ×3src/Shared/ProvenanceGrouping/Session.fs:89

TooManyMethods: Iconssrc/Components/src/Primitive/Icons.fs:9

What to do

Resolve the 25 FileTooLong finding(s) in God Classes — start with GitService.fs, GitSidebar.fs, Controls.fs. — One of this dimension's main actionable groups (25 warning-level).
Resolve the 3 TooManyFunctions finding(s) in God Classes — start with Session.fs, AuthService.fs, GitApiClient.fs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 TooManyMethods finding(s) in God Classes — start with Icons.fs. — One of this dimension's main actionable groups (1 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D4 · Code Duplication9.3 / 10Stronggated by 144 serious findings✓ Tool-verified

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

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

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

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

Duplicated block (15 lines × 2) · ×7src/Client/Types.fs:25

Duplicated block (13 lines × 2) · ×7src/Client/SharedComponents/Widgets.fs:36

Duplicated block (12 lines × 2) · ×7src/Client/OfficeInterop/ExcelHelper.fs:465

Duplicated block (5 lines × 2) · ×7src/Client/SharedComponents/Metadata/Forms.fs:1058

Duplicated block (10 lines × 2) · ×6src/Client/OfficeInterop/ARCtrlHelper.fs:55

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

What to do

Resolve the 7 Duplicated block (15 lines × 2) finding(s) in Code Duplication — start with ExcelHelper.fs (2), Types.fs, DataAnnotator.fs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 7 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with Widgets.fs (2), GitService.fs (2), DataAnnotator.fs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 7 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with Controls.fs (2), ExcelHelper.fs, OfficeInterop.fs. — One of this dimension's main actionable groups (7 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

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

30 test methods: 30 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 30 `it`/`test` case(s) across 2 test file(s) declaring at least one; its tier split is read from package names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

Do you agree with this assessment?

D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

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

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 30 tests. Measured on the JavaScript/TypeScript suite only — at least 63 test source file(s) (.fs) went unread, so its test quality is unmeasured and is not in these counts.

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md.

Do you agree with this assessment?

D13 · Secret Scanning0.0 / 10Critical✓ Tool-verified

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 0.0 / 10 · rule-coverage 100% · ceiling Prevented

2 secret(s) detected.

Leaked secret: hardcoded-credential · ×2.db/docker.compose.production.yml:55

What to do

Resolve the 2 Leaked secret finding(s) in Secret Scanning — start with docker.compose.production.yml, docker.compose.new.yml. — One of this dimension's main actionable groups (2 issue-level).
Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

Do you agree with this assessment?

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

Top hotspots: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs (52×180=9360); src/Electron/src/Main/IPC/IArcVaultsApi.fs (33×133=4389); src/Components/src/Page/ProvenanceGrouping/Controls.fs (37×60=2220) Repeated repair below the complexity floor: src/Electron/src/Main/ArcVault/WatcherHelpers.fs (4 of 5 changes were fixes); src/Components/src/Util/Extensions.fs (3 of 5 changes were fixes)

Hotspot: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs · ×40src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21

Repeated repair: src/Electron/src/Main/ArcVault/WatcherHelpers.fs · ×2src/Electron/src/Main/ArcVault/WatcherHelpers.fs:18

What to do

Resolve the 40 Hotspot finding(s) in Churn × Complexity Hotspots — start with ContextMenu.fs (2), ProvenanceGrouping.fs, IArcVaultsApi.fs. — One of this dimension's main actionable groups (40 warning-level).
Resolve the 2 Repeated repair finding(s) in Churn × Complexity Hotspots — start with WatcherHelpers.fs, Extensions.fs. — One of this dimension's main actionable groups (2 warning-level).

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

Do you agree with this assessment?

D16 · Bus Factor7.0 / 10Adequate✓ Tool-verified

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

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

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

104 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.stories.tsx. Counted over 345 of the 568 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1 · ×3

Further sole-owners (lower concentration)

What to do

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

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

Do you agree with this assessment?

D19 · Documentation QualityStrong◐ Sampled · advisory

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

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

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

Swate's documentation is clear and complete for a software project: the README (with Electron download link), Components README (local dev commands, build pipeline, release notes with background info), Maintainer Documentation (release orchestration as a Mermaid flowchart), Project Structure Guidelines (architecture placement rules), and Git Functionality guide (IPC bridge contracts, API surface, result shapes). The project also has an architecture/Docs markdown set of three files. All visible content is present in the outline; the README lacks a contributing section but the outlined one exists.

What to do

Improve Documentation Quality — currently 8.0/10. — Swate's documentation is clear and complete for a software project: the README (with Electron download link), Components README (local dev commands, build pipeline, release notes with background info), Maintainer Documentation (release orchestration as a Mermaid flowchart), Project Structure Guidelines (architecture placement rules), and Git Functionality guide (IPC bridge contracts, API surface, result shapes). The project also has an architecture/Docs markdown set of three files. All visible content is present in the outline; the README lacks a contributing section but the outlined one exists.

Detailed fixes: d19_recommendation.md.

Do you agree with this assessment?

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

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

No architecture decision records were found.

No ADRs found

What to do

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

Do you agree with this assessment?

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

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

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

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

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

Do you agree with this assessment?

D27 · Navigability7.6 / 10Strong✓ Tool-verified

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

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps.

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

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

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

Scattered collaborators

What to do

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

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

Do you agree with this assessment?

D28 · Secrets (history)5.0 / 10Adequate✓ Tool-verified

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 5.0 / 10 · rule-coverage 100% · ceiling Documented

5 finding(s): 0 critical, 5 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

Secret: generic-api-key · ×5src/Client/Api.fs @ 5cadaa7:7 (committed 2025-04-01)detected by gitleaks finding

Rotate the exposed credentials — git history can't be un-committed

What to do

Resolve the 5 Secret finding(s) in Secrets (history) — start with Api.fs (3), SwateApi.fs, Api.fs.ts. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D29 · Static Analysis (SAST)8.0 / 10Adequategated by 24 critical findings✓ Tool-verified

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

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

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

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

25 finding(s): 0 critical, 24 high, 1 medium, 0 low. 23 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 37 file(s) — `src/Components/src/Composite/Actionbar/Actionbar.stories.tsx` (line 40), `src/Components/src/Composite/AnnotationTable/AnnotationTable.stories.tsx` (line 40), `src/Components/src/Composite/AnnotationTable/ResetTableConfirmationModal.stories.tsx` (line 41), `src/Components/src/Composite/ArcSelector/ArcSelector.stories.tsx` (line 11), `src/Components/src/Composite/ArcVaultActions/ArcVaultActions.stories.tsx` (line 17), … (+32 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 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

High: github-actions-mutable-action-tag · ×24.github/workflows/ensure-formatting.yml:13detected by semgrep finding

Medium: watchdog-checkout-credential-persisted-in-privileged-job.github/workflows/release-pipeline.yml:25detected by semgrep finding

What to do

Resolve the 1 High finding(s) charged to Static Analysis (SAST) — the other 23 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 (24 issue-level, 1 of them charged here).
Resolve the 1 Medium finding(s) in Static Analysis (SAST) — start with release-pipeline.yml. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

D30 · Dependency Vulnerabilities0.0 / 10Critical✓ 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/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, Go, Java and Kotlin via Maven/Gradle, npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

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

32 finding(s): 2 critical, 19 high, 9 medium, 2 low.

High CVE: [GHSA redacted] · ×18package-lock.jsondetected by dotnet finding

Critical CVE: [GHSA redacted] · ×2package-lock.jsondetected by dotnet finding

High vulnerability: [GHSA redacted]package-lock.jsondetected by dotnet finding

Medium CVE: Microsoft.IdentityModel.JsonWebTokens 6.10.0 · ×9detected by dotnet list package --vulnerable

Low CVE: [GHSA redacted]package-lock.jsondetected by dotnet finding

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

What to do

Resolve the 18 High CVE finding(s) in Dependency Vulnerabilities — start with package-lock.json (18). — One of this dimension's main actionable groups (18 issue-level).
Resolve the 2 Critical CVE finding(s) in Dependency Vulnerabilities — start with package-lock.json (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with package-lock.json. — One of this dimension's main actionable groups (1 issue-level).

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

Do you agree with this assessment?

D31 · IaC & Container Security~~7.8~~ 5.2 / 10Adequate✓ Tool-verified

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

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

Maturity: Documented → Verified → Prevented · effective 5.2 / 10 · rule-coverage 67% · ceiling Documented

11 finding(s): 0 critical, 5 high, 5 medium, 1 low.

High IaC: DS-0002 · ×5build/Dockerfile.publishdetected by trivy finding

Medium IaC: WD-COMPOSE-0002 · ×5.db/docker-compose.yml:5detected by watchdog IaC rule

Low IaC: DS-0026build/Dockerfile.publishdetected by trivy finding

What to do

Resolve the 5 High IaC finding(s) in IaC & Container Security — start with Dockerfile.publish (5). — One of this dimension's main actionable groups (5 issue-level).
Resolve the 5 Medium IaC finding(s) in IaC & Container Security — start with docker-compose.yml (3), Dockerfile.publish (2). — One of this dimension's main actionable groups (5 warning-level).
Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with Dockerfile.publish. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

Do you agree with this assessment?

D35 · Change Coupling9.8 / 10Stronggated by 9 serious 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.8 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: IGitApi.fs↔GitApiClient.fs 79%; GitSidebar.stories.tsx↔Types.fs 67%; main.fs↔preload.fs 64%

Change coupling: IGitApi.fs ↔ GitApiClient.fs · ×8src/Electron/src/Main/IPC/IGitApi.fs

Change-coupling hub: GitService.fs → GitStateContext.fs, GitWorkflow.fs, GitApiClient.fssrc/Electron/src/Main/Git/GitService.fs

What to do

Resolve the 8 Change coupling finding(s) in Change Coupling — start with IArcVaultsApi.fs (2), IGitApi.fs, GitSidebar.stories.tsx. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with GitService.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.

Do you agree with this assessment?

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).

Unpinned build actions

PR-triggered workflow without a permissions block

Workflow holding a long-lived secret is unscoped

No SBOM

No dependency advisory monitoring

What to do

Resolve the 1 Unpinned build actions finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 PR-triggered workflow without a permissions block finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Workflow holding a long-lived secret is unscoped finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Do you agree with this assessment?

D44 · Platform End-of-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 16 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a 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.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

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

AC2 · Forms & labels1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×3) — src/Components/playground/App.tsx:39, src/Components/playground/App.tsx:61, src/Components/playground/App.tsx:73
This UI-library field component has no label / aria-label / aria-labelledby / id / name — and neither does anything it renders — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. — src/Components/playground/App.tsx:123

What to do

Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.

Do you agree with this assessment?

AC3 · Page structure4.6 / 10Weak✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×3) — src/Client/index.html:2, src/Electron/index.html:2, src/Server/public/test.html:2
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="elmish-app">, so there is no content here to wrap — render the <main> from the component mounted into it. — src/Client/index.html:2
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="app">, so there is no content here to wrap — render the <main> from the component mounted into it. — src/Components/index.html:2
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="root">, so there is no content here to wrap — render the <main> from the component mounted into it. — src/Electron/index.html:2
A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. — src/Server/public/test.html:2
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="eddf67bb498">, so there is no content here to wrap — render the <main> from the component mounted into it. — src/Server/public/test.html:2

What to do

Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

Do you agree with this assessment?

AC6 · Visual & motion safety10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

Do you agree with this assessment?

AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.

Do you agree with this assessment?

AX10 · Code composition9.8 / 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.

What to do

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

Do you agree with this assessment?

DM10 · One transaction, one aggregate10.0 / 10Exemplary○ Nothing flagged

Other · Domain Modelling — Whether a single operation mutates more than one aggregate root. An aggregate is a consistency boundary, so saving two together fuses them into one — the second's invariants come to depend on the first's transaction, and the pair can no longer be separated. Reads of other aggregates are not counted.

Method: Neutral body surface (DDD-gated): every method body scanned for repository WRITE calls (Add/Update/Save/Remove/Delete/Insert/Store and their async forms), keyed on the ARGUMENT type rather than the repository type — three `IRepository<T>` writes collapse to one repository but are three distinct aggregates. Reads (Get/Find/Load/Query) are excluded, so loading another aggregate for context never counts. Score is offending methods over methods that write at all. Deterministic.

Do you agree with this assessment?

DM8 · Value-object opportunities10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether clusters of primitives that travel together (a missing value object) are extracted — a low-weight suggestion, LLM-confirmed when configured.

Method: Roslyn (DDD-gated): primitive parameter clusters recurring three or more times across signatures extracted, then confirmed by language model when configured. Advisory, low-weight.

Do you agree with this assessment?

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

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

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

What to do

Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 2 of 3 project(s) that lack one — worth up to 1.3 pts.

Do you agree with this assessment?

M2 · Architecture 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 significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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

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

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

No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 11061 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.

What to do

Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
Add an approval/environment gate (required reviewers / protection rules) before production promotion.

Do you agree with this assessment?

P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

Do you agree with this assessment?

R1 · Type Safety10.0 / 10Exemplary✓ 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.

Do you agree with this assessment?

R10 · Code Duplication8.8 / 10Strong✓ Tool-verified

React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): 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. Deterministic.

src/Components/playground/App.tsx:86 · src/Components/playground/App.tsx:102 · src/Components/playground/App.tsx:116 · src/Components/playground/App.tsx:137 · +2 more site(s) not listed — all 6 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/Components/playground/App.tsx:86
src/Components/playground/App.tsx:108 · src/Components/playground/App.tsx:122 · src/Components/playground/App.tsx:143 · src/Components/playground/App.tsx:180 · +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/Components/playground/App.tsx:108

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.

Do you agree with this assessment?

R2 · Cyclomatic Complexity10.0 / 10Exemplary✓ 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.

Do you agree with this assessment?

R3 · Large Files4.5 / 10Weak✓ 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.

6 file(s) over 400 lines (counted as significant lines — blank lines excluded — over production source only, tests excluded), largest first: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.stories.tsx (2448), src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (798), src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx (782), src/Components/src/Page/FileExplorer/FileExplorer.stories.tsx (683), src/Components/src/Composite/AnnotationTable/AnnotationTable.stories.tsx (637), src/Components/src/Page/GitComparison/GitMergeConflictViewer.stories.tsx (575).

What to do

Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.

Do you agree with this assessment?

R4 · Test Coverage2.5 / 10Weak✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×3) — src/Components/playground/App.tsx, src/Components/src/index.ts, src/Components/playground/main.tsx

What to do

1 of the 3 unreached modules is an entry point — the browser loads it as a top-level script, so no import specifier addresses it and no public entry publishes it. An importing test cannot be written for it as it ships, and two different things are worth doing here — they are not the same thing. To EXERCISE it, a browser or end-to-end suite that loads the page; that is worth having, but it will NOT clear this row, because reachability is measured over the import graph and running a file by path adds no edge to it. To CLEAR it, make it addressable: lift the logic into a module a test can import and leave the entry point a thin shim over it, or put its body behind a main-guard (`import.meta.url === argv[1]`) and export it. Add tests that import the other 2 — directly or through their public entry.

Do you agree with this assessment?

R5 · Dependency Freshness10.0 / 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.

Do you agree with this assessment?

R6 · Tooling6.7 / 10Adequate✓ 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.

test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.

What to do

Add eslint as package.json scripts and run them in CI.

Do you agree with this assessment?

R7 · Dead Code10.0 / 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.

3 file(s) (~71 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.
1 file(s) (~47 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/Client
56 file(s) (~12724 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: src/Components/src/index.ts imports './dist/Primitive/BaseModal/BaseModal.fs', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here. — src/Components

Do you agree with this assessment?

R8 · Dependency Hygiene4.0 / 10Weak✓ 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. (×3)
Only test files import it — move it to devDependencies. — src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx:3

What to do

Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.

Do you agree with this assessment?

R9 · Circular Imports10.0 / 10Exemplary✓ 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.

Do you agree with this assessment?

S1 · Web-Security Posture8.0 / 10Strong✓ Tool-verified

Other · Security — Only what this repository's own non-C# files could be read for was assessed — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. Deterministic.

`https://cdnjs.cloudflare.com/ajax/libs/cytoscape/3.18.0/cytoscape.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. — src/Server/public/test.html:4

What to do

Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.

Do you agree with this assessment?

WCAG coverage — what static analysis assessed

Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

Dimension	WCAG 2.2 A/AA criteria	Coverage
AC2 · Forms & labels	1.3.1, 3.3.2, 4.1.2	Partial signal
AC3 · Page structure	1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2	Partial signal
AC6 · Visual & motion safety	1.4.3, 2.4.7	Partial — literal CSS only
AC7 · A11y enforcement	enforcement — no page criterion	Enforcement posture (process)

Not statically assessed — these 45 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.1.1, 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.2.5, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.1, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.3, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

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

Lens	Score	Rating	Impact
Code Health	74%	Strong	Solid.
Architecture	94%	Exemplary	Solid.
Maturity	73%	Strong	Solid.
Readiness	38%	Weak — gated by D13, R4, P3	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security	70%	Adequate — gated by D30	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling	100%	Exemplary	Strongest area.
Accessibility	40%	Weak — gated by AC2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.

Not evidenced — 4 control(s) we could not find positive evidence for

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

C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control

Not included — 85 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 image/media element found in the parsed markup — AC1 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph 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
AX4 Dependency direction — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) 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
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D11 Test Reliability — Test reliability NOT MEASURED: this repository's test suite spans .NET and JavaScript/TypeScript, and the JavaScript/TypeScript half could not be re-run — unit: measured (0 flaky); JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in the repository root; vitest via `npm ci --ignore-scripts` in src/Components/): not included — the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. No partial figure is published as if it were the whole: reliability is excluded from the score rather than counted as a near-zero.
D12 Dependency Hygiene — Dependency hygiene not measured — no packages were read
D17 Explicit Debt — the C# workspace loaded 0 projects, so explicit-debt density could not be measured
D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution; this repository's .NET projects are all F# (.fsproj), which the C#/VB workspace does not load, so the dimension does not apply.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — Production source is present (.fs, .mts, .ts, .tsx) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 37 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.
D39 IL Efficiency — IL not measured — the target did not build
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
D6 Cohesion (LCOM4) — Cohesion (LCOM4) is measured over a CS/VB/GO/SCALA/SWIFT/DART class graph, and this repository's production source is .fs, .mts, .ts, .tsx, which this pass does not read — so no class could be assessed. Not scored — this is a gap in the analyzer, not a finding about this repository.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: the .NET half could not be measured — the repository wires up no coverage collector for `--collect:"XPlat Code Coverage"` to use; the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. 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. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
DM11 Constructible invalid state — no entities detected — construction-time invariants not assessable
DM12 Ambient inputs in the domain — no domain-layer types detected — ambient-input check not applicable
DM2 Strongly-typed ids — no id-bearing domain types detected — strongly-typed-id adoption not assessable
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM4 Rich vs anemic model — no data-bearing entities detected — rich-vs-anemic model not assessable
DM5 Encapsulated state — no domain entities found — DM5 grades how entities protect their state, and this repository declares none
DM6 Domain ↔ infrastructure boundary — no domain-layer types detected — domain↔infrastructure boundary check not applicable
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
DM9 Scattered domain decisions — not measured — scattered-decision detection needs expression-level symbol resolution: a comparison operand bound to the member it judges (arm one) and a construction bound to the type it produces (arm two). A Roslyn compilation carries both; arm two alone also runs on any frontend that declares whether a construction is produced or passed, and this target loaded neither
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
P8 Schema migrations — not assessed — schema-migration practice is read from 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
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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 — 66 finding(s)

D29 · Static Analysis (SAST) · High · ×24

High: github-actions-mutable-action-tag .github/workflows/ensure-formatting.yml:13 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/ensure-formatting.yml:17 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-dotnet@<40-character SHA>`. This step references `actions/setup-dotnet@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-dotnet/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/manage-issues.yml:26 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/add-to-project@<40-character SHA>`. This step references `actions/add-to-project@v1.0.1`; resolve the SHA it points at today with `gh api repos/actions/add-to-project/commits/v1.0.1 --jq .sha`. Note that `v1.0.1` is an exact release tag rather than a floating major: it is still mutable (a tag can be repointed), but by convention it moves only on a force-push.
High: github-actions-mutable-action-tag .github/workflows/manage-prs.yml:15 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/add-to-project@<40-character SHA>`. This step references `actions/add-to-project@v1.0.2`; resolve the SHA it points at today with `gh api repos/actions/add-to-project/commits/v1.0.2 --jq .sha`. Note that `v1.0.2` is an exact release tag rather than a floating major: it is still mutable (a tag can be repointed), but by convention it moves only on a force-push.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:25 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:69 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:75 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-dotnet@<40-character SHA>`. This step references `actions/setup-dotnet@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-dotnet/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:96 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:100 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-dotnet@<40-character SHA>`. This step references `actions/setup-dotnet@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-dotnet/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:110 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-node@<40-character SHA>`. This step references `actions/setup-node@v6`; resolve the SHA it points at today with `gh api repos/actions/setup-node/commits/v6 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:128 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: NuGet/login@<40-character SHA>`. This step references `NuGet/login@v1`; resolve the SHA it points at today with `gh api repos/NuGet/login/commits/v1 --jq .sha`.
High: watchdog-secret-into-unpinned-action .github/workflows/release-pipeline.yml:132 — This step hands a repository secret to a third-party action that is NOT pinned to an immutable reference. A tag - `@v1`, `@v1.2.2`, `@main` - is a pointer the action's owner can repoint at any moment, so the code that receives this secret is whatever that owner publishes next, and it can change without a single commit to this repository or any review by you. An action runs in the job's own process: it can read every secret bound to the step, everything in the workspace, and the runner's network. Pin the action to a full 40-character commit SHA, which names one immutable tree - `uses: owner/repo@<40-character SHA>`, resolved with `gh api repos/<owner>/<repo>/commits/<ref> --jq .sha` - and review the diff before you move it. Where the secret is a long-lived personal access token, scope it down or replace it with the per-run `GITHUB_TOKEN` as well: pinning bounds WHICH code runs, not what the credential can do.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:140 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v4`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v4 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:148 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: bitovi/github-actions-storybook-to-github-pages@<40-character SHA>`. This step references `bitovi/github-actions-storybook-to-github-pages@v1.0.3`; resolve the SHA it points at today with `gh api repos/bitovi/github-actions-storybook-to-github-pages/commits/v1.0.3 --jq .sha`. Note that `v1.0.3` is an exact release tag rather than a floating major: it is still mutable (a tag can be repointed), but by convention it moves only on a force-push, so pin the floating-major and branch references in this file first.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:182 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:186 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-dotnet@<40-character SHA>`. This step references `actions/setup-dotnet@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-dotnet/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:196 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-node@<40-character SHA>`. This step references `actions/setup-node@v6`; resolve the SHA it points at today with `gh api repos/actions/setup-node/commits/v6 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:212 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v4`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v4 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:231 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:235 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-dotnet@<40-character SHA>`. This step references `actions/setup-dotnet@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-dotnet/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/release-pipeline.yml:239 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/download-artifact@<40-character SHA>`. This step references `actions/download-artifact@v4`; resolve the SHA it points at today with `gh api repos/actions/download-artifact/commits/v4 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/run-tests.yml:19 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v5`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/run-tests.yml:23 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-dotnet@<40-character SHA>`. This step references `actions/setup-dotnet@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-dotnet/commits/v5 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/run-tests.yml:33 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-node@<40-character SHA>`. This step references `actions/setup-node@v6`; resolve the SHA it points at today with `gh api repos/actions/setup-node/commits/v6 --jq .sha`.

D30 · Dependency Vulnerabilities · High CVE · ×18

High CVE: [GHSA redacted] package-lock.json — @xmldom/xmldom 0.9.10: [GHSA redacted] — @xmldom/xmldom is not declared in this repo's manifests: it is pulled in transitively by plist 3.1.1, so upgrade the dependency that requires it (or pin @xmldom/xmldom to 0.9.12 with an `overrides` entry). This is 1 of 13 advisories with a published fix this scan raises against @xmldom/xmldom 0.9.10, and their fixed versions do not agree — anything below 0.9.12 still leaves at least one of them open. Take this package to 0.9.12 or later: that is the floor for the package, not this row's target alone. This one row stands for the 13 advisories this scan raises against @xmldom/xmldom 0.9.10: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — js-yaml 4.2.0: [GHSA redacted] — js-yaml is not declared in this repo's manifests: it is pulled in transitively by mocha 10.8.2, which your own manifest declares, so upgrade the dependency that requires it (or pin js-yaml to 4.3.2 with an `overrides` entry). This is 1 of 3 advisories with a published fix this scan raises against js-yaml 4.2.0, and their fixed versions do not agree — anything below 4.3.2 still leaves at least one of them open. Take this package to 4.3.2 or later: that is the floor for the package, not this row's target alone. This one row stands for the 3 advisories this scan raises against js-yaml 4.2.0: [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — nanoid 3.3.12: [GHSA redacted] — nanoid is not declared in this repo's manifests: it is pulled in transitively by postcss 8.5.15, which reaches this repo only through vite 7.3.5, the devDependency your own manifest declares at `^7.3.1` (the entry you can move), so upgrade the dependency that requires it (or pin nanoid to 3.3.16 with an `overrides` entry). This is 1 of 2 advisories with a published fix this scan raises against nanoid 3.3.12, and their fixed versions do not agree — anything below 3.3.18 still leaves at least one of them open. Take this package to 3.3.18 or later: that is the floor for the package, not this row's target alone. This one row stands for the 2 advisories this scan raises against nanoid 3.3.12: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — svgo 4.0.1: [GHSA redacted] — svgo is not declared in this repo's manifests: it is pulled in transitively by @iconify/tools 5.0.12, which reaches this repo only through @iconify/tailwind4 1.2.3, the devDependency your own manifest declares at `^1.2.0` (the entry you can move), so upgrade the dependency that requires it (or pin svgo to 4.0.2 with an `overrides` entry). This is 1 of 3 advisories with a published fix this scan raises against svgo 4.0.1, and their fixed versions do not agree — anything below 4.1.0 still leaves at least one of them open. Take this package to 4.1.0 or later: that is the floor for the package, not this row's target alone. This one row stands for the 3 advisories this scan raises against svgo 4.0.1: [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — brace-expansion 1.1.15: [GHSA redacted] — brace-expansion is not declared in this repo's manifests: it is pulled in transitively by minimatch 3.1.5, so upgrade the dependency that requires it (or pin brace-expansion to 1.1.16 with an `overrides` entry — but note that an override is applied TREE-WIDE and this lock also resolves brace-expansion 2.x and 5.x, which the pin would force onto a 1.x release against dependents written for them; scoping an override to one major of the overridden package is a pnpm feature, so on this client upgrade the dependent holding the vulnerable copy down instead). This is 1 of 3 advisories with a published fix this scan raises against brace-expansion 1.1.15, and their fixed versions do not agree — anything below 1.1.18 still leaves at least one of them open. Take this package to 1.1.18 or later: that is the floor for the package, not this row's target alone. Also reported as [CVE redacted]. This one row stands for the 3 advisories this scan raises against brace-expansion 1.1.15: [GHSA redacted], [GHSA redacted] (also [CVE redacted]), [GHSA redacted] (also [CVE redacted]).
High CVE: [GHSA redacted] package-lock.json — brace-expansion 2.1.1: [GHSA redacted] — brace-expansion is not declared in this repo's manifests: it is pulled in transitively by minimatch 5.1.9 and minimatch 9.0.9, which reaches this repo only through mocha 10.8.2 and vite-plugin-dts 4.5.4, both entries your own manifest declares (the entries you can move), so upgrade the dependency that requires it (or pin brace-expansion to 2.1.2 with an `overrides` entry — but note that an override is applied TREE-WIDE and this lock also resolves brace-expansion 1.x and 5.x, which the pin would force onto a 2.x release against dependents written for them; scoping an override to one major of the overridden package is a pnpm feature, so on this client upgrade the dependent holding the vulnerable copy down instead). This is 1 of 3 advisories with a published fix this scan raises against brace-expansion 2.1.1, and their fixed versions do not agree — anything below 2.1.4 still leaves at least one of them open. Take this package to 2.1.4 or later: that is the floor for the package, not this row's target alone. Also reported as [CVE redacted]. This one row stands for the 3 advisories this scan raises against brace-expansion 2.1.1: [GHSA redacted], [GHSA redacted] (also [CVE redacted]), [GHSA redacted] (also [CVE redacted]).
High CVE: [GHSA redacted] package-lock.json — brace-expansion 5.0.6: [GHSA redacted] — brace-expansion is not declared in this repo's manifests: it is pulled in transitively by minimatch 10.2.3 and minimatch 10.2.5, which reaches this repo only through @storybook/react-vite 10.4.2 and vite-plugin-dts 4.5.4, both entries your own manifest declares (the entries you can move), so upgrade the dependency that requires it (or pin brace-expansion to 5.0.7 with an `overrides` entry — but note that an override is applied TREE-WIDE and this lock also resolves brace-expansion 1.x and 2.x, which the pin would force onto a 5.x release against dependents written for them; scoping an override to one major of the overridden package is a pnpm feature, so on this client upgrade the dependent holding the vulnerable copy down instead). This is 1 of 3 advisories with a published fix this scan raises against brace-expansion 5.0.6, and their fixed versions do not agree — anything below 5.0.9 still leaves at least one of them open. Take this package to 5.0.9 or later: that is the floor for the package, not this row's target alone. This one row stands for the 3 advisories this scan raises against brace-expansion 5.0.6: [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — fast-uri 3.1.2: [GHSA redacted] — fast-uri is not declared in this repo's manifests: it is pulled in transitively by ajv 8.18.0 and ajv 8.20.0, which reaches this repo only through office-addin-mock 2.4.6 and vite-plugin-dts 4.5.4, both entries your own manifest declares (the entries you can move), so upgrade the dependency that requires it (or pin fast-uri to 3.1.3 with an `overrides` entry). This is 1 of 6 advisories with a published fix this scan raises against fast-uri 3.1.2, and their fixed versions do not agree — anything below 3.1.6 still leaves at least one of them open. Take this package to 3.1.6 or later: that is the floor for the package, not this row's target alone. This one row stands for the 6 advisories this scan raises against fast-uri 3.1.2: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — undici 7.27.2: [GHSA redacted] — undici is not declared in this repo's manifests: it is pulled in transitively by jsdom 28.1.0, which your own manifest declares, so upgrade the dependency that requires it (or pin undici to 7.29.0 with an `overrides` entry). This is 1 of 12 advisories with a published fix this scan raises against undici 7.27.2, and their fixed versions do not agree — anything below 7.29.0 still leaves at least one of them open. Take this package to 7.29.0 or later: that is the floor for the package, not this row's target alone. This one row stands for the 12 advisories this scan raises against undici 7.27.2: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — image-size 0.7.5: [GHSA redacted] — no fixed version has been published yet. Track the advisory; image-size is not declared in this repo's manifests: it is pulled in transitively by appdmg 0.6.6, so the action is on the dependency that requires it — upgrade or replace that dependent. This one row stands for the 2 advisories this scan raises against image-size 0.7.5: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — browserslist 4.28.2: [GHSA redacted] — browserslist is not declared in this repo's manifests: it is pulled in transitively by @babel/helper-compilation-targets 7.29.7 and webpack 5.107.2, which reaches this repo only through @storybook/react-vite 10.4.2 and @vitejs/plugin-react 5.2.0, both entries your own manifest declares (the entries you can move), so upgrade the dependency that requires it (or pin browserslist to 4.28.7 with an `overrides` entry). This one row stands for the 2 advisories this scan raises against browserslist 4.28.2: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — extract-zip 2.0.1: [GHSA redacted] — no fixed version has been published yet. Track the advisory; extract-zip is not declared in this repo's manifests: it is pulled in transitively by @electron/packager 18.4.4 and electron 40.10.2, so the action is on the dependency that requires it — upgrade or replace that dependent. This one row stands for the 2 advisories this scan raises against extract-zip 2.0.1: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — electron 40.10.2: [GHSA redacted] — upgrade to 41.10.3. This one row stands for the 2 advisories this scan raises against electron 40.10.2: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — form-data 4.0.5: [GHSA redacted] — form-data is not declared in this repo's manifests: it is pulled in transitively by @types/node-fetch 2.6.13, which reaches this repo only through office-addin-mock 2.4.6, the devDependency your own manifest declares at `^2.4.6` (the entry you can move), so upgrade the dependency that requires it (or pin form-data to 4.0.6 with an `overrides` entry).
High CVE: [GHSA redacted] package-lock.json — ip-address 10.2.0: [GHSA redacted] — ip-address is not declared in this repo's manifests: it is pulled in transitively by socks 2.8.9, so upgrade the dependency that requires it (or pin ip-address to 10.3.1 with an `overrides` entry). This is 1 of 3 advisories with a published fix this scan raises against ip-address 10.2.0, and their fixed versions do not agree — anything below 10.3.1 still leaves at least one of them open. Take this package to 10.3.1 or later: that is the floor for the package, not this row's target alone. This one row stands for the 3 advisories this scan raises against ip-address 10.2.0: [GHSA redacted], [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — tmp 0.0.33: [GHSA redacted] — tmp is not declared in this repo's manifests: it is pulled in transitively by external-editor 3.1.0, so upgrade the dependency that requires it (and an `overrides` pin to 0.2.6 is not the offer it looks like: every dependent resolving this copy — external-editor 3.1.0 (`^0.0.33`) — declares a range that excludes 0.2.6, so the pin overrides their declaration rather than satisfying it. Upgrading those dependents is the move their own maintainers support). This is 1 of 2 advisories with a published fix this scan raises against tmp 0.0.33, and their fixed versions do not agree — anything below 0.2.6 still leaves at least one of them open. Take this package to 0.2.6 or later: that is the floor for the package, not this row's target alone. This one row stands for the 2 advisories this scan raises against tmp 0.0.33: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — postcss 8.5.15: [GHSA redacted] — postcss is not declared in this repo's manifests: it is pulled in transitively by vite 7.3.5, which your own manifest declares, so upgrade the dependency that requires it (or pin postcss to 8.5.18 with an `overrides` entry). This is 1 of 2 advisories with a published fix this scan raises against postcss 8.5.15, and their fixed versions do not agree — anything below 8.5.23 still leaves at least one of them open. Take this package to 8.5.23 or later: that is the floor for the package, not this row's target alone. This one row stands for the 2 advisories this scan raises against postcss 8.5.15: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] package-lock.json — adm-zip 0.5.12: [GHSA redacted] — adm-zip is not declared in this repo's manifests: it is pulled in transitively by office-addin-manifest 1.13.6, which reaches this repo only through office-addin-mock 2.4.6, the devDependency your own manifest declares at `^2.4.6` (the entry you can move), so upgrade the dependency that requires it (and an `overrides` pin to 0.6.0 is not the offer it looks like: every dependent resolving this copy — office-addin-manifest 1.13.6 (`0.5.12`) — declares a range that excludes 0.6.0, so the pin overrides their declaration rather than satisfying it. Upgrading those dependents is the move their own maintainers support). This one row stands for the 2 advisories this scan raises against adm-zip 0.5.12: [GHSA redacted], [GHSA redacted].

D28 · Secrets (history) · Secret · ×5

Secret: generic-api-key src/Client/Api.fs @ 5cadaa7:7 (committed 2025-04-01) — gitleaks matched rule 'generic-api-key' here, in git history. Deleting the file does not remove it — the commit persists on every clone, fork and backup — so the act is to ROTATE this credential and treat it as compromised. The "Rotate the exposed credentials" row carries the full procedure, including when a `.gitattributes` provenance declaration is the correct answer instead.
Secret: generic-api-key src/Client/Api.fs @ e43b404:7 (committed 2021-10-22) — gitleaks matched rule 'generic-api-key' here, in git history. Deleting the file does not remove it — the commit persists on every clone, fork and backup — so the act is to ROTATE this credential and treat it as compromised. The "Rotate the exposed credentials" row carries the full procedure, including when a `.gitattributes` provenance declaration is the correct answer instead.
Secret: generic-api-key src/Components/src/Api/SwateApi.fs @ e0cd13b:9 (committed 2026-03-18) — gitleaks matched rule 'generic-api-key' here, in git history. Deleting the file does not remove it — the commit persists on every clone, fork and backup — so the act is to ROTATE this credential and treat it as compromised. The "Rotate the exposed credentials" row carries the full procedure, including when a `.gitattributes` provenance declaration is the correct answer instead.
Secret: generic-api-key src/Components/src/Util/Api.fs @ fb4b969:7 (committed 2025-01-28) — gitleaks matched rule 'generic-api-key' here, in git history. Deleting the file does not remove it — the commit persists on every clone, fork and backup — so the act is to ROTATE this credential and treat it as compromised. The "Rotate the exposed credentials" row carries the full procedure, including when a `.gitattributes` provenance declaration is the correct answer instead.
Secret: generic-api-key src/Components/src/Util/Api.fs.ts @ 061f310:16 (committed 2025-05-27) — gitleaks matched rule 'generic-api-key' here, in git history. Deleting the file does not remove it — the commit persists on every clone, fork and backup — so the act is to ROTATE this credential and treat it as compromised. The "Rotate the exposed credentials" row carries the full procedure, including when a `.gitattributes` provenance declaration is the correct answer instead.

D31 · IaC & Container Security · High IaC · ×5

High IaC: DS-0002 build/Dockerfile.publish — Image user should not be 'root'. Specify at least 1 USER command in Dockerfile with non-root user as argument. Add 'USER <non root user name>' line to the Dockerfile. A container that starts as root runs your process with root's capabilities inside the namespace, so a compromise of the process starts from there. The step: create an unprivileged account in the image (`RUN adduser --system --no-create-home app`), give it ownership of the paths the process writes at runtime (`COPY --chown=` on those layers, or a `RUN chown -R`), and end the final stage with `USER app` so it is the default at start. Build stages that only compile can stay root; it is the stage that RUNS that needs the account. If the process genuinely requires root — it manages the container runtime, ptraces another process or opens raw devices — say so here rather than making a change that breaks it.
High IaC: DS-0017 build/Dockerfile.publish:5 — 'RUN <package-manager> update' instruction alone. The instruction 'RUN <package-manager> update' should always be followed by '<package-manager> install' in the same RUN statement. Combine '<package-manager> update' and '<package-manager> install' instructions to single one. The index refresh sits in its own layer, so the builder caches it: a later rebuild reuses the cached index and installs whatever versions it recorded, which is how an image ships packages that were patched upstream months ago. The step: this file installs with `apt-get`, so join them — `RUN apt-get update && apt-get install -y <packages>` — in one instruction, so the refresh and the install are cached and invalidated together. A refresh that genuinely has no install after it in the same image is dead weight and can go.
High IaC: DS-0029 build/Dockerfile.publish:6 — 'apt-get' missing '--no-install-recommends'. '--no-install-recommends' flag is missed: 'apt-get install -y ca-certificates curl gnupg'. Add '--no-install-recommends' flag to 'apt-get'.
High IaC: WD-DOCKER-0014 build/Dockerfile.publish:8 — Line 8 fetches a signing key over the network and installs it as a package manager's trust anchor without ever checking which key it got. Nothing in this stage states the fingerprint the build expects, so whoever answers that request — the host, anyone who can take over its DNS or its CDN, or anyone who compromises the key file at rest on it — chooses the anchor, and therefore chooses what every later `install` from the repository signed by it puts into the image. The package manager will then verify those packages against that key and report them as authentic: the signature check is working, and it is answering the wrong question. This is why a checksum over the installed package cannot repair it — the fetched bytes ARE the checker. Assert the key instead of trusting whatever arrives: pin the expected fingerprint and fail the build when it does not match (`gpg --show-keys --with-fingerprint <key> | grep -q <FPR>`), or check the key in as a file in the repository and `COPY` it into the image, which removes the network from the trust decision altogether. This is the ANCHOR half of the integrity claim WD-DOCKER-0001 makes about a fetched artefact — that rule asks whether the downloaded bytes were verified, this one asks whether the thing doing the verifying was.
High IaC: DS-0029 build/Dockerfile.publish:10 — 'apt-get' missing '--no-install-recommends'. '--no-install-recommends' flag is missed: 'apt-get update && apt-get install nodejs -y'. Add '--no-install-recommends' flag to 'apt-get'.

AC2 · Forms & labels · <label> that labels no control · ×3

<label> that labels no control src/Components/playground/App.tsx:39 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control src/Components/playground/App.tsx:61 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control src/Components/playground/App.tsx:73 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.

AC3 · Page structure · <html> without a lang · ×3

<html> without a lang src/Client/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang src/Electron/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang src/Server/public/test.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").

D11 · Test Reliability · Test suite cannot be installed from its own lockfile · ×2

Test suite cannot be installed from its own lockfile: the repository root — The vitest suite in the repository root was never exercised because its dependency install refused the committed lockfile — the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes.
Test suite cannot be installed from its own lockfile: src/Components/ — The vitest suite in src/Components/ was never exercised because its dependency install refused the committed lockfile — the dependency install for src/Components/ refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes.

D13 · Secret Scanning · Leaked secret · ×2

Leaked secret: hardcoded-credential .db/docker.compose.production.yml:55 — hardcoded-credential detected. Treat the value as compromised: it is readable by everyone who has ever had the repository, and deleting the line does not un-publish it. In order — (1) REVOKE it at whatever issued it and issue a replacement, which is the only step that actually closes the exposure; (2) load the replacement at run time from your platform's secret store or the process environment instead of from the tree, so no future value is committable; (3) remove the file or line and add its path to the repository's ignore rules, so it cannot come back; (4) if the value was ever live, purge it from the history as well, since a clone taken before the deletion still carries it. If this is instead a FIXTURE — key material generated for tests and valid nowhere — then the exposure is nil and the fix is to make that legible: generate it in test setup, or keep it under a test-data path, so a reader (and this scan) can tell it from the real thing.
Leaked secret: hardcoded-credential .db/docker.compose.new.yml:55 — hardcoded-credential detected. Treat the value as compromised: it is readable by everyone who has ever had the repository, and deleting the line does not un-publish it. In order — (1) REVOKE it at whatever issued it and issue a replacement, which is the only step that actually closes the exposure; (2) load the replacement at run time from your platform's secret store or the process environment instead of from the tree, so no future value is committable; (3) remove the file or line and add its path to the repository's ignore rules, so it cannot come back; (4) if the value was ever live, purge it from the history as well, since a clone taken before the deletion still carries it. If this is instead a FIXTURE — key material generated for tests and valid nowhere — then the exposure is nil and the fix is to make that legible: generate it in test setup, or keep it under a test-data path, so a reader (and this scan) can tell it from the real thing.

D30 · Dependency Vulnerabilities · Critical CVE · ×2

Critical CVE: [GHSA redacted] package-lock.json — tar 6.2.1: [GHSA redacted] — tar is not declared in this repo's manifests: it is pulled in transitively by @electron/node-gyp 10.2.0-electron.1, @electron/rebuild 3.7.2 and 1 other, so upgrade the dependency that requires it (— 7.5.19 is a MAJOR ahead of the resolved 6.2.1, so an `overrides` pin would force a breaking version under a dependent written against 6.2.1; upgrading the declaring package is the remedy, and where no patched release exists in your major line, record the exposure instead). This is 1 of 12 advisories with a published fix this scan raises against tar 6.2.1, and their fixed versions do not agree — anything below 7.5.21 still leaves at least one of them open. Take this package to 7.5.21 or later: that is the floor for the package, not this row's target alone. This one row stands for the 12 advisories this scan raises against tar 6.2.1: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
Critical CVE: [GHSA redacted] package-lock.json — @vitest/browser 4.1.8: [GHSA redacted] — this repo declares @vitest/browser ^4.0.18, a range that ALREADY admits the fixed 4.1.10, so there is no manifest edit to make here. Re-resolve the lock so @vitest/browser moves onto 4.1.10 or later; if the flagged 4.1.8 comes back, a dependency is pinning it — upgrade that dependent, or pin @vitest/browser with an `overrides` entry so only one copy resolves.

AC3 · Page structure · Document without a <title> · ×1

Document without a <title> src/Server/public/test.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.

D30 · Dependency Vulnerabilities · High vulnerability · ×1

High vulnerability: [GHSA redacted] package-lock.json — serialize-javascript 6.0.2: [GHSA redacted] — serialize-javascript is not declared in this repo's manifests: it is pulled in transitively by mocha 10.8.2, which your own manifest declares, so upgrade the dependency that requires it (— 7.0.3 is a MAJOR ahead of the resolved 6.0.2, so an `overrides` pin would force a breaking version under a dependent written against 6.0.2; upgrading the declaring package is the remedy, and where no patched release exists in your major line, record the exposure instead). This is 1 of 2 advisories with a published fix this scan raises against serialize-javascript 6.0.2, and their fixed versions do not agree — anything below 7.0.5 still leaves at least one of them open. Take this package to 7.0.5 or later: that is the floor for the package, not this row's target alone. This one row stands for the 2 advisories this scan raises against serialize-javascript 6.0.2: [GHSA redacted], [GHSA redacted].

Serious — 458 finding(s)

D15 · Churn × Complexity Hotspots · Hotspot · ×40

Hotspot: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21 — src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs changed 52 times in last 90 days, max cyclomatic complexity 180 in ProvenanceGrouping.Main at line 21. 4 of those changes were fix/bug commits, and the other 48 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.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/Electron/src/Main/IPC/IArcVaultsApi.fs src/Electron/src/Main/IPC/IArcVaultsApi.fs:127 — src/Electron/src/Main/IPC/IArcVaultsApi.fs changed 33 times in last 90 days, max cyclomatic complexity 133 in ArcVaultsApi.api at line 127. 11 of those changes were fix/bug commits, and the other 22 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/IPC/IArcVaultsApi.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/Components/src/Page/ProvenanceGrouping/Controls.fs src/Components/src/Page/ProvenanceGrouping/Controls.fs:613 — src/Components/src/Page/ProvenanceGrouping/Controls.fs changed 37 times in last 90 days, max cyclomatic complexity 60 in Controls.PropertyRailItem at line 613. 2 of those changes were fix/bug commits, and the other 35 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/Controls.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/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs:43 — src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs changed 24 times in last 90 days, max cyclomatic complexity 65 in FileTree.FileTree at line 43. 3 of those changes were fix/bug commits, and the other 21 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.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/Components/src/Page/ProvenanceGrouping/GroupCard.fs src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:300 — src/Components/src/Page/ProvenanceGrouping/GroupCard.fs changed 16 times in last 90 days, max cyclomatic complexity 50 in GroupCard.Main at line 300. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/GroupCard.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/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:49 — src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs changed 15 times in last 90 days, max cyclomatic complexity 41 in ConnectorOverlay.Main at line 49. 2 of those changes were fix/bug commits, and the other 13 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.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/Electron/src/Main/IPC/IGitApi.fs src/Electron/src/Main/IPC/IGitApi.fs:104 — src/Electron/src/Main/IPC/IGitApi.fs changed 7 times in last 90 days, max cyclomatic complexity 78 in IGitApi.api at line 104. 2 of those changes were fix/bug commits, and the other 5 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/IPC/IGitApi.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/Electron/src/Renderer/Context/GitWorkflow.fs src/Electron/src/Renderer/Context/GitWorkflow.fs:1045 — src/Electron/src/Renderer/Context/GitWorkflow.fs changed 4 times in last 90 days, max cyclomatic complexity 109 in GitWorkflow.update at line 1045. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Renderer/Context/GitWorkflow.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/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:326 — src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs changed 15 times in last 90 days, max cyclomatic complexity 29 in FolderedDraggableList.FolderedDraggableList at line 326. 1 of those changes was a fix/bug commit, and the other 14 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.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/Components/src/Composite/Workspace/DropOverlay.fs src/Components/src/Composite/Workspace/DropOverlay.fs:18 — src/Components/src/Composite/Workspace/DropOverlay.fs changed 9 times in last 90 days, max cyclomatic complexity 47 in DropOverlay.DropOverlay at line 18. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Composite/Workspace/DropOverlay.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/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs:143 — src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs changed 6 times in last 90 days, max cyclomatic complexity 63 in TutorialOverlay.Main at line 143. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Composite/TutorialOverlay/TutorialOverlay.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: build/Build.fs build/Build.fs:6 — build/Build.fs changed 8 times in last 90 days, max cyclomatic complexity 39 in Build.main at line 6. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- build/Build.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/Electron/src/Main/ArcVault/ArcVaultHelper.fs src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:65 — src/Electron/src/Main/ArcVault/ArcVaultHelper.fs changed 14 times in last 90 days, max cyclomatic complexity 22 in ArcVaultHelper.updateARCByFileContentDTO at line 65. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/ArcVault/ArcVaultHelper.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/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs:298 — src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs changed 12 times in last 90 days, max cyclomatic complexity 25 in ArcFileFooterTabs.Main at line 298. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.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/Shared/ARCtrl.Helper.fs src/Shared/ARCtrl.Helper.fs:21 — src/Shared/ARCtrl.Helper.fs changed 18 times in last 90 days, max cyclomatic complexity 15 in ArcFilesDiscriminate.tryFromString at line 21. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Shared/ARCtrl.Helper.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/Components/src/Composite/AnnotationTable/ContextMenu.fs src/Components/src/Composite/AnnotationTable/ContextMenu.fs:202 — src/Components/src/Composite/AnnotationTable/ContextMenu.fs changed 12 times in last 90 days, max cyclomatic complexity 21 in AnnotationTableContextMenuUtil.getFittedCells at line 202. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Composite/AnnotationTable/ContextMenu.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/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs:121 — src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs changed 13 times in last 90 days, max cyclomatic complexity 15 in ValidationPackageBrowser.ValidationPackageBrowser at line 121. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.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/Components/src/Page/ValidationPackageBrowser/PackageTable.fs src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs:52 — src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs changed 12 times in last 90 days, max cyclomatic complexity 16 in PackageTable.PackageTableHeader at line 52. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ValidationPackageBrowser/PackageTable.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/Electron/src/Main/Git/GitService.fs src/Electron/src/Main/Git/GitService.fs:2632 — src/Electron/src/Main/Git/GitService.fs changed 10 times in last 90 days, max cyclomatic complexity 18 in GitService.confirmMergeResolution at line 2632. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/Git/GitService.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/Components/src/Page/ProvenanceGrouping/EditorActions.fs src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:375 — src/Components/src/Page/ProvenanceGrouping/EditorActions.fs changed 12 times in last 90 days, max cyclomatic complexity 15 in DragHandlers.applyPropertyValueToGroups at line 375. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/EditorActions.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/Components/src/Page/ValidationPackageBrowser/Helper.fs src/Components/src/Page/ValidationPackageBrowser/Helper.fs:14 — src/Components/src/Page/ValidationPackageBrowser/Helper.fs changed 9 times in last 90 days, max cyclomatic complexity 17 in Helper.SemVer.comparePreRelease.Static at line 14. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/ValidationPackageBrowser/Helper.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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:446 — src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs changed 4 times in last 90 days, max cyclomatic complexity 34 in DataHubBrowser.ExplorePanel at line 446. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Page/DataHubBrowser/DataHubBrowser.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/Components/src/Primitive/ContextMenu/ContextMenu.fs src/Components/src/Primitive/ContextMenu/ContextMenu.fs:82 — src/Components/src/Primitive/ContextMenu/ContextMenu.fs changed 6 times in last 90 days, max cyclomatic complexity 21 in ContextMenu.ContextMenu at line 82. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Primitive/ContextMenu/ContextMenu.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/Electron/src/Main/Git/GitProvisioningService.fs src/Electron/src/Main/Git/GitProvisioningService.fs:314 — src/Electron/src/Main/Git/GitProvisioningService.fs changed 3 times in last 90 days, max cyclomatic complexity 41 in GitProvisioningService.cloneRepository at line 314. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/Git/GitProvisioningService.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/Electron/src/Main/Git/GitLfsService.fs src/Electron/src/Main/Git/GitLfsService.fs:967 — src/Electron/src/Main/Git/GitLfsService.fs changed 5 times in last 90 days, max cyclomatic complexity 23 in GitLfsService.planOutboundPush at line 967. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/Git/GitLfsService.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.
+ 15 more in this group — see findings.md.

D3 · God Classes · FileTooLong · ×25

FileTooLong: Git/GitService.fs src/Electron/src/Main/Git/GitService.fs — FileTooLong — 2226 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 136 functions. The bar is 500 significant lines; this is 1726 over it, 4.45× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: GitSidebar/GitSidebar.fs src/Components/src/Page/GitSidebar/GitSidebar.fs — FileTooLong — 1638 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1138 over it, 3.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ProvenanceGrouping/Controls.fs src/Components/src/Page/ProvenanceGrouping/Controls.fs — FileTooLong — 1563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1063 over it, 3.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: OfficeInterop/OfficeInterop.fs src/Client/OfficeInterop/OfficeInterop.fs — FileTooLong — 1526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1026 over it, 3.05× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Context/GitWorkflow.fs src/Electron/src/Renderer/Context/GitWorkflow.fs — FileTooLong — 1514 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 58 functions. The bar is 500 significant lines; this is 1014 over it, 3.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ProvenanceGrouping/ProvenanceGrouping.fs src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs — FileTooLong — 1407 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 907 over it, 2.81× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: AnnotationTable/Modals.fs src/Components/src/Composite/AnnotationTable/Modals.fs — FileTooLong — 1161 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 661 over it, 2.32× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Metadata/Forms.fs src/Client/SharedComponents/Metadata/Forms.fs — FileTooLong — 1137 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 637 over it, 2.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: TermSearch/TermSearch.fs src/Components/src/Composite/TermSearch/TermSearch.fs — FileTooLong — 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: DataHubBrowser/DataHubBrowser.fs src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs — FileTooLong — 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Git/GitLfsService.fs src/Electron/src/Main/Git/GitLfsService.fs — FileTooLong — 903 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 51 functions. The bar is 500 significant lines; this is 403 over it, 1.81× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: GitComparison/GitMergeConflictViewer.fs src/Components/src/Page/GitComparison/GitMergeConflictViewer.fs — FileTooLong — 770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 270 over it, 1.54× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: IPC/IArcVaultsApi.fs src/Electron/src/Main/IPC/IArcVaultsApi.fs — FileTooLong — 770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 270 over it, 1.54× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: AnnotationTable/ContextMenu.fs src/Components/src/Composite/AnnotationTable/ContextMenu.fs — FileTooLong — 765 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 265 over it, 1.53× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ProvenanceGrouping/ARCtrlConverter.fs src/Shared/ProvenanceGrouping/ARCtrlConverter.fs — FileTooLong — 712 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 212 over it, 1.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Api/GitLabApi.fs src/Components/src/Api/GitLabApi.fs — FileTooLong — 663 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 163 over it, 1.33× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ArcVault/ArcVault.fs src/Electron/src/Main/ArcVault/ArcVault.fs — FileTooLong — 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ProvenanceGrouping/State.fs src/Components/src/Page/ProvenanceGrouping/State.fs — FileTooLong — 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Api/IOntologyAPI.fs src/Server/Api/IOntologyAPI.fs — FileTooLong — 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ProvenanceGrouping/PropertyModel.fs src/Components/src/Page/ProvenanceGrouping/PropertyModel.fs — FileTooLong — 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ProvenanceGrouping/GroupCard.fs src/Components/src/Page/ProvenanceGrouping/GroupCard.fs — FileTooLong — 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: IPC/FileSystemIO.fs src/Electron/src/Main/IPC/FileSystemIO.fs — FileTooLong — 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: TutorialOverlay/TutorialOverlay.fs src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs — FileTooLong — 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: DataAnnotator/DataAnnotator.fs src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs — FileTooLong — 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: AnnotationTable/AnnotationTable.fs src/Components/src/Composite/AnnotationTable/AnnotationTable.fs — FileTooLong — 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.

D30 · Dependency Vulnerabilities · Medium CVE · ×9

Medium CVE: Microsoft.IdentityModel.JsonWebTokens 6.10.0 — Microsoft.IdentityModel.JsonWebTokens 6.10.0 (transitive) has a Medium advisory; affects 2 projects — one upgrade fixes all. https://github.com/advisories/[GHSA redacted]
Medium CVE: System.IdentityModel.Tokens.Jwt 6.10.0 — System.IdentityModel.Tokens.Jwt 6.10.0 (transitive) has a Medium advisory; affects 2 projects — one upgrade fixes all. https://github.com/advisories/[GHSA redacted]
Medium CVE: [GHSA redacted] package-lock.json — mermaid 11.15.0: [GHSA redacted] — this repo declares mermaid ^11.12.3, a range that ALREADY admits the fixed 11.16.1, so there is no manifest edit to make here. Re-resolve the lock so mermaid moves onto 11.16.1 or later; if the flagged 11.15.0 comes back, a dependency is pinning it — upgrade that dependent, or pin mermaid with an `overrides` entry so only one copy resolves. Also reported as [CVE redacted]. This one row stands for the 5 advisories this scan raises against mermaid 11.15.0: [GHSA redacted], [GHSA redacted] (also [CVE redacted]), [GHSA redacted] (also [CVE redacted]), [GHSA redacted] (also [CVE redacted]), [GHSA redacted] (also [CVE redacted]).
Medium CVE: [GHSA redacted] package-lock.json — qs 6.15.2: [GHSA redacted] — qs is not declared in this repo's manifests: it is pulled in transitively by url 0.11.4, which reaches this repo only through vite-plugin-node-polyfills 0.25.0, the devDependency your own manifest declares at `^0.25.0` (the entry you can move), so upgrade the dependency that requires it (or pin qs to 6.16.0 with an `overrides` entry). This one row stands for the 2 advisories this scan raises against qs 6.15.2: [GHSA redacted], [GHSA redacted].
Medium CVE: [GHSA redacted] package-lock.json — dompurify 3.4.8: [GHSA redacted] — dompurify is not declared in this repo's manifests: it is pulled in transitively by mermaid 11.15.0, so upgrade the dependency that requires it (or pin dompurify to 3.4.13 with an `overrides` entry). This is 1 of 4 advisories with a published fix this scan raises against dompurify 3.4.8, and their fixed versions do not agree — anything below 3.4.13 still leaves at least one of them open. Take this package to 3.4.13 or later: that is the floor for the package, not this row's target alone. This one row stands for the 4 advisories this scan raises against dompurify 3.4.8: [GHSA redacted], [GHSA redacted], [GHSA redacted] (also [CVE redacted]), [GHSA redacted] (also [CVE redacted]).
Medium CVE: [GHSA redacted] package-lock.json — @vitest/mocker 4.1.8: [GHSA redacted] — @vitest/mocker is not declared in this repo's manifests: it is pulled in transitively by @vitest/browser 4.1.8, @vitest/browser-playwright 4.1.8 and 1 other, which your own manifest declares, so upgrade the dependency that requires it (and an `overrides` pin to 4.1.11 is not the offer it looks like: every dependent resolving this copy — @vitest/browser 4.1.8, @vitest/browser-playwright 4.1.8 and 1 other (`4.1.8`) — declares a range that excludes 4.1.11, so the pin overrides their declaration rather than satisfying it. Upgrading those dependents is the move their own maintainers support).
Medium CVE: [GHSA redacted] package-lock.json — vitest 4.1.8: [GHSA redacted] — this repo declares vitest ^4.0.18, a range that ALREADY admits the fixed 4.1.11, so there is no manifest edit to make here. Re-resolve the lock so vitest moves onto 4.1.11 or later; if the flagged 4.1.8 comes back, a dependency is pinning it — upgrade that dependent, or pin vitest with an `overrides` entry so only one copy resolves.
Medium CVE: [GHSA redacted] package-lock.json — uuid 8.3.2: [GHSA redacted] — uuid is not declared in this repo's manifests: it is pulled in transitively by @nfdi4plants/exceljs 0.3.0, office-addin-manifest 1.13.6 and 1 other, which reaches this repo only through office-addin-mock 2.4.6, the devDependency your own manifest declares at `^2.4.6` (the entry you can move), so upgrade the dependency that requires it (— 11.1.1 is a MAJOR ahead of the resolved 8.3.2, so an `overrides` pin would force a breaking version under a dependent written against 8.3.2; upgrading the declaring package is the remedy, and where no patched release exists in your major line, record the exposure instead). Also reported as [CVE redacted].
Medium CVE: [GHSA redacted] package-lock.json — baseline-browser-mapping 2.10.34: [GHSA redacted] — baseline-browser-mapping is not declared in this repo's manifests: it is pulled in transitively by browserslist 4.28.2, which reaches this repo only through @storybook/react-vite 10.4.2 and @vitejs/plugin-react 5.2.0, both entries your own manifest declares (the entries you can move), so upgrade the dependency that requires it (or pin baseline-browser-mapping to 2.11.0 with an `overrides` entry).

D35 · Change Coupling · Change coupling · ×8

Change coupling: IGitApi.fs ↔ GitApiClient.fs src/Electron/src/Main/IPC/IGitApi.fs — `src/Electron/src/Main/IPC/IGitApi.fs` and `src/Electron/src/Renderer/GitApiClient.fs` change together 79% of the time (11 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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `1fb6f0fa` Allow canceling in-flight git network operations (clone, fetch, pull,…; `133d3e6f` add cancel button and idle timeouts instead of flat timeouts; `e31ca4f8` Implement review comments — run `git show` on any of them.
Change coupling: GitSidebar.stories.tsx ↔ Types.fs src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx — `src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx` and `src/Components/src/Page/GitSidebar/Types.fs` change together 67% of the time (8 of the 12 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 8 shared commits counted here, the most recent 3 are `133d3e6f` add cancel button and idle timeouts instead of flat timeouts; `32a0fff7` add git command console output to busy indicator; `1b3fbb14` add lfs storage actions to git sidebar (at that commit the files were still `src/Components/src/GitSidebar/GitSidebar.stories.tsx` and `src/Components/src/GitSidebar/Types.fs`) — run `git show` on any of them.
Change coupling: main.fs ↔ preload.fs src/Electron/src/Main/main.fs — `src/Electron/src/Main/main.fs` and `src/Electron/src/Preload/preload.fs` change together 64% of the time (9 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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `8b51d1f8` Ducktape fix: Fix template loading in Electron startup by moving temp…; `0c05679c` Start implementing datahubbrowser; `fae4eae0` Add Auth workflow to electron app — run `git show` on any of them.
Change coupling: Api.fs ↔ Server.fs src/Client/Api.fs — `src/Client/Api.fs` and `src/Server/Server.fs` change together 62% of the time (8 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 different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `2e10492a` final solution for routing issue; `f534afb0` Remove switch of routebuilder.config :fire:; `8d13a860` Rework search field :sparkles::construction: #332#338#339 — run `git show` on any of them.
Change coupling: IArcVaultsApi.fs ↔ InitState.fs src/Electron/src/Main/IPC/IArcVaultsApi.fs — `src/Electron/src/Main/IPC/IArcVaultsApi.fs` and `src/Electron/src/Renderer/Components/InitState.fs` change together 60% of the time (9 of the 15 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 different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `83162f41` add init git by default to arc creation; `680aacec` Remove ArcScope Hook; `ec14032e` Improve auth types and implement datahub view — run `git show` on any of them.
Change coupling: IArcVaultsApi.fs ↔ preload.fs src/Electron/src/Main/IPC/IArcVaultsApi.fs — `src/Electron/src/Main/IPC/IArcVaultsApi.fs` and `src/Electron/src/Preload/preload.fs` 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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `4b5d3be3` Implement fileimport into current established lifecycle; `f7d362b6` remove git repo creation from acrvault; `0cfb17a1` App layout: Sync save button state with "unsavedChanges" flag in ArcV… — run `git show` on any of them.
Change coupling: ArcFileEditor.fs ↔ ArcFileEditor.stories.tsx src/Components/src/Page/ArcFileEditor/ArcFileEditor.fs — `src/Components/src/Page/ArcFileEditor/ArcFileEditor.fs` and `src/Components/src/Page/ArcFileEditor/ArcFileEditor.stories.tsx` 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) 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 8 shared commits counted here, the most recent 3 are `eaacc7da` Cover With Units template import in the ArcFileEditor stories; `885ff7a4` Removed datamap part; `41459807` Add navbar button tooltips — run `git show` on any of them.
Change coupling: Actionbar.fs ↔ ArcSelector.stories.tsx src/Components/src/Composite/Actionbar/Actionbar.fs — `src/Components/src/Composite/Actionbar/Actionbar.fs` and `src/Components/src/Composite/ArcSelector/ArcSelector.stories.tsx` change together 50% of the time (5 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `5b939049` Implement review corrections Refactor some existing code Moved action…; `cb884c88` Remove wrong changelog entries Remove unnecessary tests Update contex… (at that commit the file was still `src/Components/src/Primitive/Actionbar/Actionbar.fs`); `8aab7775` * Move react state control outside ArcSelector * Keep Arc selector at… (at that commit the file was still `src/Components/src/Primitive/Actionbar/Actionbar.fs`) — run `git show` on any of them.

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

Duplicated block (15 lines × 2) src/Client/Types.fs:25 — src/Client/Types.fs:25-39 | src/Components/src/Composite/TemplateBrowser/Types.fs:40-54 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) src/Client/OfficeInterop/ExcelHelper.fs:240 — src/Client/OfficeInterop/ExcelHelper.fs:240-254 | src/Client/OfficeInterop/OfficeInterop.fs:1999-2013 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/OfficeInterop/ExcelHelper.fs:240` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Client/OfficeInterop/OfficeInterop.fs:2013` calls `then` and `src/Client/OfficeInterop/ExcelHelper.fs:254` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15 lines × 2) src/Client/OfficeInterop/ExcelHelper.fs:422 — src/Client/OfficeInterop/ExcelHelper.fs:422-436 | src/Client/OfficeInterop/ExcelHelper.fs:497-511 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/Client/States/DataAnnotator.fs:35 — src/Client/States/DataAnnotator.fs:35-49 | src/Components/src/Composite/Widgets/DataAnnotator/Types.fs:65-79 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) src/Client/Pages/FilePicker/FilePickerView.fs:96 — src/Client/Pages/FilePicker/FilePickerView.fs:96-110 | src/Client/Pages/TermSearch/TermSearchView.fs:24-38 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Pages/FilePicker/FilePickerView.fs:96` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) src/Components/src/ARCtrl/Extensions/CompositeCell.fs:12 — src/Components/src/ARCtrl/Extensions/CompositeCell.fs:12-26 | src/Components/src/Composite/TemplateBrowser/Helper.fs:21-35 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/ARCtrl/Extensions/CompositeCell.fs:12` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) src/Server/Api/IOntologyAPI.fs:461 — src/Server/Api/IOntologyAPI.fs:461-475 | src/Server/Api/IOntologyAPI.fs:741-755 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Server/Api/IOntologyAPI.fs:461` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (13 lines × 2) src/Client/SharedComponents/Widgets.fs:36 — src/Client/SharedComponents/Widgets.fs:36-48 | src/Client/SharedComponents/Widgets.fs:58-70 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) src/Client/States/DataAnnotator.fs:90 — src/Client/States/DataAnnotator.fs:90-102 | src/Components/src/Composite/Widgets/DataAnnotator/Types.fs:130-142 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) src/Client/MainComponents/Widgets.fs:249 — src/Client/MainComponents/Widgets.fs:249-261 | src/Components/src/Composite/Widgets/Widgets.fs:255-267 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/MainComponents/Widgets.fs:249` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Components/src/Composite/Widgets/Widgets.fs:268` calls `onMouseDown`, `stopPropagation` and `src/Client/MainComponents/Widgets.fs:262` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) src/Components/src/Api/GitLabApi.fs:635 — src/Components/src/Api/GitLabApi.fs:635-647 | src/Components/src/Api/GitLabApi.fs:706-718 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:764 — src/Components/src/Composite/AnnotationTable/ContextMenu.fs:764-776 | src/Components/src/Composite/AnnotationTable/ContextMenu.fs:889-901 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/ContextMenu.fs:764` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Components/src/Composite/AnnotationTable/ContextMenu.fs:902` calls `ContextMenuItem` and `src/Components/src/Composite/AnnotationTable/ContextMenu.fs:776` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) src/Electron/src/Main/Git/GitService.fs:1622 — src/Electron/src/Main/Git/GitService.fs:1622-1635 | src/Electron/src/Main/Git/GitService.fs:1720-1732 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/Git/GitService.fs:1622` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 2) src/Electron/src/Main/Git/GitService.fs:2746 — src/Electron/src/Main/Git/GitService.fs:2746-2758 | src/Electron/src/Main/Git/GitService.fs:2875-2888 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

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

Duplicated block (12 lines × 2) src/Client/OfficeInterop/ExcelHelper.fs:465 — src/Client/OfficeInterop/ExcelHelper.fs:465-476 | src/Client/OfficeInterop/ExcelHelper.fs:540-551 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/OfficeInterop/ExcelHelper.fs:465` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) src/Client/OfficeInterop/OfficeInterop.fs:429 — src/Client/OfficeInterop/OfficeInterop.fs:429-440 | src/Client/OfficeInterop/OfficeInterop.fs:443-454 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:178 — src/Client/SharedComponents/Metadata/Forms.fs:178-189 | src/Components/src/Page/Metadata/FormComponents/Helpers.fs:6-18 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Forms.fs` and `src/Components/src/Page/Metadata/FormComponents/Helpers.fs` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) src/Client/Pages/BuildingBlock/Dropdown.fs:17 — src/Client/Pages/BuildingBlock/Dropdown.fs:17-28 | src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs:55-66 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Pages/BuildingBlock/Dropdown.fs:17` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs:67` calls `preventDefault` and `src/Client/Pages/BuildingBlock/Dropdown.fs:29` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1359 — src/Components/src/Page/ProvenanceGrouping/Controls.fs:1359-1370 | src/Components/src/Page/ProvenanceGrouping/Controls.fs:1494-1505 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1794 — src/Components/src/Page/ProvenanceGrouping/Controls.fs:1794-1805 | src/Components/src/Page/ProvenanceGrouping/Controls.fs:1810-1821 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/Electron/src/Main/Git/GitService.fs:1753 — src/Electron/src/Main/Git/GitService.fs:1753-1764 | src/Electron/src/Main/Git/GitService.fs:2044-2055 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/Git/GitService.fs:1753` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (5 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:1058 — src/Client/SharedComponents/Metadata/Forms.fs:1058-1062 | src/Components/src/Page/Metadata/FormComponents/PersonsInput.fs:46-50 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) src/Client/MainComponents/Widgets.fs:40 — src/Client/MainComponents/Widgets.fs:40-46 | src/Components/src/Composite/Widgets/Widgets.fs:34-38 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) src/Client/MainComponents/Widgets.fs:244 — src/Client/MainComponents/Widgets.fs:244-248 | src/Components/src/Composite/Widgets/Widgets.fs:250-254 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Components/src/Composite/Widgets/Widgets.fs:249` calls `onFocus` and `src/Client/MainComponents/Widgets.fs:243` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:344 — src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:344-348 | src/Components/src/Composite/DataMapTable/DataMapContextMenu.fs:155-159 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) src/Server/Database/Term.fs:509 — src/Server/Database/Term.fs:509-513 | src/Server/Database/Term.fs:574-578 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/Server/Database/Term.fs:351 — src/Server/Database/Term.fs:351-355 | src/Server/Database/Term.fs:364-368 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/Client/SharedComponents/JsBindings/DndKit.fs:92 — src/Client/SharedComponents/JsBindings/DndKit.fs:92-96 | src/Components/src/JsBindings/DndKit.fs:139-143 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

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

Duplicated block (10 lines × 2) src/Client/OfficeInterop/ARCtrlHelper.fs:55 — src/Client/OfficeInterop/ARCtrlHelper.fs:55-64 | src/Client/OfficeInterop/OfficeInterop.fs:75-84 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/OfficeInterop/ARCtrlHelper.fs:55` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/Components/src/Composite/Widgets/JsonExport/JsonExport.fs:49 — src/Components/src/Composite/Widgets/JsonExport/JsonExport.fs:49-58 | src/Components/src/Composite/Widgets/JsonImport/JsonImport.fs:51-60 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/Widgets/JsonExport/JsonExport.fs:49` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/Shared/ProvenanceGrouping/Session.fs:546 — src/Shared/ProvenanceGrouping/Session.fs:546-555 | src/Shared/ProvenanceGrouping/Session.fs:557-566 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/Electron/src/Main/ArcVault/ArcVault.fs:788 — src/Electron/src/Main/ArcVault/ArcVault.fs:788-797 | src/Electron/src/Main/ArcVault/ArcVault.fs:819-828 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/Components/src/Composite/AnnotationTable/Modals.fs:896 — src/Components/src/Composite/AnnotationTable/Modals.fs:896-905 | src/Components/src/Composite/AnnotationTable/Modals.fs:932-941 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/Modals.fs:896` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Components/src/Composite/AnnotationTable/Modals.fs:895` calls `td` and `src/Components/src/Composite/AnnotationTable/Modals.fs:931` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) src/Components/src/Composite/DataMapTable/DataMapTable.fs:82 — src/Components/src/Composite/DataMapTable/DataMapTable.fs:82-91 | src/Components/src/Composite/DataMapTable/DataMapTable.fs:132-141 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

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

Duplicated block (9 lines × 2) src/Client/Pages/FilePicker/FilePickerView.fs:186 — src/Client/Pages/FilePicker/FilePickerView.fs:186-194 | src/Client/Pages/FilePicker/FilePickerView.fs:210-218 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Pages/FilePicker/FilePickerView.fs:186` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/Components/src/ARCtrl/Extensions/CompositeCell.fs:201 — src/Components/src/ARCtrl/Extensions/CompositeCell.fs:201-209 | src/Components/src/ARCtrl/Extensions/CompositeCell.fs:216-224 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/Components/src/Primitive/Blankslate/Blankslate.fs:43 — src/Components/src/Primitive/Blankslate/Blankslate.fs:43-51 | src/Components/src/Primitive/Blankslate/Blankslate.fs:58-66 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Primitive/Blankslate/Blankslate.fs:43` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:866 — src/Components/src/Composite/AnnotationTable/ContextMenu.fs:866-874 | src/Components/src/Composite/AnnotationTable/ContextMenu.fs:938-946 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/ContextMenu.fs:866` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:230 — src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:230-238 | src/Electron/src/Main/IPC/FileSystemIO.fs:196-204 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) src/Components/src/Composite/Workspace/DropOverlay.fs:277 — src/Components/src/Composite/Workspace/DropOverlay.fs:277-285 | src/Components/src/Composite/Workspace/DropOverlay.fs:291-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/Workspace/DropOverlay.fs:277` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D31 · IaC & Container Security · Medium IaC · ×5

Medium IaC: WD-COMPOSE-0002 .db/docker-compose.yml:5 — Line 5 runs service `redis` from `redis:6.2-alpine`, pulled from a registry by a TAG, which is a pointer the image's publisher can move at any time, not the image you tested against. The tag is re-pushed for a rebuild, a backport or a compromise alike, so the same commit starts a different image on a different day. Nothing else in this file constrains it: a Compose `image:` with no digest is the only thing deciding what runs, and a change nobody here made arrives with no diff to review. Pin the reference to its DIGEST, which is the image's content address and cannot be repointed — `image: redis:6.2-alpine@sha256:…` — resolve today's with `docker buildx imagetools inspect redis:6.2-alpine --format '{{.Manifest.Digest}}'` (or `docker pull redis:6.2-alpine && docker inspect --format '{{index .RepoDigests 0}}' redis:6.2-alpine`). Keep the tag in front of the digest as documentation: it tells a reader which release this is while the digest decides what is pulled. Bumping it then becomes a deliberate commit a reader — or Dependabot/Renovate, both of which update digest pins in Compose files — can review, instead of a silent change at the next pull. If this service is one you build here rather than pull, give it a `build:` section instead and the reference stops being a registry lookup.
Medium IaC: WD-COMPOSE-0002 .db/docker-compose.yml:15 — Line 15 runs service `neo4j` from `neo4j:5`, pulled from a registry by a TAG, which is a pointer the image's publisher can move at any time, not the image you tested against. The tag is re-pushed for a rebuild, a backport or a compromise alike, so the same commit starts a different image on a different day. Nothing else in this file constrains it: a Compose `image:` with no digest is the only thing deciding what runs, and a change nobody here made arrives with no diff to review. Pin the reference to its DIGEST, which is the image's content address and cannot be repointed — `image: neo4j:5@sha256:…` — resolve today's with `docker buildx imagetools inspect neo4j:5 --format '{{.Manifest.Digest}}'` (or `docker pull neo4j:5 && docker inspect --format '{{index .RepoDigests 0}}' neo4j:5`). Keep the tag in front of the digest as documentation: it tells a reader which release this is while the digest decides what is pulled. Bumping it then becomes a deliberate commit a reader — or Dependabot/Renovate, both of which update digest pins in Compose files — can review, instead of a silent change at the next pull. If this service is one you build here rather than pull, give it a `build:` section instead and the reference stops being a registry lookup.
Medium IaC: WD-COMPOSE-0002 .db/docker-compose.yml:56 — Line 56 runs service `swobup` from `ghcr.io/nfdi4plants/swobup:main`, pulled from a registry by a TAG, which is a pointer the image's publisher can move at any time, not the image you tested against. The tag is re-pushed for a rebuild, a backport or a compromise alike, so the same commit starts a different image on a different day. Nothing else in this file constrains it: a Compose `image:` with no digest is the only thing deciding what runs, and a change nobody here made arrives with no diff to review. Pin the reference to its DIGEST, which is the image's content address and cannot be repointed — `image: ghcr.io/nfdi4plants/swobup:main@sha256:…` — resolve today's with `docker buildx imagetools inspect ghcr.io/nfdi4plants/swobup:main --format '{{.Manifest.Digest}}'` (or `docker pull ghcr.io/nfdi4plants/swobup:main && docker inspect --format '{{index .RepoDigests 0}}' ghcr.io/nfdi4plants/swobup:main`). Keep the tag in front of the digest as documentation: it tells a reader which release this is while the digest decides what is pulled. Bumping it then becomes a deliberate commit a reader — or Dependabot/Renovate, both of which update digest pins in Compose files — can review, instead of a silent change at the next pull. If this service is one you build here rather than pull, give it a `build:` section instead and the reference stops being a registry lookup.
Medium IaC: WD-DOCKER-0003 build/Dockerfile.publish:1 — Line 1 builds this stage `FROM mcr.microsoft.com/dotnet/sdk:10.0` — a tag, which is a POINTER the image's publisher can move at any time, not the image you tested against. The tag is re-pushed for a rebuild, a backport or a compromise alike, so the same commit produces a different image on a different day and a change nobody here made arrives with no diff to review; a build that reproduces is also the only way to say what is actually running when an advisory lands. Pin the reference to its DIGEST, which is the image's content address and cannot be repointed — `FROM mcr.microsoft.com/dotnet/sdk:10.0@sha256:…` — resolve today's with `docker buildx imagetools inspect mcr.microsoft.com/dotnet/sdk:10.0 --format '{{.Manifest.Digest}}'` (or `docker pull mcr.microsoft.com/dotnet/sdk:10.0 && docker inspect --format '{{index .RepoDigests 0}}' mcr.microsoft.com/dotnet/sdk:10.0`). Keep the tag in front of the digest as documentation: it tells a reader which release this is while the digest decides what is pulled. Bumping it then becomes a deliberate commit a reader — or Dependabot/Renovate, both of which update digest pins — can review, instead of a silent change at the next build. This applies to a build-only stage too: the stage that compiles decides what ends up in the layers you ship.
Medium IaC: WD-DOCKER-0003 build/Dockerfile.publish:19 — Line 19 builds this stage `FROM mcr.microsoft.com/dotnet/aspnet:10.0-alpine` — a tag, which is a POINTER the image's publisher can move at any time, not the image you tested against. The tag is re-pushed for a rebuild, a backport or a compromise alike, so the same commit produces a different image on a different day and a change nobody here made arrives with no diff to review; a build that reproduces is also the only way to say what is actually running when an advisory lands. Pin the reference to its DIGEST, which is the image's content address and cannot be repointed — `FROM mcr.microsoft.com/dotnet/aspnet:10.0-alpine@sha256:…` — resolve today's with `docker buildx imagetools inspect mcr.microsoft.com/dotnet/aspnet:10.0-alpine --format '{{.Manifest.Digest}}'` (or `docker pull mcr.microsoft.com/dotnet/aspnet:10.0-alpine && docker inspect --format '{{index .RepoDigests 0}}' mcr.microsoft.com/dotnet/aspnet:10.0-alpine`). Keep the tag in front of the digest as documentation: it tells a reader which release this is while the digest decides what is pulled. Bumping it then becomes a deliberate commit a reader — or Dependabot/Renovate, both of which update digest pins — can review, instead of a silent change at the next build. This applies to a build-only stage too: the stage that compiles decides what ends up in the layers you ship.

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

Duplicated block (14 lines × 2) src/Client/Update/UpdateUtil.fs:54 — src/Client/Update/UpdateUtil.fs:54-67 | src/Components/src/Composite/TemplateBrowser/Helper.fs:77-90 — before extracting anything, compare `src/Client/Update/UpdateUtil.fs` and `src/Components/src/Composite/TemplateBrowser/Helper.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Update/UpdateUtil.fs:54` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) src/Client/Update/UpdateUtil.fs:149 — src/Client/Update/UpdateUtil.fs:149-162 | src/Components/src/Composite/TemplateBrowser/Helper.fs:126-139 — before extracting anything, compare `src/Client/Update/UpdateUtil.fs` and `src/Components/src/Composite/TemplateBrowser/Helper.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Update/UpdateUtil.fs:149` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14 lines × 2) src/Electron/src/Main/Git/GitService.fs:1724 — src/Electron/src/Main/Git/GitService.fs:1724-1737 | src/Electron/src/Main/Git/GitService.fs:2643-2656 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/Git/GitService.fs:1724` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) src/Electron/src/Main/Git/GitService.fs:2773 — src/Electron/src/Main/Git/GitService.fs:2773-2786 | src/Electron/src/Main/Git/GitService.fs:2826-2839 — 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 (14 lines × 2) src/Components/src/Composite/TermSearch/TermSearch.fs:861 — src/Components/src/Composite/TermSearch/TermSearch.fs:861-874 | src/Components/src/Composite/TermSearch/TermSearch.fs:921-934 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/TermSearch/TermSearch.fs:861` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (11 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:477 — src/Client/SharedComponents/Metadata/Forms.fs:477-487 | src/Components/src/Page/Metadata/FormComponents/InputSequence.fs:60-72 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Forms.fs` and `src/Components/src/Page/Metadata/FormComponents/InputSequence.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) src/Server/Server.fs:50 — src/Server/Server.fs:50-60 | src/Server/Server.fs:66-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/Electron/src/Main/Git/GitlfsAdapter.fs:54 — src/Electron/src/Main/Git/GitlfsAdapter.fs:54-64 | src/Electron/src/Main/Git/GitlfsAdapter.fs:294-304 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/Electron/src/Main/IPC/IArcVaultsApi.fs:238 — src/Electron/src/Main/IPC/IArcVaultsApi.fs:238-248 | src/Electron/src/Main/IPC/IArcVaultsApi.fs:570-580 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/IPC/IArcVaultsApi.fs:238` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) src/Electron/src/Main/Git/GitService.fs:2437 — src/Electron/src/Main/Git/GitService.fs:2437-2447 | src/Electron/src/Main/Git/GitService.fs:2519-2529 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/Git/GitService.fs:2437` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (8 lines × 2) src/Components/src/Primitive/Popover/Popover.fs:236 — src/Components/src/Primitive/Popover/Popover.fs:236-243 | src/Components/src/Primitive/Popover/Popover.fs:280-287 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Primitive/Popover/Popover.fs:236` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:116 — src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:116-123 | src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:112-119 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) src/Electron/src/Main/Git/GitService.fs:745 — src/Electron/src/Main/Git/GitService.fs:745-752 | src/Electron/src/Main/Git/GitService.fs:815-822 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/Components/src/Composite/AnnotationTable/Modals.fs:301 — src/Components/src/Composite/AnnotationTable/Modals.fs:301-308 | src/Components/src/Composite/AnnotationTable/Modals.fs:334-341 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/Modals.fs:301` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/Components/src/Composite/TermSearch/TermSearch.fs:140 — src/Components/src/Composite/TermSearch/TermSearch.fs:140-147 | src/Components/src/Composite/TermSearch/TermSearch.fs:152-159 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

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

Duplicated block (7 lines × 2) src/Client/Pages/BuildingBlock/Helper.fs:37 — src/Client/Pages/BuildingBlock/Helper.fs:37-43 | src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:67-73 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/Components/src/Primitive/BaseModal/BaseModal.fs:148 — src/Components/src/Primitive/BaseModal/BaseModal.fs:148-154 | src/Components/src/Primitive/ErrorModal/ErrorModal.fs:84-90 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) src/Components/src/Composite/MarkdownText/Plugins/AddImage.fs:31 — src/Components/src/Composite/MarkdownText/Plugins/AddImage.fs:31-37 | src/Components/src/Composite/MarkdownText/Plugins/AddStep.fs:37-43 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) src/Components/src/Composite/Notes/Editor/Validation.fs:32 — src/Components/src/Composite/Notes/Editor/Validation.fs:32-38 | src/Components/src/Composite/Notes/Editor/Validation.fs:40-46 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/Electron/src/Main/Git/GitService.fs:1584 — src/Electron/src/Main/Git/GitService.fs:1584-1590 | src/Electron/src/Main/Git/GitService.fs:1599-1607 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/Git/GitService.fs:1584` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

AC3 · Page structure · Page without a main landmark · ×4

Page without a main landmark src/Client/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="elmish-app">, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark src/Components/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="app">, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark src/Electron/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="root">, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark src/Server/public/test.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="eddf67bb498">, so there is no content here to wrap — render the <main> from the component mounted into it.

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

Duplicated block (19 lines × 2) src/Client/Modals/SelectiveImportModal.fs:329 — src/Client/Modals/SelectiveImportModal.fs:329-347 | src/Client/Modals/SelectiveImportModal.fs:394-412 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Modals/SelectiveImportModal.fs:329` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) src/Client/MainComponents/Widgets.fs:197 — src/Client/MainComponents/Widgets.fs:197-215 | src/Components/src/Composite/Widgets/Widgets.fs:199-217 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/MainComponents/Widgets.fs:197` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Components/src/Composite/Widgets/Widgets.fs:198` calls `onFocus` and `src/Client/MainComponents/Widgets.fs:196` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (19 lines × 2) src/Components/src/Composite/AnnotationTable/Modals.fs:1165 — src/Components/src/Composite/AnnotationTable/Modals.fs:1165-1183 | src/Components/src/Composite/AnnotationTable/Modals.fs:1615-1633 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/Modals.fs:1165` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) src/Server/Api/IOntologyAPI.fs:298 — src/Server/Api/IOntologyAPI.fs:298-316 | src/Server/Api/IOntologyAPI.fs:556-574 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Server/Api/IOntologyAPI.fs:298` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×4

Duplicated block (13–14 lines × 2) src/Client/OfficeInterop/OfficeInterop.fs:34 — src/Client/OfficeInterop/OfficeInterop.fs:34-47 | src/Client/OfficeInterop/OfficeInterop.fs:151-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/OfficeInterop/OfficeInterop.fs:34` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13–14 lines × 2) src/Client/Spreadsheet/IO.fs:52 — src/Client/Spreadsheet/IO.fs:52-65 | src/Components/src/ARCtrl/Json.fs:12-24 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Spreadsheet/IO.fs:52` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) src/Client/MainComponents/Navbar.fs:88 — src/Client/MainComponents/Navbar.fs:88-101 | src/Client/MainComponents/Navbar.fs:115-127 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/MainComponents/Navbar.fs:88` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) src/Components/src/Composite/Widgets/Widgets.fs:306 — src/Components/src/Composite/Widgets/Widgets.fs:306-319 | src/Components/src/Composite/Widgets/Widgets.fs:321-333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/Widgets/Widgets.fs:306` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D3 · God Classes · TooManyFunctions · ×3

TooManyFunctions: Session src/Shared/ProvenanceGrouping/Session.fs:89 — TooManyFunctions — 48 functions. The bar is 30 functions; this is 18 over it, 1.60× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: AuthService src/Electron/src/Main/Auth/AuthService.fs:1 — TooManyFunctions — 31 functions. The bar is 30 functions; this is 1 over it, 1.03× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: GitApiClient src/Electron/src/Renderer/GitApiClient.fs:1 — TooManyFunctions — 31 functions. The bar is 30 functions; this is 1 over it, 1.03× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.

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

Duplicated block (25 lines × 2) src/Client/Pages/ProtocolTemplates/ProtocolView.fs:117 — src/Client/Pages/ProtocolTemplates/ProtocolView.fs:117-141 | src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs:134-158 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Pages/ProtocolTemplates/ProtocolView.fs:117` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (25 lines × 2) src/Components/src/Composite/DataMapTable/DataMapTable.fs:94 — src/Components/src/Composite/DataMapTable/DataMapTable.fs:94-118 | src/Components/src/Composite/DataMapTable/DataMapTable.fs:143-167 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/DataMapTable/DataMapTable.fs:94` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (25 lines × 2) src/Server/Api/IOntologyAPI.fs:413 — src/Server/Api/IOntologyAPI.fs:413-437 | src/Server/Api/IOntologyAPI.fs:690-714 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Server/Api/IOntologyAPI.fs:413` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.

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

Duplicated block (18 lines × 2) src/Client/MainComponents/Widgets.fs:18 — src/Client/MainComponents/Widgets.fs:18-35 | src/Components/src/Composite/Widgets/Widgets.fs:13-30 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1 — src/Components/src/Page/ProvenanceGrouping/Controls.fs:1-18 | src/Components/src/Page/ProvenanceGrouping/ControlsSupport.fs:1-18 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18 lines × 2) src/Electron/src/Main/Git/GitLfsService.fs:867 — src/Electron/src/Main/Git/GitLfsService.fs:867-884 | src/Electron/src/Main/Git/GitLfsService.fs:930-947 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/Git/GitLfsService.fs:867` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (16–17 lines × 2) src/Client/Modals/SelectiveImportModal.fs:307 — src/Client/Modals/SelectiveImportModal.fs:307-322 | src/Client/Modals/SelectiveImportModal.fs:376-392 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Modals/SelectiveImportModal.fs:307` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16–17 lines × 2) src/Client/SharedComponents/Metadata/Generic.fs:60 — src/Client/SharedComponents/Metadata/Generic.fs:60-75 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:65-81 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Generic.fs` and `src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16–17 lines × 2) src/Client/SharedComponents/Metadata/Generic.fs:78 — src/Client/SharedComponents/Metadata/Generic.fs:78-93 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:84-100 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Generic.fs` and `src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Generic.fs:78` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (6 lines × 2) src/Client/OfficeInterop/OfficeInterop.fs:151 — src/Client/OfficeInterop/OfficeInterop.fs:151-156 | src/Client/OfficeInterop/OfficeInterop.fs:312-317 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/Components/src/Util/ReactHooks.fs:145 — src/Components/src/Util/ReactHooks.fs:145-153 | src/Components/src/Util/ReactHooks.fs:265-270 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Util/ReactHooks.fs:145` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) src/Electron/src/Main/IPC/FileSystemIO.fs:566 — src/Electron/src/Main/IPC/FileSystemIO.fs:566-573 | src/Electron/src/Main/IPC/FileSystemIO.fs:615-620 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/IPC/FileSystemIO.fs:566` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

R4 · Test Coverage · No test reaches this file · ×3

No test reaches this file src/Components/playground/App.tsx — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file src/Components/src/index.ts — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file src/Components/playground/main.tsx — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.

D15 · Churn × Complexity Hotspots · Repeated repair · ×2

Repeated repair: src/Electron/src/Main/ArcVault/WatcherHelpers.fs src/Electron/src/Main/ArcVault/WatcherHelpers.fs:18 — src/Electron/src/Main/ArcVault/WatcherHelpers.fs 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 6 (its worst body is WatcherHelpers.buildWatcherEvent at line 18), 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: “Fixed IPC security fix.”; “Fix lastArcMerge Refactoring”; “Implemented path/event-specific watcher suppression. Fixed logic associated with closeDecisionRecoveryMs. Fixed the phase boundary.”; “Fixed filewatch event calling”. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Electron/src/Main/ArcVault/WatcherHelpers.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/Components/src/Util/Extensions.fs src/Components/src/Util/Extensions.fs:13 — src/Components/src/Util/Extensions.fs 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 4 (its worst body is style.resolveStyle at line 13), 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: “Fixed DataMap term and unit paste alignment. Refactored clipboard handling with typed payloads. Centralized browser clipboard bindings. Added cross-table clipboard regression tests.”; “fix `dotnet run --project ./build/Build.fsproj --` calls with `--` args seperator”; “more pipeline fixes”. 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-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-18 17:01:49 +02:00' --until='2026-09-16 17:01:49 +02:00' --full-history --no-merges -- src/Components/src/Util/Extensions.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.

D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×2

Members sharing a duplicated core (5 members, 50+ identical tokens) src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs:1 — src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs:1-351 | src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:1-417 | src/Components/src/Page/ProvenanceGrouping/ConnectorPaths.fs:1-543 | src/Components/src/Page/ProvenanceGrouping/ConnectorRendering.fs:1-223 | src/Components/src/Page/ProvenanceGrouping/ConnectorTypes.fs:1-100 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) src/Components/src/Page/Metadata/AssayMetadata.fs:1 — src/Components/src/Page/Metadata/AssayMetadata.fs:1-83 | src/Components/src/Page/Metadata/InvestigationMetadata.fs:1-94 | src/Components/src/Page/Metadata/RunMetadata.fs:1-90 | src/Components/src/Page/Metadata/StudyMetadata.fs:1-90 | src/Components/src/Page/Metadata/WorkflowMetadata.fs:1-82 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.

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

Duplicated block (31 lines × 2) src/Client/Model.fs:191 — src/Client/Model.fs:191-221 | src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:16-46 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (31 lines × 2) src/Client/Spreadsheet/IO.fs:67 — src/Client/Spreadsheet/IO.fs:67-97 | src/Components/src/ARCtrl/Json.fs:26-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Spreadsheet/IO.fs:67` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (27 lines × 2) src/Client/SharedComponents/JsBindings/DndKit.fs:8 — src/Client/SharedComponents/JsBindings/DndKit.fs:8-34 | src/Components/src/JsBindings/DndKit.fs:9-35 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) src/Components/src/Primitive/Buttons/Buttons.fs:16 — src/Components/src/Primitive/Buttons/Buttons.fs:16-42 | src/Components/src/Primitive/Buttons/Buttons.fs:47-73 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Primitive/Buttons/Buttons.fs:16` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (23 lines × 2) src/Client/OfficeInterop/OfficeInterop.fs:111 — src/Client/OfficeInterop/OfficeInterop.fs:111-133 | src/Client/OfficeInterop/OfficeInterop.fs:231-253 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 2) src/Components/src/Composite/AnnotationTable/Modals.fs:1188 — src/Components/src/Composite/AnnotationTable/Modals.fs:1188-1210 | src/Components/src/Composite/AnnotationTable/Modals.fs:1638-1660 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/Modals.fs:1188` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (19–20 lines × 2) · ×2

Duplicated block (19–20 lines × 2) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:828 — src/Components/src/Composite/AnnotationTable/ContextMenu.fs:828-846 | src/Components/src/Composite/AnnotationTable/ContextMenu.fs:910-929 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/ContextMenu.fs:828` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19–20 lines × 2) src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:115 — src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:115-134 | src/Components/src/Page/Metadata/FormComponents/TextInput.fs:35-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Page/Metadata/FormComponents/TextInput.fs:35` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (17–18 lines × 2) src/Client/OfficeInterop/OfficeInterop.fs:1801 — src/Client/OfficeInterop/OfficeInterop.fs:1801-1818 | src/Client/OfficeInterop/OfficeInterop.fs:1900-1916 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/OfficeInterop/OfficeInterop.fs:1801` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–18 lines × 2) src/Client/SharedComponents/Metadata/Assay.fs:23 — src/Client/SharedComponents/Metadata/Assay.fs:23-40 | src/Client/SharedComponents/Metadata/Workflow.fs:32-48 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Assay.fs:23` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (17 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:524 — src/Client/SharedComponents/Metadata/Forms.fs:524-540 | src/Components/src/Page/Metadata/FormComponents/InputSequence.fs:108-124 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Forms.fs` and `src/Components/src/Page/Metadata/FormComponents/InputSequence.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Forms.fs:524` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) src/Components/src/Composite/TermSearch/TermSearch.fs:899 — src/Components/src/Composite/TermSearch/TermSearch.fs:899-915 | src/Components/src/Composite/TermSearch/TermSearch.fs:929-945 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/TermSearch/TermSearch.fs:899` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (16 lines × 2) src/Components/src/Composite/TermSearch/Types.fs:24 — src/Components/src/Composite/TermSearch/Types.fs:24-39 | src/Components/src/Composite/TermSearch/Types.fs:42-57 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/TermSearch/Types.fs:24` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) src/Components/src/Page/ProvenanceGrouping/Interaction.fs:174 — src/Components/src/Page/ProvenanceGrouping/Interaction.fs:174-189 | src/Components/src/Page/ProvenanceGrouping/Interaction.fs:227-242 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Page/ProvenanceGrouping/Interaction.fs:174` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.

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

Duplicated block (5 lines × 3) src/Electron/src/Renderer/Context/GitWorkflow.fs:823 — src/Electron/src/Renderer/Context/GitWorkflow.fs:823-827 | src/Electron/src/Renderer/Context/GitWorkflow.fs:831-835 | src/Electron/src/Renderer/Context/GitWorkflow.fs:839-843 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) src/Electron/src/Renderer/Context/GitWorkflow.fs:840 — src/Electron/src/Renderer/Context/GitWorkflow.fs:840-844 | src/Electron/src/Renderer/Context/GitWorkflow.fs:857-861 | src/Electron/src/Renderer/Context/GitWorkflow.fs:980-984 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

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

Duplicated block (22 lines × 2) src/Client/SharedComponents/Metadata/Assay.fs:78 — src/Client/SharedComponents/Metadata/Assay.fs:78-99 | src/Client/SharedComponents/Metadata/Run.fs:83-104 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Assay.fs:78` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (22 lines × 2) src/Components/src/Page/Metadata/AssayMetadata.fs:62 — src/Components/src/Page/Metadata/AssayMetadata.fs:62-83 | src/Components/src/Page/Metadata/RunMetadata.fs:69-90 — before extracting anything, compare `src/Components/src/Page/Metadata/AssayMetadata.fs` and `src/Components/src/Page/Metadata/RunMetadata.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Page/Metadata/AssayMetadata.fs:62` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

AC2 · Forms & labels · <ComboBox> field component without a label · ×1

<ComboBox> field component without a label src/Components/playground/App.tsx:123 — This UI-library field component has no label / aria-label / aria-labelledby / id / name — and neither does anything it renders — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.

AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1

Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

D1 · Cyclomatic Complexity · ProvenanceGrouping.Main (cyclomatic 180) · ×1

ProvenanceGrouping.Main (cyclomatic 180) src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21 — ProvenanceGrouping.Main has cyclomatic complexity 180 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ArcVaultsApi.api (cyclomatic 133) · ×1

ArcVaultsApi.api (cyclomatic 133) src/Electron/src/Main/IPC/IArcVaultsApi.fs:127 — ArcVaultsApi.api has cyclomatic complexity 133 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GitWorkflow.update (cyclomatic 109) · ×1

GitWorkflow.update (cyclomatic 109) src/Electron/src/Renderer/Context/GitWorkflow.fs:1045 — GitWorkflow.update has cyclomatic complexity 109 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · IGitApi.api (cyclomatic 78) · ×1

IGitApi.api (cyclomatic 78) src/Electron/src/Main/IPC/IGitApi.fs:104 — IGitApi.api has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Interface.update (cyclomatic 77) · ×1

Interface.update (cyclomatic 77) src/Client/Update/InterfaceUpdate.fs:87 — Interface.update has cyclomatic complexity 77 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · TextInputWithMarkdown.TextInputWithMarkdown (cyclomatic 76) · ×1

TextInputWithMarkdown.TextInputWithMarkdown (cyclomatic 76) src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:63 — TextInputWithMarkdown.TextInputWithMarkdown has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · FileTree.FileTree (cyclomatic 65) · ×1

FileTree.FileTree (cyclomatic 65) src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs:43 — FileTree.FileTree has cyclomatic complexity 65 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · TutorialOverlay.Main (cyclomatic 63) · ×1

TutorialOverlay.Main (cyclomatic 63) src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs:143 — TutorialOverlay.Main has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Controls.PropertyRailItem (cyclomatic 60) · ×1

Controls.PropertyRailItem (cyclomatic 60) src/Components/src/Page/ProvenanceGrouping/Controls.fs:613 — Controls.PropertyRailItem has cyclomatic complexity 60 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · TermSearch.TermSearch (cyclomatic 55) · ×1

TermSearch.TermSearch (cyclomatic 55) src/Components/src/Composite/TermSearch/TermSearch.fs:772 — TermSearch.TermSearch has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · Spreadsheet.update (cyclomatic 52) · ×1

Spreadsheet.update (cyclomatic 52) src/Client/Update/SpreadsheetUpdate.fs:14 — Spreadsheet.update has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GroupCard.Main (cyclomatic 50) · ×1

GroupCard.Main (cyclomatic 50) src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:300 — GroupCard.Main has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · DropOverlay.DropOverlay (cyclomatic 47) · ×1

DropOverlay.DropOverlay (cyclomatic 47) src/Components/src/Composite/Workspace/DropOverlay.fs:18 — DropOverlay.DropOverlay has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ConnectorOverlay.Main (cyclomatic 41) · ×1

ConnectorOverlay.Main (cyclomatic 41) src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:49 — ConnectorOverlay.Main has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GitProvisioningService.cloneRepository (cyclomatic 41) · ×1

GitProvisioningService.cloneRepository (cyclomatic 41) src/Electron/src/Main/Git/GitProvisioningService.fs:314 — GitProvisioningService.cloneRepository has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Build.main (cyclomatic 39) · ×1

Build.main (cyclomatic 39) build/Build.fs:6 — Build.main has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GitMergeConflictViewer.Viewer (cyclomatic 38) · ×1

GitMergeConflictViewer.Viewer (cyclomatic 38) src/Components/src/Page/GitComparison/GitMergeConflictViewer.fs:564 — GitMergeConflictViewer.Viewer has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · Table.Table (cyclomatic 38) · ×1

Table.Table (cyclomatic 38) src/Components/src/Composite/Table/Table.fs:65 — Table.Table has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitSidebar.Main (cyclomatic 37) · ×1

GitSidebar.Main (cyclomatic 37) src/Components/src/Page/GitSidebar/GitSidebar.fs:1616 — GitSidebar.Main has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · ARCitect.update (cyclomatic 34) · ×1

ARCitect.update (cyclomatic 34) src/Client/Update/ARCitectUpdate.fs:17 — ARCitect.update has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · DataHubBrowser.ExplorePanel (cyclomatic 34) · ×1

DataHubBrowser.ExplorePanel (cyclomatic 34) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:446 — DataHubBrowser.ExplorePanel has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · DataAnnotator.Table (cyclomatic 29) · ×1

DataAnnotator.Table (cyclomatic 29) src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs:159 — DataAnnotator.Table has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · FolderedDraggableList.FolderedDraggableList (cyclomatic 29) · ×1

FolderedDraggableList.FolderedDraggableList (cyclomatic 29) src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:326 — FolderedDraggableList.FolderedDraggableList has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Controls.ValueChip (cyclomatic 27) · ×1

Controls.ValueChip (cyclomatic 27) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1403 — Controls.ValueChip has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Controls.PropertyRail (cyclomatic 26) · ×1

Controls.PropertyRail (cyclomatic 26) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1016 — Controls.PropertyRail has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ArcFileFooterTabs.Main (cyclomatic 25) · ×1

ArcFileFooterTabs.Main (cyclomatic 25) src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs:298 — ArcFileFooterTabs.Main has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · DataHubBrowser.Entry (cyclomatic 25) · ×1

DataHubBrowser.Entry (cyclomatic 25) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:689 — DataHubBrowser.Entry has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Layout.Sidebars (cyclomatic 25) · ×1

Layout.Sidebars (cyclomatic 25) src/Components/src/Composite/Layout/Layout.fs:244 — Layout.Sidebars has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · V2.ontologyApi (cyclomatic 25) · ×1

V2.ontologyApi (cyclomatic 25) src/Server/Api/IOntologyAPI.fs:554 — V2.ontologyApi has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · DataHubBrowserModel.update (cyclomatic 24) · ×1

DataHubBrowserModel.update (cyclomatic 24) src/Components/src/Page/DataHubBrowser/Model.fs:80 — DataHubBrowserModel.update has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitWorkflow.runPrimarySaveAttemptAsync (cyclomatic 24) · ×1

GitWorkflow.runPrimarySaveAttemptAsync (cyclomatic 24) src/Electron/src/Renderer/Context/GitWorkflow.fs:883 — GitWorkflow.runPrimarySaveAttemptAsync has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Main.tryParseToArcFile (cyclomatic 23) · ×1

Main.tryParseToArcFile (cyclomatic 23) src/Client/OfficeInterop/OfficeInterop.fs:1348 — Main.tryParseToArcFile has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · V1.ontologyApi (cyclomatic 23) · ×1

V1.ontologyApi (cyclomatic 23) src/Server/Api/IOntologyAPI.fs:296 — V1.ontologyApi has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · GitLfsService.planOutboundPush (cyclomatic 23) · ×1

GitLfsService.planOutboundPush (cyclomatic 23) src/Electron/src/Main/Git/GitLfsService.fs:967 — GitLfsService.planOutboundPush has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · FormComponents.TextInput (cyclomatic 22) · ×1

FormComponents.TextInput (cyclomatic 22) src/Client/SharedComponents/Metadata/Forms.fs:574 — FormComponents.TextInput has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Helper.applyToTable (cyclomatic 22) · ×1

Helper.applyToTable (cyclomatic 22) src/Components/src/Composite/Widgets/DataAnnotator/Helper.fs:83 — Helper.applyToTable has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ComboBox.ComboBox (cyclomatic 22) · ×1

ComboBox.ComboBox (cyclomatic 22) src/Components/src/Primitive/ComboBox/ComboBox.fs:31 — ComboBox.ComboBox has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · ArcEntityPathRules.classifyDeleteTarget (cyclomatic 22) · ×1

ArcEntityPathRules.classifyDeleteTarget (cyclomatic 22) src/Shared/PathHelpers.fs:290 — ArcEntityPathRules.classifyDeleteTarget has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ArcVaultHelper.updateARCByFileContentDTO (cyclomatic 22) · ×1

ArcVaultHelper.updateARCByFileContentDTO (cyclomatic 22) src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:65 — ArcVaultHelper.updateARCByFileContentDTO has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · FormComponents.ValueInput (cyclomatic 21) · ×1

FormComponents.ValueInput (cyclomatic 21) src/Client/SharedComponents/Metadata/Forms.fs:856 — FormComponents.ValueInput has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · DataHubBrowser.Filter (cyclomatic 21) · ×1

DataHubBrowser.Filter (cyclomatic 21) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:213 — DataHubBrowser.Filter has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · FileExplorer.FileExplorer (cyclomatic 21) · ×1

FileExplorer.FileExplorer (cyclomatic 21) src/Components/src/Page/FileExplorer/FileExplorer.fs:108 — FileExplorer.FileExplorer has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · GitSidebar.OperationStatusNotice (cyclomatic 21) · ×1

GitSidebar.OperationStatusNotice (cyclomatic 21) src/Components/src/Page/GitSidebar/GitSidebar.fs:258 — GitSidebar.OperationStatusNotice has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · AnnotationTableContextMenuUtil.getFittedCells (cyclomatic 21) · ×1

AnnotationTableContextMenuUtil.getFittedCells (cyclomatic 21) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:202 — AnnotationTableContextMenuUtil.getFittedCells has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ContextMenu.ContextMenu (cyclomatic 21) · ×1

ContextMenu.ContextMenu (cyclomatic 21) src/Components/src/Primitive/ContextMenu/ContextMenu.fs:82 — ContextMenu.ContextMenu has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · MessageInteropHelper.buildInProxyInner (cyclomatic 20) · ×1

MessageInteropHelper.buildInProxyInner (cyclomatic 20) src/Client/Util/MessageInterop.fs:140 — MessageInteropHelper.buildInProxyInner has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Notes.Wizard (cyclomatic 20) · ×1

Notes.Wizard (cyclomatic 20) src/Components/src/Composite/Notes/Editor/Notes.fs:76 — Notes.Wizard has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · FileExplorerItem.LFSStatusPill (cyclomatic 19) · ×1

FileExplorerItem.LFSStatusPill (cyclomatic 19) src/Components/src/Page/FileExplorer/FileExplorerItem.fs:118 — FileExplorerItem.LFSStatusPill has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · TextInput.TextInput (cyclomatic 19) · ×1

TextInput.TextInput (cyclomatic 19) src/Components/src/Page/Metadata/FormComponents/TextInput.fs:13 — TextInput.TextInput has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitWorkflow.runCommitAttemptAsync (cyclomatic 19) · ×1

GitWorkflow.runCommitAttemptAsync (cyclomatic 19) src/Electron/src/Renderer/Context/GitWorkflow.fs:809 — GitWorkflow.runCommitAttemptAsync has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · SpreadsheetView.Main (cyclomatic 18) · ×1

SpreadsheetView.Main (cyclomatic 18) src/Client/Views/SpreadsheetView.fs:31 — SpreadsheetView.Main has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ProtocolState.update (cyclomatic 18) · ×1

ProtocolState.update (cyclomatic 18) src/Client/Pages/ProtocolTemplates/ProtocolState.fs:13 — ProtocolState.update has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · LazyLoadTable.Main (cyclomatic 18) · ×1

LazyLoadTable.Main (cyclomatic 18) src/Client/SharedComponents/LazyLoadTable.fs:18 — LazyLoadTable.Main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · GroupCard.OrganizerTab (cyclomatic 18) · ×1

GroupCard.OrganizerTab (cyclomatic 18) src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:160 — GroupCard.OrganizerTab has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · DataMapTable.DataMapTable (cyclomatic 18) · ×1

DataMapTable.DataMapTable (cyclomatic 18) src/Components/src/Composite/DataMapTable/DataMapTable.fs:252 — DataMapTable.DataMapTable has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · AnnotationTableContextMenuUtil.pasteCells (cyclomatic 18) · ×1

AnnotationTableContextMenuUtil.pasteCells (cyclomatic 18) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:495 — AnnotationTableContextMenuUtil.pasteCells has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · FileStateContext.FileStateCtxProviderWithSnapshots (cyclomatic 18) · ×1

FileStateContext.FileStateCtxProviderWithSnapshots (cyclomatic 18) src/Electron/src/Renderer/Context/FileStateContext.fs:65 — FileStateContext.FileStateCtxProviderWithSnapshots has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GitService.confirmMergeResolution (cyclomatic 18) · ×1

GitService.confirmMergeResolution (cyclomatic 18) src/Electron/src/Main/Git/GitService.fs:2632 — GitService.confirmMergeResolution has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · Main.fillSelectedWithOntologyAnnotation (cyclomatic 17) · ×1

Main.fillSelectedWithOntologyAnnotation (cyclomatic 17) src/Client/OfficeInterop/OfficeInterop.fs:2236 — Main.fillSelectedWithOntologyAnnotation has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Helper.SemVer.comparePreRelease.Static (cyclomatic 17) · ×1

Helper.SemVer.comparePreRelease.Static (cyclomatic 17) src/Components/src/Page/ValidationPackageBrowser/Helper.fs:14 — Helper.SemVer.comparePreRelease.Static has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · MergeConflicts.parseMergeConflictFragments (cyclomatic 17) · ×1

MergeConflicts.parseMergeConflictFragments (cyclomatic 17) src/Components/src/Page/GitComparison/GitTextComparison.Core.fs:494 — MergeConflicts.parseMergeConflictFragments has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Controls.FilterToolbar (cyclomatic 17) · ×1

Controls.FilterToolbar (cyclomatic 17) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1778 — Controls.FilterToolbar has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · BuildingBlockWidget.Main (cyclomatic 17) · ×1

BuildingBlockWidget.Main (cyclomatic 17) src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:242 — BuildingBlockWidget.Main has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · JsonImport.JsonImport (cyclomatic 17) · ×1

JsonImport.JsonImport (cyclomatic 17) src/Components/src/Composite/Widgets/JsonImport/JsonImport.fs:45 — JsonImport.JsonImport has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · TargetSelector.Main (cyclomatic 17) · ×1

TargetSelector.Main (cyclomatic 17) src/Components/src/Composite/Notes/Editor/TargetSelector.fs:11 — TargetSelector.Main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · AnnotationTable.ModalController (cyclomatic 17) · ×1

AnnotationTable.ModalController (cyclomatic 17) src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:357 — AnnotationTable.ModalController has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ArcEntityPathRules.classifyRenameTarget (cyclomatic 17) · ×1

ArcEntityPathRules.classifyRenameTarget (cyclomatic 17) src/Shared/PathHelpers.fs:410 — ArcEntityPathRules.classifyRenameTarget has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitService.previewPull (cyclomatic 17) · ×1

GitService.previewPull (cyclomatic 17) src/Electron/src/Main/Git/GitService.fs:1791 — GitService.previewPull has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitService.freeLocalLfsCopy (cyclomatic 17) · ×1

GitService.freeLocalLfsCopy (cyclomatic 17) src/Electron/src/Main/Git/GitService.fs:2437 — GitService.freeLocalLfsCopy has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GitLfsService.tryReadBatchPointerOids (cyclomatic 17) · ×1

GitLfsService.tryReadBatchPointerOids (cyclomatic 17) src/Electron/src/Main/Git/GitLfsService.fs:568 — GitLfsService.tryReadBatchPointerOids has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Main.convertBuildingBlock (cyclomatic 16) · ×1

Main.convertBuildingBlock (cyclomatic 16) src/Client/OfficeInterop/OfficeInterop.fs:2052 — Main.convertBuildingBlock has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · FileExplorerItem.DirectoryRow (cyclomatic 16) · ×1

FileExplorerItem.DirectoryRow (cyclomatic 16) src/Components/src/Page/FileExplorer/FileExplorerItem.fs:261 — FileExplorerItem.DirectoryRow has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Controls.ConnectionHandle (cyclomatic 16) · ×1

Controls.ConnectionHandle (cyclomatic 16) src/Components/src/Page/ProvenanceGrouping/Controls.fs:24 — Controls.ConnectionHandle has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · FlipColumn.View (cyclomatic 16) · ×1

FlipColumn.View (cyclomatic 16) src/Components/src/Page/ProvenanceGrouping/ViewSupport.fs:230 — FlipColumn.View has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · GridSelect.GetNextIndex (cyclomatic 16) · ×1

GridSelect.GetNextIndex (cyclomatic 16) src/Components/src/Composite/Table/KeyboardNavigation.fs:138 — GridSelect.GetNextIndex has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · TermSearch.TermItem (cyclomatic 16) · ×1

TermSearch.TermItem (cyclomatic 16) src/Components/src/Composite/TermSearch/TermSearch.fs:183 — TermSearch.TermItem has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ErrorModalProvider.ErrorModalHost (cyclomatic 16) · ×1

ErrorModalProvider.ErrorModalHost (cyclomatic 16) src/Components/src/Primitive/ErrorModal/Provider.fs:102 — ErrorModalProvider.ErrorModalHost has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Blankslate.Blankslate (cyclomatic 16) · ×1

Blankslate.Blankslate (cyclomatic 16) src/Components/src/Primitive/Blankslate/Blankslate.fs:69 — Blankslate.Blankslate has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · EmptyColumnJson.normalize (cyclomatic 16) · ×1

EmptyColumnJson.normalize (cyclomatic 16) src/Components/src/ARCtrl/EmptyColumnJson.fs:34 — EmptyColumnJson.normalize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitService.getDiffViewData (cyclomatic 16) · ×1

GitService.getDiffViewData (cyclomatic 16) src/Electron/src/Main/Git/GitService.fs:1621 — GitService.getDiffViewData has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · GitLfsService.getLfsObjectIdsFromObjectIds (cyclomatic 16) · ×1

GitLfsService.getLfsObjectIdsFromObjectIds (cyclomatic 16) src/Electron/src/Main/Git/GitLfsService.fs:826 — GitLfsService.getLfsObjectIdsFromObjectIds has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · GitLfsAdapter.runGitProcess (cyclomatic 16) · ×1

GitLfsAdapter.runGitProcess (cyclomatic 16) src/Electron/src/Main/Git/GitlfsAdapter.fs:37 — GitLfsAdapter.runGitProcess has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

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

Test reliability not measured — JavaScript/TypeScript suite install refused the lockfile — Test reliability NOT MEASURED: this repository's test suite spans .NET and JavaScript/TypeScript, and the JavaScript/TypeScript half could not be re-run — unit: measured (0 flaky); JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in the repository root; vitest via `npm ci --ignore-scripts` in src/Components/): not included — the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. No partial figure is published as if it were the whole: reliability is excluded from the score rather than counted as a near-zero.

D2 · Cognitive Complexity · ProvenanceGrouping.Main (cognitive 192) · ×1

ProvenanceGrouping.Main (cognitive 192) src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21 — ProvenanceGrouping.Main has cognitive complexity 192 (threshold 15). Drivers by points: if/else 93 (115 pts), match/switch 53 (65 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 36). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · GitProvisioningService.cloneRepository (cognitive 154) · ×1

GitProvisioningService.cloneRepository (cognitive 154) src/Electron/src/Main/Git/GitProvisioningService.fs:314 — GitProvisioningService.cloneRepository has cognitive complexity 154 (threshold 15). Drivers by points: match/switch 14 (99 pts), error handling 4 (36 pts), if/else 6 (18 pts), boolean chains 1 (nesting depth added 129). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ArcVaultsApi.api (cognitive 152) · ×1

ArcVaultsApi.api (cognitive 152) src/Electron/src/Main/IPC/IArcVaultsApi.fs:127 — ArcVaultsApi.api has cognitive complexity 152 (threshold 15). Drivers by points: match/switch 42 (83 pts), if/else 30 (37 pts), error handling 26 (28 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 51). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · TextInputWithMarkdown.TextInputWithMarkdown (cognitive 117) · ×1

TextInputWithMarkdown.TextInputWithMarkdown (cognitive 117) src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:63 — TextInputWithMarkdown.TextInputWithMarkdown has cognitive complexity 117 (threshold 15). Drivers by points: if/else 46 (67 pts), match/switch 17 (36 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TutorialOverlay.Main (cognitive 92) · ×1

TutorialOverlay.Main (cognitive 92) src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs:143 — TutorialOverlay.Main has cognitive complexity 92 (threshold 15). Drivers by points: if/else 43 (65 pts), match/switch 13 (21 pts), boolean chains 6 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TermSearch.TermSearch (cognitive 84) · ×1

TermSearch.TermSearch (cognitive 84) src/Components/src/Composite/TermSearch/TermSearch.fs:772 — TermSearch.TermSearch has cognitive complexity 84 (threshold 15). Drivers by points: if/else 48 (56 pts), loops 8 (20 pts), boolean chains 5, match/switch 3 (nesting depth added 20). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Table.Table (cognitive 82) · ×1

Table.Table (cognitive 82) src/Components/src/Composite/Table/Table.fs:65 — Table.Table has cognitive complexity 82 (threshold 15). Drivers by points: if/else 42 (74 pts), loops 3 (5 pts), match/switch 2, boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Interface.update (cognitive 79) · ×1

Interface.update (cognitive 79) src/Client/Update/InterfaceUpdate.fs:87 — Interface.update has cognitive complexity 79 (threshold 15). Drivers by points: match/switch 27 (61 pts), if/else 6 (13 pts), loops 1 (4 pts), error handling 1 (nesting depth added 44). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GroupCard.Main (cognitive 77) · ×1

GroupCard.Main (cognitive 77) src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:300 — GroupCard.Main has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (45 pts), match/switch 13 (18 pts), loops 4 (11 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FileTree.FileTree (cognitive 73) · ×1

FileTree.FileTree (cognitive 73) src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs:43 — FileTree.FileTree has cognitive complexity 73 (threshold 15). Drivers by points: match/switch 23 (49 pts), if/else 18 (21 pts), boolean chains 3 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Main.fillSelectedWithOntologyAnnotation (cognitive 66) · ×1

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

D2 · Cognitive Complexity · Controls.PropertyRailItem (cognitive 60) · ×1

Controls.PropertyRailItem (cognitive 60) src/Components/src/Page/ProvenanceGrouping/Controls.fs:613 — Controls.PropertyRailItem has cognitive complexity 60 (threshold 15). Drivers by points: if/else 31 (34 pts), match/switch 17 (20 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Main.rectifyTermColumns (cognitive 54) · ×1

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

D2 · Cognitive Complexity · IGitApi.api (cognitive 53) · ×1

IGitApi.api (cognitive 53) src/Electron/src/Main/IPC/IGitApi.fs:104 — IGitApi.api has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 36 (45 pts), if/else 4 (8 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · V2.ontologyApi (cognitive 49) · ×1

V2.ontologyApi (cognitive 49) src/Server/Api/IOntologyAPI.fs:554 — V2.ontologyApi has cognitive complexity 49 (threshold 15). Drivers by points: if/else 33 (43 pts), match/switch 4, boolean chains 2 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · DropOverlay.DropOverlay (cognitive 48) · ×1

DropOverlay.DropOverlay (cognitive 48) src/Components/src/Composite/Workspace/DropOverlay.fs:18 — DropOverlay.DropOverlay has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 19 (39 pts), if/else 7 (9 pts) (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitMergeConflictViewer.Viewer (cognitive 46) · ×1

GitMergeConflictViewer.Viewer (cognitive 46) src/Components/src/Page/GitComparison/GitMergeConflictViewer.fs:564 — GitMergeConflictViewer.Viewer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (33 pts), match/switch 6 (8 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · GitSidebar.Main (cognitive 46) · ×1

GitSidebar.Main (cognitive 46) src/Components/src/Page/GitSidebar/GitSidebar.fs:1616 — GitSidebar.Main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 35 (39 pts), match/switch 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · GitWorkflow.update (cognitive 46) · ×1

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

D2 · Cognitive Complexity · GitService.previewPull (cognitive 46) · ×1

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

D2 · Cognitive Complexity · ConnectorOverlay.Main (cognitive 45) · ×1

ConnectorOverlay.Main (cognitive 45) src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:49 — ConnectorOverlay.Main has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 15 (27 pts), if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · V1.ontologyApi (cognitive 45) · ×1

V1.ontologyApi (cognitive 45) src/Server/Api/IOntologyAPI.fs:296 — V1.ontologyApi has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31 (40 pts), match/switch 4, boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · GitLfsService.planOutboundPush (cognitive 44) · ×1

GitLfsService.planOutboundPush (cognitive 44) src/Electron/src/Main/Git/GitLfsService.fs:967 — GitLfsService.planOutboundPush has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 7 (28 pts), if/else 4 (16 pts) (nesting depth added 33). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitService.getDiffViewData (cognitive 43) · ×1

GitService.getDiffViewData (cognitive 43) src/Electron/src/Main/Git/GitService.fs:1621 — GitService.getDiffViewData has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 6 (22 pts), if/else 8 (20 pts), boolean chains 1 (nesting depth added 28). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitService.confirmMergeResolution (cognitive 41) · ×1

GitService.confirmMergeResolution (cognitive 41) src/Electron/src/Main/Git/GitService.fs:2632 — GitService.confirmMergeResolution has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 6 (15 pts), error handling 1 (5 pts), boolean chains 1 (nesting depth added 28). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Controls.PropertyRail (cognitive 39) · ×1

Controls.PropertyRail (cognitive 39) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1016 — Controls.PropertyRail has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · DataAnnotator.Table (cognitive 39) · ×1

DataAnnotator.Table (cognitive 39) src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs:159 — DataAnnotator.Table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 5 (8 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Build.main (cognitive 37) · ×1

Build.main (cognitive 37) build/Build.fs:6 — Build.main has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · FolderedDraggableList.FolderedDraggableList (cognitive 36) · ×1

FolderedDraggableList.FolderedDraggableList (cognitive 36) src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:326 — FolderedDraggableList.FolderedDraggableList has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 6 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ContextMenu.ContextMenu (cognitive 36) · ×1

ContextMenu.ContextMenu (cognitive 36) src/Components/src/Primitive/ContextMenu/ContextMenu.fs:82 — ContextMenu.ContextMenu has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · AnnotationTableContextMenuUtil.pasteCells (cognitive 35) · ×1

AnnotationTableContextMenuUtil.pasteCells (cognitive 35) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:495 — AnnotationTableContextMenuUtil.pasteCells has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · EmptyColumnJson.normalize (cognitive 35) · ×1

EmptyColumnJson.normalize (cognitive 35) src/Components/src/ARCtrl/EmptyColumnJson.fs:34 — EmptyColumnJson.normalize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · GitLfsService.tryReadBatchPointerOids (cognitive 34) · ×1

GitLfsService.tryReadBatchPointerOids (cognitive 34) src/Electron/src/Main/Git/GitLfsService.fs:568 — GitLfsService.tryReadBatchPointerOids has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, match/switch 1 (5 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GridSelect.SelectAt (cognitive 33) · ×1

GridSelect.SelectAt (cognitive 33) src/Components/src/Composite/Table/KeyboardNavigation.fs:243 — GridSelect.SelectAt has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FormComponents.ValueInput (cognitive 32) · ×1

FormComponents.ValueInput (cognitive 32) src/Client/SharedComponents/Metadata/Forms.fs:856 — FormComponents.ValueInput has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 7 (10 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DataHubBrowser.ExplorePanel (cognitive 32) · ×1

DataHubBrowser.ExplorePanel (cognitive 32) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:446 — DataHubBrowser.ExplorePanel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 8 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Helper.applyToTable (cognitive 32) · ×1

Helper.applyToTable (cognitive 32) src/Components/src/Composite/Widgets/DataAnnotator/Helper.fs:83 — Helper.applyToTable has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 3 (8 pts), error handling 1 (3 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Helper.updateTables (cognitive 32) · ×1

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

D2 · Cognitive Complexity · ArcEntityPathRules.classifyRenameTarget (cognitive 32) · ×1

ArcEntityPathRules.classifyRenameTarget (cognitive 32) src/Shared/PathHelpers.fs:410 — ArcEntityPathRules.classifyRenameTarget has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (16 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Controls.ValueChip (cognitive 31) · ×1

Controls.ValueChip (cognitive 31) src/Components/src/Page/ProvenanceGrouping/Controls.fs:1403 — Controls.ValueChip has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 8 (13 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ArcEntityPathRules.classifyDeleteTarget (cognitive 31) · ×1

ArcEntityPathRules.classifyDeleteTarget (cognitive 31) src/Shared/PathHelpers.fs:290 — ArcEntityPathRules.classifyDeleteTarget has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 7 (12 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · AuthService.revalidate (cognitive 31) · ×1

AuthService.revalidate (cognitive 31) src/Electron/src/Main/Auth/AuthService.fs:494 — AuthService.revalidate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (12 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GitLfsService.getLfsObjectIdsFromObjectIds (cognitive 30) · ×1

GitLfsService.getLfsObjectIdsFromObjectIds (cognitive 30) src/Electron/src/Main/Git/GitLfsService.fs:826 — GitLfsService.getLfsObjectIdsFromObjectIds has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 5 (21 pts), if/else 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DataHubBrowserModel.update (cognitive 29) · ×1

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

D2 · Cognitive Complexity · FileExplorer.FileExplorer (cognitive 29) · ×1

FileExplorer.FileExplorer (cognitive 29) src/Components/src/Page/FileExplorer/FileExplorer.fs:108 — FileExplorer.FileExplorer has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Notes.Wizard (cognitive 29) · ×1

Notes.Wizard (cognitive 29) src/Components/src/Composite/Notes/Editor/Notes.fs:76 — Notes.Wizard has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 5 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · AnnotationTableContextMenuUtil.getFittedCells (cognitive 29) · ×1

AnnotationTableContextMenuUtil.getFittedCells (cognitive 29) src/Components/src/Composite/AnnotationTable/ContextMenu.fs:202 — AnnotationTableContextMenuUtil.getFittedCells has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cognitive 29) · ×1

ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cognitive 29) src/Electron/src/Main/ArcVault/ArcVault.fs:480 — ArcVaultExtensions.ArcVault.RenameOpenArcRoot has cognitive complexity 29 (threshold 15). Drivers by points: error handling 4 (14 pts), if/else 5 (12 pts), match/switch 2 (3 pts) (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitService.push (cognitive 29) · ×1

GitService.push (cognitive 29) src/Electron/src/Main/Git/GitService.fs:2043 — GitService.push has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 4 (14 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Main.convertBuildingBlock (cognitive 28) · ×1

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

D2 · Cognitive Complexity · ArcVaults.OnCloseWindow (cognitive 28) · ×1

ArcVaults.OnCloseWindow (cognitive 28) src/Electron/src/Main/ArcVault/ArcVault.fs:652 — ArcVaults.OnCloseWindow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 1 (4 pts), match/switch 1 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · ARCitect.update (cognitive 26) · ×1

ARCitect.update (cognitive 26) src/Client/Update/ARCitectUpdate.fs:17 — ARCitect.update has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 5 (12 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · MessageInteropHelper.buildInProxyInner (cognitive 26) · ×1

MessageInteropHelper.buildInProxyInner (cognitive 26) src/Client/Util/MessageInterop.fs:140 — MessageInteropHelper.buildInProxyInner has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 4 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · TextInput.TextInput (cognitive 26) · ×1

TextInput.TextInput (cognitive 26) src/Components/src/Page/Metadata/FormComponents/TextInput.fs:13 — TextInput.TextInput has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FormComponents.TextInput (cognitive 25) · ×1

FormComponents.TextInput (cognitive 25) src/Client/SharedComponents/Metadata/Forms.fs:574 — FormComponents.TextInput has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · LazyLoadTable.Main (cognitive 25) · ×1

LazyLoadTable.Main (cognitive 25) src/Client/SharedComponents/LazyLoadTable.fs:18 — LazyLoadTable.Main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · FlipColumn.View (cognitive 25) · ×1

FlipColumn.View (cognitive 25) src/Components/src/Page/ProvenanceGrouping/ViewSupport.fs:230 — FlipColumn.View has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (7 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · BuildingBlockWidget.Main (cognitive 25) · ×1

BuildingBlockWidget.Main (cognitive 25) src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:242 — BuildingBlockWidget.Main has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 7 (12 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitService.freeLocalLfsCopy (cognitive 25) · ×1

GitService.freeLocalLfsCopy (cognitive 25) src/Electron/src/Main/Git/GitService.fs:2437 — GitService.freeLocalLfsCopy has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (21 pts), error handling 1 (4 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · MergeConflicts.parseMergeConflictFragments (cognitive 24) · ×1

MergeConflicts.parseMergeConflictFragments (cognitive 24) src/Components/src/Page/GitComparison/GitTextComparison.Core.fs:494 — MergeConflicts.parseMergeConflictFragments has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 9 (10 pts), loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · EditorPanels.assignmentBatchWarning (cognitive 24) · ×1

EditorPanels.assignmentBatchWarning (cognitive 24) src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:26 — EditorPanels.assignmentBatchWarning has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (20 pts), match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · GroupCard.OrganizerTab (cognitive 24) · ×1

GroupCard.OrganizerTab (cognitive 24) src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:160 — GroupCard.OrganizerTab has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · ArcFileSystemHelper.moveGenericFileSystemItemOnDisk (cognitive 24) · ×1

ArcFileSystemHelper.moveGenericFileSystemItemOnDisk (cognitive 24) src/Electron/src/Main/IPC/FileSystemIO.fs:614 — ArcFileSystemHelper.moveGenericFileSystemItemOnDisk has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitService.pull (cognitive 24) · ×1

GitService.pull (cognitive 24) src/Electron/src/Main/Git/GitService.fs:1933 — GitService.pull has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 3 (9 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · JsonImportHelper.updateTables (cognitive 23) · ×1

JsonImportHelper.updateTables (cognitive 23) src/Client/Update/UpdateUtil.fs:121 — JsonImportHelper.updateTables has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitLfsService.filterResolvableRemoteTipIds (cognitive 23) · ×1

GitLfsService.filterResolvableRemoteTipIds (cognitive 23) src/Electron/src/Main/Git/GitLfsService.fs:775 — GitLfsService.filterResolvableRemoteTipIds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · EditorPanels.connectionDetails (cognitive 22) · ×1

EditorPanels.connectionDetails (cognitive 22) src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:242 — EditorPanels.connectionDetails has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (9 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · TargetSelector.Main (cognitive 22) · ×1

TargetSelector.Main (cognitive 22) src/Components/src/Composite/Notes/Editor/TargetSelector.fs:11 — TargetSelector.Main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ContextMenuModals.MoveColumnModal (cognitive 22) · ×1

ContextMenuModals.MoveColumnModal (cognitive 22) src/Components/src/Composite/AnnotationTable/Modals.fs:663 — ContextMenuModals.MoveColumnModal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · FileTreeRenameWorkflow.confirmRenameItem (cognitive 22) · ×1

FileTreeRenameWorkflow.confirmRenameItem (cognitive 22) src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTreeRename.fs:50 — FileTreeRenameWorkflow.confirmRenameItem has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 2 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ArcVaultHelper.updateARCByFileContentDTO (cognitive 22) · ×1

ArcVaultHelper.updateARCByFileContentDTO (cognitive 22) src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:65 — ArcVaultHelper.updateARCByFileContentDTO has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (22 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · FileExplorerItem.LFSStatusPill (cognitive 21) · ×1

FileExplorerItem.LFSStatusPill (cognitive 21) src/Components/src/Page/FileExplorer/FileExplorerItem.fs:118 — FileExplorerItem.LFSStatusPill has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · GitSidebar.OperationStatusNotice (cognitive 21) · ×1

GitSidebar.OperationStatusNotice (cognitive 21) src/Components/src/Page/GitSidebar/GitSidebar.fs:258 — GitSidebar.OperationStatusNotice has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 4 (8 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Controls.SourceInfoPopover (cognitive 21) · ×1

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

D2 · Cognitive Complexity · AnnotationTable.ModalController (cognitive 21) · ×1

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

D2 · Cognitive Complexity · ComboBox.ComboBox (cognitive 21) · ×1

ComboBox.ComboBox (cognitive 21) src/Components/src/Primitive/ComboBox/ComboBox.fs:31 — ComboBox.ComboBox has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · GitService.discardPaths (cognitive 21) · ×1

GitService.discardPaths (cognitive 21) src/Electron/src/Main/Git/GitService.fs:2541 — GitService.discardPaths has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (7 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitLfsService.tryGetOptimizedLfsObjectIds (cognitive 21) · ×1

GitLfsService.tryGetOptimizedLfsObjectIds (cognitive 21) src/Electron/src/Main/Git/GitLfsService.fs:869 — GitLfsService.tryGetOptimizedLfsObjectIds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · DataHubBrowser.GitLabEntry (cognitive 20) · ×1

DataHubBrowser.GitLabEntry (cognitive 20) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:1031 — DataHubBrowser.GitLabEntry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · DragHandlers.applyPropertyValueToGroups (cognitive 20) · ×1

DragHandlers.applyPropertyValueToGroups (cognitive 20) src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:375 — DragHandlers.applyPropertyValueToGroups has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · TemplateImportModalPreview.TemplateImportModalPreview (cognitive 20) · ×1

TemplateImportModalPreview.TemplateImportModalPreview (cognitive 20) src/Components/src/Composite/TemplateBrowser/TemplateImportModalPreview.fs:34 — TemplateImportModalPreview.TemplateImportModalPreview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (10 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GitService.enforceStageTimeLfsTrackingForPaths (cognitive 20) · ×1

GitService.enforceStageTimeLfsTrackingForPaths (cognitive 20) src/Electron/src/Main/Git/GitService.fs:932 — GitService.enforceStageTimeLfsTrackingForPaths has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Main.joinTables (cognitive 19) · ×1

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

D2 · Cognitive Complexity · Main.tryGetValidConversionCellTypes (cognitive 19) · ×1

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

D2 · Cognitive Complexity · ArcFileFooterTabs.Main (cognitive 19) · ×1

ArcFileFooterTabs.Main (cognitive 19) src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs:298 — ArcFileFooterTabs.Main has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5, boolean chains 2, loops 2 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · EmptyTableModals.PreviousTableSelect (cognitive 18) · ×1

EmptyTableModals.PreviousTableSelect (cognitive 18) src/Client/MainComponents/EmptyTableModals.fs:32 — EmptyTableModals.PreviousTableSelect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2 (6 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · Main.tryParseToArcFile (cognitive 18) · ×1

Main.tryParseToArcFile (cognitive 18) src/Client/OfficeInterop/OfficeInterop.fs:1348 — Main.tryParseToArcFile has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (18 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Helper.SemVer.comparePreRelease.Static (cognitive 18) · ×1

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

D2 · Cognitive Complexity · Layout.Sidebars (cognitive 18) · ×1

Layout.Sidebars (cognitive 18) src/Components/src/Composite/Layout/Layout.fs:244 — Layout.Sidebars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · MarkdownPluginPromptModal.View (cognitive 18) · ×1

MarkdownPluginPromptModal.View (cognitive 18) src/Components/src/Composite/MarkdownText/Plugins/MarkdownPluginPromptModal.fs:32 — MarkdownPluginPromptModal.View has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GitService.getOriginRepositoryWebUrl (cognitive 18) · ×1

GitService.getOriginRepositoryWebUrl (cognitive 18) src/Electron/src/Main/Git/GitService.fs:2797 — GitService.getOriginRepositoryWebUrl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 4 (8 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · GitLfsService.readLsFilesByRelativePath (cognitive 18) · ×1

GitLfsService.readLsFilesByRelativePath (cognitive 18) src/Electron/src/Main/Git/GitLfsService.fs:230 — GitLfsService.readLsFilesByRelativePath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GitLfsAdapter.runGitProcess (cognitive 18) · ×1

GitLfsAdapter.runGitProcess (cognitive 18) src/Electron/src/Main/Git/GitlfsAdapter.fs:37 — GitLfsAdapter.runGitProcess has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · NoFileElement.Main (cognitive 17) · ×1

NoFileElement.Main (cognitive 17) src/Client/MainComponents/NoFileElement.fs:147 — NoFileElement.Main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (6 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · DataHubBrowser.Entry (cognitive 17) · ×1

DataHubBrowser.Entry (cognitive 17) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:689 — DataHubBrowser.Entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 6, boolean chains 1, loops 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · DataHubBrowser.Filter (cognitive 17) · ×1

DataHubBrowser.Filter (cognitive 17) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:213 — DataHubBrowser.Filter has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DataHubBrowser.Tabs (cognitive 17) · ×1

DataHubBrowser.Tabs (cognitive 17) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:347 — DataHubBrowser.Tabs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FileExplorerItem.DirectoryRow (cognitive 17) · ×1

FileExplorerItem.DirectoryRow (cognitive 17) src/Components/src/Page/FileExplorer/FileExplorerItem.fs:261 — FileExplorerItem.DirectoryRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Workspace.Workspace (cognitive 17) · ×1

Workspace.Workspace (cognitive 17) src/Components/src/Composite/Workspace/Workspace.fs:96 — Workspace.Workspace has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4, boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DropTarget.resolveDropTarget (cognitive 17) · ×1

DropTarget.resolveDropTarget (cognitive 17) src/Components/src/Composite/Workspace/Helper/DropTarget.fs:64 — DropTarget.resolveDropTarget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · CompositeCellModal.CompositeCellModal (cognitive 17) · ×1

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

D2 · Cognitive Complexity · ErrorModalProvider.ErrorModalHost (cognitive 17) · ×1

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

D2 · Cognitive Complexity · Popover.Content (cognitive 17) · ×1

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

D2 · Cognitive Complexity · ArcRenameHelper.renameResolvedArcEntityAsync (cognitive 17) · ×1

ArcRenameHelper.renameResolvedArcEntityAsync (cognitive 17) src/Electron/src/Main/IPC/Rename.fs:71 — ArcRenameHelper.renameResolvedArcEntityAsync has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (3 pts), error handling 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · AuthService.signIn (cognitive 17) · ×1

AuthService.signIn (cognitive 17) src/Electron/src/Main/Auth/AuthService.fs:344 — AuthService.signIn has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (8 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Changelog.tryFindLastVersion (cognitive 16) · ×1

Changelog.tryFindLastVersion (cognitive 16) build/IO/Changelog.fs:61 — Changelog.tryFindLastVersion has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (16 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · History.updateHistoryStorageMsg (cognitive 16) · ×1

History.updateHistoryStorageMsg (cognitive 16) src/Client/Update.fs:228 — History.updateHistoryStorageMsg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Main.getCompositeColumnDetails (cognitive 16) · ×1

Main.getCompositeColumnDetails (cognitive 16) src/Client/OfficeInterop/OfficeInterop.fs:1835 — Main.getCompositeColumnDetails has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (5 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Helper.computeNewPackages (cognitive 16) · ×1

Helper.computeNewPackages (cognitive 16) src/Components/src/Page/ValidationPackageBrowser/Helper.fs:274 — Helper.computeNewPackages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (6 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FileExplorerGitLfsHelper.contextMenuItems (cognitive 16) · ×1

FileExplorerGitLfsHelper.contextMenuItems (cognitive 16) src/Components/src/Page/FileExplorer/FileExplorerGitLfsHelper.fs:107 — FileExplorerGitLfsHelper.contextMenuItems has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ValueAssignment.planPropertyValueDrop (cognitive 16) · ×1

ValueAssignment.planPropertyValueDrop (cognitive 16) src/Components/src/Page/ProvenanceGrouping/EndpointAndAssignment.fs:54 — ValueAssignment.planPropertyValueDrop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FileIOHelper.tryGetRepoRelativePathCore (cognitive 16) · ×1

FileIOHelper.tryGetRepoRelativePathCore (cognitive 16) src/Electron/src/Swate.Electron.Shared/FileIOHelper.fs:41 — FileIOHelper.tryGetRepoRelativePathCore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GitLfsService.uploadObjects (cognitive 16) · ×1

GitLfsService.uploadObjects (cognitive 16) src/Electron/src/Main/Git/GitLfsService.fs:1064 — GitLfsService.uploadObjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · InMemoryChangesExtensions.ARC.hasInMemoryChanges (cognitive 16) · ×1

InMemoryChangesExtensions.ARC.hasInMemoryChanges (cognitive 16) src/Electron/src/Main/ARCtrlExtensions/InMemoryChanges.fs:181 — InMemoryChangesExtensions.ARC.hasInMemoryChanges has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 4, if/else 4 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · FileTreeCreator.getFileEntries (cognitive 16) · ×1

FileTreeCreator.getFileEntries (cognitive 16) src/Electron/src/Main/FileTreeCreator.fs:118 — FileTreeCreator.getFileEntries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

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

Medium: watchdog-checkout-credential-persisted-in-privileged-job .github/workflows/release-pipeline.yml:25 — This job checks the repository out with `actions/checkout` at its default `persist-credentials: true`, so the action writes the job''s GitHub token into the workspace as a credential header in `.git/config` and leaves it there for the whole job - and this job holds `contents: write`, which makes that a credential that can PUSH TO THIS REPOSITORY. The same job then installs its third-party dependencies, which runs install hooks and build plugins from the entire transitive dependency tree in that same workspace; any one of them can read the file and use the token to commit to the repository, and a release built from that repository afterwards carries whatever it wrote. Nothing in this workflow pushes with that ambient credential, so it is not needed here: add `persist-credentials: false` to the checkout step''s `with:` block. Where a later step DOES need to push, keep the credential out of the workspace and give that step an explicit token instead. If this job does not need write access at all, narrowing its `permissions:` to `contents: read` addresses the same exposure from the other side. This is a semgrep security-AUDIT rule reporting a POLICY that is absent or weaker than its recommendation, not an exploitable defect. Confirm whether the current setting is a deliberate decision for this repository — and apply the change where it is not; where it is (a policy your release process already enforces elsewhere, or one this repository has consciously opted out of), record the decision and leave the configuration as it is.

D3 · God Classes · TooManyMethods · ×1

TooManyMethods: Icons src/Components/src/Primitive/Icons.fs:9 — TooManyMethods — 76 methods. The bar is 30 methods; this is 46 over it, 2.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.

D35 · Change Coupling · Change-coupling hub · ×1

Change-coupling hub: GitService.fs → GitStateContext.fs, GitWorkflow.fs, GitApiClient.fs src/Electron/src/Main/Git/GitService.fs — `src/Electron/src/Main/Git/GitService.fs` changes together with 3 other files — `src/Electron/src/Renderer/Context/GitStateContext.fs`, `src/Electron/src/Renderer/Context/GitWorkflow.fs`, `src/Electron/src/Renderer/GitApiClient.fs` — 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.

D36 · Supply-chain Provenance & Signing · Unpinned build actions · ×1

Unpinned build actions — CI references GitHub Actions by a floating ref (@main / @tag) rather than a pinned commit SHA, weakening build integrity. 23 floating ref(s) across 5 workflow file(s). Each floating ref is itemized at file:line by the SAST (D29) lens.

D36 · Supply-chain Provenance & Signing · PR-triggered workflow without a permissions block · ×1

PR-triggered workflow without a permissions block — 2 workflow(s) triggered by pull_request run at least one job at the repository's default GITHUB_TOKEN scope (ensure-formatting.yml, run-tests.yml) — no top-level `permissions:` block, and at least one job declaring none of its own — while 2 sibling workflows in the same repository are already scoped. A job that declares nothing inherits the workflow-level block, and with no workflow-level block it inherits the repository default, so scoping some of a workflow's jobs leaves the rest exactly as wide as scoping none. Pull-request runs build the least-trusted code in the repository; give each of these workflows its own least-privilege block — `permissions: {contents: read}` at the top of the workflow, widened per job only where a job genuinely writes.

D36 · Supply-chain Provenance & Signing · Workflow holding a long-lived secret is unscoped · ×1

Workflow holding a long-lived secret is unscoped — 2 workflow(s) inject a long-lived repository secret while leaving at least one job at the repository's default GITHUB_TOKEN scope (manage-issues.yml → secrets.ADD_TO_PROJECT_PAT, manage-prs.yml → secrets.ADD_TO_PROJECT_PAT) — no top-level `permissions:` block, and at least one job declaring none of its own — so that job carries the default token on top of the credential it already holds. A compromised or repointed action in one of these jobs inherits both — the long-lived secret AND write access to code, releases and packages. Sibling workflows in this repository already declare `permissions:`, so the repository-wide check does not flag it. Give each of these its own least-privilege block — `permissions: {contents: read}` at the top, widened per job only where a job genuinely writes.

D4 · Code Duplication · Near-duplicate member pair (223 shared lines) · ×1

Near-duplicate member pair (223 shared lines) src/Client/MainComponents/Widgets.fs:1 — src/Client/MainComponents/Widgets.fs:1-308 | src/Components/src/Composite/Widgets/Widgets.fs:1-599 — These two members are variants of one another: 223 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.

D4 · Code Duplication · Near-duplicate member pair (73 shared lines) · ×1

Near-duplicate member pair (73 shared lines) src/Client/SharedComponents/JsBindings/DndKit.fs:1 — src/Client/SharedComponents/JsBindings/DndKit.fs:1-96 | src/Components/src/JsBindings/DndKit.fs:1-143 — These two members are variants of one another: 73 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.

D4 · Code Duplication · Near-duplicate member pair (61 shared lines) · ×1

Near-duplicate member pair (61 shared lines) src/Client/SharedComponents/Metadata/Generic.fs:1 — src/Client/SharedComponents/Metadata/Generic.fs:1-97 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:1-104 — These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.

D4 · Code Duplication · Edited copy of a member (46 corresponding lines) · ×1

Edited copy of a member (46 corresponding lines) src/Client/Spreadsheet/IO.fs:1 — src/Client/Spreadsheet/IO.fs:1-97 | src/Components/src/ARCtrl/Json.fs:1-298 — These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.

D4 · Code Duplication · Edited copy of a member (31 corresponding lines) · ×1

Edited copy of a member (31 corresponding lines) src/Client/Model.fs:1 — src/Client/Model.fs:1-309 | src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:1-380 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.

D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1

Members sharing a duplicated core (6 members, 50+ identical tokens) src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:1 — src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:1-608 | src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:1-123 | src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:1-342 | src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:1-261 | src/Components/src/Page/ProvenanceGrouping/EditorSurface.fs:1-206 | src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:1-1912 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.

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

Duplicated block (85 lines × 2) src/Client/MainComponents/Widgets.fs:49 — src/Client/MainComponents/Widgets.fs:49-133 | src/Components/src/Composite/Widgets/Widgets.fs:41-125 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

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

Duplicated block (70 lines × 2) src/Client/Pages/ProtocolTemplates/ProtocolView.fs:30 — src/Client/Pages/ProtocolTemplates/ProtocolView.fs:30-99 | src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs:42-111 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Pages/ProtocolTemplates/ProtocolView.fs:30` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (55 lines × 2) src/Client/MainComponents/Widgets.fs:142 — src/Client/MainComponents/Widgets.fs:142-196 | src/Components/src/Composite/Widgets/Widgets.fs:143-197 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/MainComponents/Widgets.fs:142` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Components/src/Composite/Widgets/Widgets.fs:198` calls `onFocus` and `src/Client/MainComponents/Widgets.fs:197` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (53–54 lines × 2) · ×1

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

D4 · Code Duplication · Duplicated block (44–48 lines × 2) · ×1

Duplicated block (44–48 lines × 2) src/Components/src/Page/Metadata/InvestigationMetadata.fs:27 — src/Components/src/Page/Metadata/InvestigationMetadata.fs:27-74 | src/Components/src/Page/Metadata/StudyMetadata.fs:27-70 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Page/Metadata/InvestigationMetadata.fs:27` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (36 lines × 2) src/Components/src/Page/Metadata/AssayMetadata.fs:28 — src/Components/src/Page/Metadata/AssayMetadata.fs:28-63 | src/Components/src/Page/Metadata/RunMetadata.fs:27-62 — before extracting anything, compare `src/Components/src/Page/Metadata/AssayMetadata.fs` and `src/Components/src/Page/Metadata/RunMetadata.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Page/Metadata/AssayMetadata.fs:28` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (33–34 lines × 2) src/Client/SharedComponents/JsBindings/DndKit.fs:47 — src/Client/SharedComponents/JsBindings/DndKit.fs:47-80 | src/Components/src/JsBindings/DndKit.fs:76-108 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (31–32 lines × 2) · ×1

Duplicated block (31–32 lines × 2) src/Client/SharedComponents/Widgets.fs:10 — src/Client/SharedComponents/Widgets.fs:10-41 | src/Components/src/Composite/Widgets/LocalStorage.fs:19-49 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (20–32 lines × 2) · ×1

Duplicated block (20–32 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:425 — src/Client/SharedComponents/Metadata/Forms.fs:425-456 | src/Components/src/Page/Metadata/FormComponents/InputSequence.fs:24-43 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Forms.fs` and `src/Components/src/Page/Metadata/FormComponents/InputSequence.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Forms.fs:425` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (32 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:740 — src/Client/SharedComponents/Metadata/Forms.fs:740-771 | src/Components/src/Page/Metadata/FormComponents/OntologyAnnotationInput.fs:26-57 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Forms.fs:740` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (29 lines × 2) src/Client/SharedComponents/Metadata/Generic.fs:23 — src/Client/SharedComponents/Metadata/Generic.fs:23-51 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:22-50 — before extracting anything, compare `src/Client/SharedComponents/Metadata/Generic.fs` and `src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Generic.fs:23` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (28 lines × 2) src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:71 — src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:71-98 | src/Components/src/Page/ProvenanceGrouping/ControlsSupport.fs:44-71 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (22–23 lines × 2) · ×1

Duplicated block (22–23 lines × 2) src/Client/MainComponents/Widgets.fs:217 — src/Client/MainComponents/Widgets.fs:217-238 | src/Components/src/Composite/Widgets/Widgets.fs:219-241 — before extracting anything, compare `src/Client/MainComponents/Widgets.fs` and `src/Components/src/Composite/Widgets/Widgets.fs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/MainComponents/Widgets.fs:217` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (18–21 lines × 4) · ×1

Duplicated block (18–21 lines × 4) src/Client/OfficeInterop/ARCtrlHelper.fs:71 — src/Client/OfficeInterop/ARCtrlHelper.fs:71-90 | src/Client/OfficeInterop/OfficeInterop.fs:54-74 | src/Client/OfficeInterop/OfficeInterop.fs:91-108 | src/Client/OfficeInterop/OfficeInterop.fs:170-190 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/OfficeInterop/ARCtrlHelper.fs:71` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (20 lines × 2) src/Client/States/IndexedDB.fs:115 — src/Client/States/IndexedDB.fs:115-134 | src/Client/States/IndexedDB.fs:155-174 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/States/IndexedDB.fs:115` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×1

Duplicated block (18–19 lines × 2) src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:36 — src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:36-53 | src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:60-78 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:60` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (18 lines × 5) · ×1

Duplicated block (18 lines × 5) src/Components/src/Page/Metadata/AssayMetadata.fs:22 — src/Components/src/Page/Metadata/AssayMetadata.fs:22-39 | src/Components/src/Page/Metadata/InvestigationMetadata.fs:21-38 | src/Components/src/Page/Metadata/RunMetadata.fs:21-38 | src/Components/src/Page/Metadata/StudyMetadata.fs:21-38 | src/Components/src/Page/Metadata/WorkflowMetadata.fs:21-38 — before extracting anything, compare `src/Components/src/Page/Metadata/AssayMetadata.fs` and `src/Components/src/Page/Metadata/RunMetadata.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Page/Metadata/AssayMetadata.fs:22` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (15–18 lines × 2) · ×1

Duplicated block (15–18 lines × 2) src/Client/SharedComponents/Metadata/Forms.fs:1077 — src/Client/SharedComponents/Metadata/Forms.fs:1077-1094 | src/Components/src/Page/Metadata/FormComponents/PersonsInput.fs:23-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/SharedComponents/Metadata/Forms.fs:1077` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (16–18 lines × 2) src/Server/Api/IOntologyAPI.fs:479 — src/Server/Api/IOntologyAPI.fs:479-494 | src/Server/Api/IOntologyAPI.fs:759-776 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Server/Api/IOntologyAPI.fs:479` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (15–17 lines × 2) · ×1

Duplicated block (15–17 lines × 2) src/Client/Pages/Settings/SettingsView.fs:18 — src/Client/Pages/Settings/SettingsView.fs:18-32 | src/Components/src/Page/SettingsPage/SettingsPage.fs:21-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (14–15 lines × 6) · ×1

Duplicated block (14–15 lines × 6) src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:1 — src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:1-15 | src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:1-14 | src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:1-14 | src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:1-15 | src/Components/src/Page/ProvenanceGrouping/EditorSurface.fs:1-14 | src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:1-15 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 6 call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (13–15 lines × 5) · ×1

Duplicated block (13–15 lines × 5) src/Client/OfficeInterop/ARCtrlHelper.fs:67 — src/Client/OfficeInterop/ARCtrlHelper.fs:67-81 | src/Client/OfficeInterop/OfficeInterop.fs:50-64 | src/Client/OfficeInterop/OfficeInterop.fs:87-101 | src/Client/OfficeInterop/OfficeInterop.fs:166-180 | src/Client/OfficeInterop/OfficeInterop.fs:207-219 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (14–15 lines × 2) src/Electron/src/Main/Git/GitService.fs:1184 — src/Electron/src/Main/Git/GitService.fs:1184-1198 | src/Electron/src/Main/Git/GitService.fs:1246-1259 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

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

Duplicated block (12–14 lines × 3) src/Components/src/Composite/AnnotationTable/Modals.fs:1185 — src/Components/src/Composite/AnnotationTable/Modals.fs:1185-1198 | src/Components/src/Composite/AnnotationTable/Modals.fs:1496-1507 | src/Components/src/Composite/AnnotationTable/Modals.fs:1635-1648 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/AnnotationTable/Modals.fs:1185` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (11–14 lines × 2) src/Client/MainComponents/EmptyTableModals.fs:137 — src/Client/MainComponents/EmptyTableModals.fs:137-147 | src/Components/src/Page/ArcFileEditor/EmptyTableView/Modals.fs:112-125 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/MainComponents/EmptyTableModals.fs:137` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (12–14 lines × 2) src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:23 — src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:23-34 | src/Components/src/Page/ProvenanceGrouping/PropertyModel.fs:9-22 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (12–13 lines × 2) src/Client/SharedComponents/Widgets.fs:52 — src/Client/SharedComponents/Widgets.fs:52-63 | src/Components/src/Composite/Widgets/LocalStorage.fs:53-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

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

Duplicated block (9–13 lines × 2) src/Components/src/Composite/Layout/Layout.fs:165 — src/Components/src/Composite/Layout/Layout.fs:165-173 | src/Components/src/Composite/Workspace/PaneNode.fs:97-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/Composite/Layout/Layout.fs:165` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Components/src/Composite/Layout/Layout.fs:161` calls `removeEventListener`, `addEventListener` and `src/Components/src/Composite/Workspace/PaneNode.fs:95` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (11–12 lines × 5) · ×1

Duplicated block (11–12 lines × 5) src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs:1 — src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs:1-12 | src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:1-12 | src/Components/src/Page/ProvenanceGrouping/ConnectorPaths.fs:1-11 | src/Components/src/Page/ProvenanceGrouping/ConnectorRendering.fs:1-12 | src/Components/src/Page/ProvenanceGrouping/ConnectorTypes.fs:1-12 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 5 call sites, so a change lands once.

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

Duplicated block (9–12 lines × 2) src/Client/OfficeInterop/ARCtrlHelper.fs:158 — src/Client/OfficeInterop/ARCtrlHelper.fs:158-166 | src/Client/OfficeInterop/ArcTableHelper.fs:73-84 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

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

Duplicated block (11–12 lines × 2) src/Electron/src/Main/IPC/IArcVaultsApi.fs:237 — src/Electron/src/Main/IPC/IArcVaultsApi.fs:237-248 | src/Electron/src/Main/IPC/IArcVaultsApi.fs:274-284 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Main/IPC/IArcVaultsApi.fs:237` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (9–10 lines × 2) src/Client/Update/UpdateUtil.fs:164 — src/Client/Update/UpdateUtil.fs:164-173 | src/Components/src/Composite/TemplateBrowser/Helper.fs:141-149 — before extracting anything, compare `src/Client/Update/UpdateUtil.fs` and `src/Components/src/Composite/TemplateBrowser/Helper.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Client/Update/UpdateUtil.fs:164` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

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

Duplicated block (7–9 lines × 2) src/Client/SharedComponents/JsBindings/DndKit.fs:82 — src/Client/SharedComponents/JsBindings/DndKit.fs:82-88 | src/Components/src/JsBindings/DndKit.fs:116-124 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/Components/src/JsBindings/DndKit.fs:116` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (8–9 lines × 2) src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs:64 — src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs:64-72 | src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs:75-82 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1

Duplicated block (8 lines × 3) src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:403 — src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:403-410 | src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:417-424 | src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:428-435 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

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

Duplicated block (7–8 lines × 2) src/Server/Database/Helper.fs:106 — src/Server/Database/Helper.fs:106-112 | src/Server/Database/Helper.fs:156-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (5–7 lines × 2) src/Client/MainComponents/EmptyTableElement.fs:23 — src/Client/MainComponents/EmptyTableElement.fs:23-27 | src/Client/MainComponents/EmptyTableModals.fs:34-40 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

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

Duplicated block (5–6 lines × 2) src/Electron/src/Renderer/Context/GitWorkflow.fs:841 — src/Electron/src/Renderer/Context/GitWorkflow.fs:841-845 | src/Electron/src/Renderer/Context/GitWorkflow.fs:981-986 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Electron/src/Renderer/Context/GitWorkflow.fs:981` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D8 · Code Coverage · Coverage not measured · ×1

Coverage not measured — .NET and JavaScript/TypeScript suite — Coverage NOT MEASURED: the .NET half could not be measured — the repository wires up no coverage collector for `--collect:"XPlat Code Coverage"` to use; the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. 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. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.

R10 · Code Duplication · Duplicated block (12 lines × 6 locations) · ×1

Duplicated block (12 lines × 6 locations) src/Components/playground/App.tsx:86 — src/Components/playground/App.tsx:86 · src/Components/playground/App.tsx:102 · src/Components/playground/App.tsx:116 · src/Components/playground/App.tsx:137 · +2 more site(s) not listed — all 6 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 × 5 locations) · ×1

Duplicated block (12 lines × 5 locations) src/Components/playground/App.tsx:108 — src/Components/playground/App.tsx:108 · src/Components/playground/App.tsx:122 · src/Components/playground/App.tsx:143 · src/Components/playground/App.tsx:180 · +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.

R3 · Large Files · Large Files · ×1

Large Files — 6 file(s) over 400 lines (counted as significant lines — blank lines excluded — over production source only, tests excluded), largest first: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.stories.tsx (2448), src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (798), src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx (782), src/Components/src/Page/FileExplorer/FileExplorer.stories.tsx (683), src/Components/src/Composite/AnnotationTable/AnnotationTable.stories.tsx (637), src/Components/src/Page/GitComparison/GitMergeConflictViewer.stories.tsx (575).

R6 · Tooling · No lint script · ×1

No lint script — test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.

R8 · Dependency Hygiene · Unused dependency '@fable-org/fable-library-js' · ×1

Unused dependency '@fable-org/fable-library-js' — 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 '@iconify-json/fluent' · ×1

Unused dependency '@iconify-json/fluent' — 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 '@iconify/tailwind4' · ×1

Unused dependency '@iconify/tailwind4' — 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.

S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1

Third-party script without Subresource Integrity src/Server/public/test.html:4 — `https://cdnjs.cloudflare.com/ajax/libs/cytoscape/3.18.0/cytoscape.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session.

Minor — 16 finding(s)

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

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 42 significant file(s) lose their only recent owner: src/Server/Api/IOntologyAPI.fs, src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs, src/Components/src/Composite/Workspace/WorkspaceModel.fs, src/Components/src/Composite/Workspace/Workspace.stories.tsx, src/Components/src/Composite/Workspace/DropOverlay.fs, src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs, src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs, src/Client/Util/MessageInterop.fs (+34 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 41 significant file(s) lose their only recent owner: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.stories.tsx, src/Components/src/Page/GitSidebar/GitSidebar.fs, src/Components/src/Page/ProvenanceGrouping/Controls.fs, src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs, src/Components/src/Page/ProvenanceGrouping/GroupCard.fs, src/Shared/ProvenanceGrouping/ARCtrlConverter.fs, src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs, src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (+33 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 20 significant file(s) lose their only recent owner: src/Electron/src/Main/IPC/FileSystemIO.fs, src/Shared/PathHelpers.fs, src/Components/src/Page/FileExplorer/FileExplorerItem.fs, src/Shared/ARCtrl.Helper.fs, src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs, src/Electron/src/Main/IPC/Rename.fs, src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTreeContextMenu.fs, src/Components/src/ARCtrl/Extensions/CompositeCell.fs (+12 more). Pair on, review, or document these before any departure.

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

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

D20 · ADR Quality · No ADRs found · ×1

No ADRs found — 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/`.

D27 · Navigability · Scattered collaborators · ×1

Scattered collaborators — 96 % of calls cross a namespace and only 54 % of collaborators are co-located — group each feature's code into a vertical slice so a call's collaborators sit together.

D28 · Secrets (history) · Rotate the exposed credentials · ×1

Rotate the exposed credentials — git history can't be un-committed — Some of these secrets are in git HISTORY: deleting the file does not remove them (the commit persists on every clone, fork and backup). The remediation is to ROTATE each historically-exposed credential and treat it as compromised — not to delete the file. Rewriting history is disruptive and unreliable across existing forks. (Working-tree-only secrets — no commit — can instead be removed from the file and moved to a secret store.) If flagged rows sit in content that is not this repository's own authored code — tool-emitted artifacts, recorded scanner output, wholesale-vendored third-party files — declare that provenance in .gitattributes (`path/** linguist-generated` or `linguist-vendored`): this scanner honors the repository's own declarations and stops counting such content, history-anchored rows included, on the next scan. The declaration is a reviewable statement about provenance, not a suppression — never use it on files that carry your own credentials.

D30 · Dependency Vulnerabilities · Low CVE · ×1

Low CVE: [GHSA redacted] package-lock.json — elliptic 6.6.1: [GHSA redacted] — no fixed version has been published yet. Track the advisory; elliptic is not declared in this repo's manifests: it is pulled in transitively by browserify-sign 4.2.6 and create-ecdh 4.0.4, which reaches this repo only through vite-plugin-node-polyfills 0.25.0, the devDependency your own manifest declares at `^0.25.0` (the entry you can move), so the action is on the dependency that requires it — upgrade or replace that dependent.

D30 · Dependency Vulnerabilities · Low vulnerability · ×1

Low vulnerability: [GHSA redacted] package-lock.json — esbuild 0.27.7: [GHSA redacted] — esbuild is not declared in this repo's manifests: it is pulled in transitively by storybook 10.4.2 and vite 7.3.5, which your own manifest declares, so upgrade the dependency that requires it (or pin esbuild to 0.28.1 with an `overrides` entry).

D31 · IaC & Container Security · Low IaC · ×1

Low IaC: DS-0026 build/Dockerfile.publish — No HEALTHCHECK defined. Add HEALTHCHECK instruction in your Dockerfile. Add HEALTHCHECK instruction in Dockerfile. Without one the runtime only knows whether the process is alive, not whether it is serving, so a wedged container is restarted by nobody. The step: add a `HEALTHCHECK` to the image that probes the service the way a client would — this image already declares `EXPOSE 5000`, so a request to `localhost:5000` on the service's own health or root route, exiting non-zero when it does not answer, is the probe — and give it an `--interval`, a `--timeout` and a `--start-period` long enough to cover startup. If the image ships no HTTP client, probe with whatever the runtime already has, or declare the check in the orchestrator instead and say so here.

D36 · Supply-chain Provenance & Signing · No SBOM · ×1

No SBOM — No SBOM generation or committed SBOM found — produce one with what your ecosystem ships (`sbom-tool generate` (install it with `dotnet tool install --global Microsoft.Sbom.DotNetTool`) or `dotnet CycloneDX` over the solution, `npm sbom --sbom-format cyclonedx` (npm 9+) or `@cyclonedx/cyclonedx-npm` over the lockfile, `syft` (or `anchore/sbom-action` in CI) over the source tree or released image). Publish it as a release asset (`*.spdx.json` / `*.cdx.json`) so consumers can see what they are installing. What was searched, so you can tell an absence from a miss: this repository's CI files, the scripts they invoke and its own composite actions, any SBOM committed to the repository, the SBOM configuration declared in its build and release manifests, and the container-build SBOM inputs. An SBOM produced by a pipeline whose configuration is not in this repository, or by a generator whose name is none of the ones this check carries, is not seen here.

D36 · Supply-chain Provenance & Signing · No dependency advisory monitoring · ×1

No dependency advisory monitoring — Nothing in this repository re-checks its pinned dependencies when an advisory is published: no Dependabot or Renovate configuration (`.github/dependabot.yml`, `renovate.json`), no advisory scanner invoked from CI and no committed scanner configuration (`deny.toml`, `.cargo/audit.toml`, `osv-scanner.toml`, `.snyk`). The manifests present — `npm` (package.json), `nuget` (*.csproj) — pin versions that advisories are published against on the advisory database's clock, not this repository's, so every advisory that lands against a pinned version stays unseen until someone points a scanner at the tree (any already published are reported under D30, one row per package — this row names the control whose absence lets them accumulate). GitHub's Dependabot alerts, if switched on in the repository settings, notify but leave nothing in the tree; a committed configuration is what makes the control reviewable and carries it to a fork or mirror. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per manifest listed (or a `renovate.json`) so each advisory arrives as a pull request against the affected lockfile; or wire the ecosystem's own advisory scanner into CI on a `schedule:` trigger — npm: `npm audit` / `pnpm audit` / `yarn npm audit`; nuget: `dotnet list package --vulnerable` failing on output, or promote the SDK's audit warnings to errors (`<WarningsAsErrors>NU1901;NU1902;NU1903;NU1904</WarningsAsErrors>`).

M2 · Architecture documentation · No ADRs · ×1

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

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

No SAST — No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 11061 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

P4 · Deployment & Rollback · No rollback/health safety · ×1

No rollback/health safety — Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.

R8 · Dependency Hygiene · Test-only dependency '@dnd-kit/core' in production deps · ×1

Test-only dependency '@dnd-kit/core' in production deps src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx:3 — Only test files import it — move it to devDependencies.

Appendix B — Reproduction & audit trail

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

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-086eec66277d41b4989a123e96937154/history.json --exit-code 0 --source .	7	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-086eec66277d41b4989a123e96937154/tree.json --exit-code 0 --source .	2	artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)	semgrep	—	semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .	25	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	dotnet	—	dotnet list Swate.sln package --vulnerable --include-transitive --format json	32	artifacts/raw/dotnet-vulnerable.json
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	11	artifacts/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 37 file(s) — `src/Components/src/Composite/Actionbar/Actionbar.stories.tsx`, `src/Components/src/Composite/AnnotationTable/AnnotationTable.stories.tsx`, `src/Components/src/Composite/AnnotationTable/ResetTableConfirmationModal.stories.tsx`, `src/Components/src/Composite/ArcSelector/ArcSelector.stories.tsx`, `src/Components/src/Composite/ArcVaultActions/ArcVaultActions.stories.tsx`, … (+32 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 Policy	disclosure	—	disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.	0	—
D40 · Network Egress Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.	0	—
D41 · Kernel & Syscall Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.	0	—
D42 · Runtime Threat Enforcement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.	0	—
D43 · Malicious Dependencies	dotnet	—	dotnet list Swate.sln package --vulnerable --include-transitive --format json	0	artifacts/raw/dotnet-vulnerable.json

Run 01a0b370-6806-7474-9bda-74a7b2c04f36 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Nfdi4plants/Swate

Findings by grade

This survey was produced by

Executive summary

Top priorities

Diagnosis — what's actually going on

Architecture — module dependency matrix

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

At a glance — Architecture · 94% · Exemplary ·

At a glance — Maturity · 73% · Strong ·

At a glance — Readiness · 38% · Weak · gated by D13, R4, P3 ·

At a glance — Security · 70% · Adequate · gated by D30 ·

At a glance — Domain Modelling · 100% · Exemplary ·

At a glance — Accessibility · 40% · Weak · gated by AC2 ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

The LLM boundary

Dimensions

Frontend & cross-cutting dimensions

WCAG coverage — what static analysis assessed

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts