Public report — Swate, published 3 Oct 2026. Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches, dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase survey Measured under the Code Assurance Index · rubric rubric-2026.10.1 (frozen) · verify this survey Filed cd_3b5534b7bf7c46809d0d478a2a5c4408 Filed 3 October 2026, 05:46 UTC Public

Nfdi4plants/Swate

Measured 3 October 2026, 05:36 UTC

50% Adequate
CriticalWeakAdequateStrongExemplary

Medium · 90,679 LoC · 16 projects · rebuild ~0.8 person-years · weakest lens: Readiness (40%)

Findings by grade

128 critical 442 serious 20 minor 39 could not be resolved — could be critical — see Limitations

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
3 October 2026, 05:36 UTC

A measurement, not a certificate. The Code Assurance Index does not certify, approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said here so the number is checked rather than believed.

Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸

53/57dimensions tool-verifieddeterministic · confidence 1.0 · 4 LLM-assisted, advisory
560findings with an exact file:lineof 590 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
57/132dimensions across the health lenses90679 LoC · 16 projects — wide & deep
Chapters

Executive summary

The system holds an adequate standing with an overall score of 50%, but it carries significant operational risk that threatens delivery speed and reliability. While the architecture is sound, the foundation is weakened by poor production readiness, creating a fragile environment where changes are costly and error-prone. This is a medium-sized asset with substantial value tied up in its logic, requiring approximately 0.8 person-years to rebuild. The cost to reconstruct the core functionality is estimated at €120,000, representing a considerable investment that is currently exposed to unnecessary risk due to gaps in testing and security controls.

The most critical issue is trust boundaries in operations. With a readiness score of only 40%, the system lacks the safety nets required for stable deployment. This weakness means that every release carries a higher probability of outage or defect, directly impacting customer trust and increasing support costs. The absence of comprehensive testing and observability creates a blind spot where issues can slip into production, leading to reactive firefighting rather than proactive management. This risk is amplified by the system's size, making any failure more impactful and harder to diagnose quickly.

A second theme is the velocity tax on development. Code quality signals indicate a moderate level of complexity and duplication, which acts as a hidden tax on every change. Modifications in weaker areas likely cost 4–9% more effort than in clean code, slowing down feature delivery and increasing long-term maintenance costs. This drag compounds as the codebase grows, making it increasingly difficult for the team to respond to market demands efficiently. The lack of measured coverage in key areas further obscures the true cost of change, leaving the team vulnerable to unexpected regressions.

Despite these risks, the system benefits from a solid architectural foundation and a reasonable level of code health, which provides a stable base for improvement. The most impactful action is to add static analysis and secret scanning to the CI pipeline. This step is low-cost, pays for itself within months by preventing security regressions, and provides immediate protection against critical vulnerabilities. Focusing on this high-leverage move will stabilize the release process and reduce the risk of costly security incidents, allowing the team to build confidence in the system's reliability.

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 40% · 46% weightAccessibility 44% · 25% weightSecurity 70% · 14% weightMaturity 72% · 8% weightCode Health 75% · 4% weightArchitecture 84% · 2% weight

Raise Readiness 40 → 70 (the Healthy floor) ⇒ headline 50 → ~58.

Code composition — where the lines go
Tests 100%
New since the last scan (100+)

119 finding(s) are new versus the previous scan (2026-09-18) — surfaced by this scheduled scan itself, no pull request required. Showing the first 100; the full set is in the report.

  • D1 · GitWorkflow.updateCore (cyclomatic 210) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D1 · IVersionControlApi.api (cyclomatic 43) src/Electron/src/Main/IPC/IVersionControlApi.fs
  • D1 · ArcVaultExtensions.ArcVault._FileEventController (cyclomatic 31) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D1 · GitWorkflow.runPublishAsync (cyclomatic 27) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D1 · GitWorkflow.confirmMergeResolutionAsync (cyclomatic 27) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D1 · ArcVaults.OnCloseWindow (cyclomatic 23) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D1 · ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible (cyclomatic 19) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D1 · ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cyclomatic 19) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D1 · GitWorkflow.routeFailure (cyclomatic 18) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D1 · GitDiffPageLoader.load (cyclomatic 17) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D2 · GitWorkflow.updateCore (cognitive 131) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D2 · ArcVaultExtensions.ArcVault._FileEventController (cognitive 74) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D2 · IVersionControlApi.api (cognitive 53) src/Electron/src/Main/IPC/IVersionControlApi.fs
  • D2 · GitWorkflow.confirmMergeResolutionAsync (cognitive 39) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D2 · ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible (cognitive 34) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D2 · GitWorkflow.runPrimarySaveAttemptAsync (cognitive 31) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D2 · GitWorkflow.runPublishAsync (cognitive 23) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D2 · GitSidebar.ChangedFilesList (cognitive 19) src/Components/src/Page/GitSidebar/GitSidebar.fs
  • D2 · GitDiffPageLoader.load (cognitive 18) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D2 · ArcVaultExtensions.ArcVault.ApplyWatcherFileTreeEvents (cognitive 17) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D2 · ArcVaults.DisposeVault (cognitive 17) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D3 · FileTooLong: IPC/IVersionControlApi.fs src/Electron/src/Main/IPC/IVersionControlApi.fs
  • D3 · TooManyFunctions: Mappings src/Electron/src/Main/VersionControl/Mappings.fs
  • D3 · TooManyFunctions: VersionControlApiClient src/Electron/src/Renderer/VersionControlApiClient.fs
  • D3 · FileTooLong: FileExplorer/FileTree.fs src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs
  • D4 · Near-duplicate member pair (46 shared lines) src/Client/SharedComponents/JsBindings/DndKit.fs
  • D4 · Duplicated block (14–19 lines × 2) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D4 · Duplicated block (12 lines × 2) src/Electron/src/Main/ArcVault/ArcVault.fs
  • D4 · Duplicated block (7 lines × 2) src/Electron/src/Main/IPC/IVersionControlApi.fs
  • D4 · Duplicated block (6 lines × 2) src/Electron/src/Main/IPC/IVersionControlApi.fs
  • D4 · Duplicated block (6 lines × 2) src/Electron/src/Renderer/Context/GitWorkflow.fs
  • D15 · Hotspot: src/Electron/src/Main/ArcVault/ArcVault.fs src/Electron/src/Main/ArcVault/ArcVault.fs
  • D15 · Hotspot: src/Electron/src/Main/IPC/IVersionControlApi.fs src/Electron/src/Main/IPC/IVersionControlApi.fs
  • D15 · Hotspot: src/Components/src/Page/FileExplorer/FileExplorerItem.fs src/Components/src/Page/FileExplorer/FileExplorerItem.fs
  • D15 · Repeated repair: src/Components/src/ClipboardContract/Contract.fs src/Components/src/ClipboardContract/Contract.fs
  • D15 · Repeated repair: build/Actions/Release.fs build/Actions/Release.fs
  • D30 · REDACTED
  • D30 · REDACTED
  • D30 · REDACTED
  • D30 · REDACTED
  • D30 · REDACTED
  • D30 · REDACTED
  • D30 · REDACTED
  • D30 · REDACTED
  • AX8 · Production project references a test project: Client.Tests → Shared.Tests
  • AC1 · <img> without a text alternative src/Client/Pages/Info/InfoView.fs
  • AC1 · <img> without a text alternative src/Client/SharedComponents/Logo.fs
  • AC2 · <input> without a programmatic label src/Client/Index.fs
  • AC2 · <select> without a programmatic label src/Client/MainComponents/EmptyTableModals.fs
  • AC2 · <input> without a programmatic label src/Client/MainComponents/FooterTabs.fs
  • AC2 · <input> without a programmatic label src/Client/MainComponents/NoFileElement.fs
  • AC2 · <input> without a programmatic label src/Client/MainComponents/TableFooter.fs
  • AC2 · <input> without a programmatic label src/Client/Modals/SelectiveImportModal.fs
  • AC2 · <label> that labels no control src/Client/Modals/SelectiveImportModal.fs
  • AC2 · <fieldset> without a <legend> src/Client/Modals/SelectiveImportModal.fs
  • AC2 · <input> without a programmatic label src/Client/Modals/SelectiveImportModal.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/BuildingBlock/Dropdown.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/BuildingBlock/SearchComponent.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/BuildingBlock/SearchComponent.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/FilePicker/FilePickerView.fs
  • AC2 · <select> without a programmatic label src/Client/Pages/JsonExporter/JsonExporter.fs
  • AC2 · <select> without a programmatic label src/Client/Pages/JsonImport/JsonImport.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/JsonImport/JsonImport.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/ProtocolTemplates/ProtocolView.fs
  • AC2 · <button> with no accessible text src/Client/Pages/ProtocolTemplates/ProtocolView.fs
  • AC2 · <label> that labels no control src/Client/Pages/Settings/SettingsView.fs
  • AC2 · <input> without a programmatic label src/Client/Pages/Settings/SettingsView.fs
  • AC2 · <label> that labels no control src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <select> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <label> that labels no control src/Client/SharedComponents/Metadata/Forms.fs
  • AC2 · <input> without a programmatic label src/Client/SharedComponents/Metadata/Generic.fs
  • AC2 · <label> that labels no control src/Client/SharedComponents/NavbarBurger.fs
  • AC2 · <button> with no accessible text src/Components/src/Composite/Actionbar/Actionbar.fs
  • AC2 · <label> that labels no control src/Components/src/Composite/AnnotationTable/Modals.fs
  • AC2 · <input> without a programmatic label src/Components/src/Composite/AnnotationTable/Modals.fs
  • AC2 · <label> that labels no control src/Components/src/Composite/AnnotationTable/Modals.fs
  • AC2 · <label> that labels no control src/Components/src/Composite/AnnotationTable/Modals.fs
  • AC2 · <input> without a programmatic label src/Components/src/Composite/AnnotationTable/Modals.fs
  • AC2 · <select> without a programmatic label src/Components/src/Composite/AnnotationTable/Modals.fs
  • AC3 · Data table has no header cells src/Client/Pages/FilePicker/FilePickerView.fs
  • AC3 · Data table has no header cells src/Components/src/Composite/SortableList/SortableList.fs
  • AC3 · Empty <h3> heading src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs
  • AC3 · Data table has no header cells src/Components/src/Primitive/BaseModal/BaseModal.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs
  • AC4 · Anchor without href src/Client/MainComponents/NoFileElement.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/Modals/InteropLoggingModal.fs
  • AC4 · Link used as a button (placeholder href) src/Client/Pages/BuildingBlock/Dropdown.fs
  • AC4 · Anchor without href src/Client/Pages/BuildingBlock/Dropdown.fs
  • AC4 · Anchor without href src/Client/Pages/BuildingBlock/Dropdown.fs
  • AC4 · Click handler on a non-interactive <div> src/Client/SharedComponents/Logo.fs
  • AC4 · Anchor without href src/Client/SharedComponents/NavbarBurger.fs
  • AC4 · Click handler on a non-interactive <li> src/Client/Views/MainPageViews.fs

A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.

Rebuild cost & value ~ Modeled — €38,000–€190,000
Cost to rebuild€38,000–€190,000 (0.4–1.2 person-years (638–2,024 h), ~1–2 engineers)
Domain complexityStandard — harder problems cost more per line
Quality factor0.7× (at 50% quality) — the last 20% of quality is most of the work
Size & shapeMedium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

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

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × 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.

1
Resolve the 2 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED, REDACTED.
+9.2 pts · Low effort · REDACTED Scanning
2
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.5 pts · Medium effort · Security & performance tooling
3
Add tests that import the unreached modules (directly or through their public entry).
+9.5 pts · Medium effort · Test Coverage

Diagnosis — what's actually going on

Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.8 person-years to rebuild), and its weakest lens is Readiness at 40%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
Evidence: valuation: Medium, ~0.8 person-years rebuild (90,679 LoC) · weakest lens: Readiness 40%
→ 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 35.6–213.6 engineer-days every year, paid as drag on the ~362,490 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: 89,381 line(s) changed over a 90-day window ⇒ ~362,490/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 — bounded-context dependency graph

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

arch Build Build Client Client Swate.Components Components Client->Swate.Components Swate.Components.Core Core Client->Swate.Components.Core Main Main Main->Swate.Components Swate.Electron.Shared Shared Main->Swate.Electron.Shared Preload Preload Preload->Swate.Electron.Shared Renderer Renderer Renderer->Swate.Components Renderer->Swate.Electron.Shared Server Server Server->Swate.Components.Core Swate.Components->Swate.Components.Core Swate.Electron Electron Swate.Electron->Main Swate.Electron->Preload Swate.Electron->Renderer Swate.Electron.Shared->Swate.Components

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

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

Showing the 40 most-connected modules; 806 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 ARCtrl2 InteropLogging3 Main.ArcMerge4 Routing5 Swate.Components6 Swate.Components.Api.GitLabApi7 Swate.Components.Composite.Authentication.Types8 Swate.Components.Composite.MarkdownText.JsBindings9 Swate.Components.Composite.Notes.Types10 Swate.Components.Composite.Table.Types11 Swate.Components.Composite.TermSearch.Types12 Swate.Components.Composite.Widgets.Types13 Swate.Components.Page.FileExplorer.Types14 Swate.Components.Shared15 Swate.Components.Shared.ARCtrlHelper16 Swate.Components.Shared.Database17 Swate.Components.Shared.ProvenanceGrouping.Types18 Swate.Electron.Shared.DTOs.ProvenanceGroupingDto19 Swate.Electron.Shared.IPCTypes20 Swate.Electron.Shared.VersionControlTypes21 Types.FileImport22 Swate.Components.Composite.AnnotationTable23 Swate.Components.Composite.MarkdownText.Plugins24 Swate.Components.Page.ArcFileEditor.Types25 Swate.Components.Page.Landing26 Swate.Components.Shared.ProvenanceGrouping.ARCtrlConverter27 Swate.Components.Shared.ProvenanceGrouping.Edit28 Swate.Components.Shared.ProvenanceGrouping.Grouping29 Swate.Electron.Shared.FileIOTypes30 Main.ArcVault31 Renderer.Components.LeftSidebar.FileExplorer.Types32 Renderer.Types33 Spreadsheet34 Swate.Components.Shared.ProvenanceGrouping.Session35 Model36 Renderer.Context.GitWorkflow37 Swate.Components.Page.ProvenanceGrouping.Types38 MessagesModule39 Swate.Components.Page.ProvenanceGrouping40 Swate.Components.Page.ProvenanceGrouping.DragHandlers
1 ARCtrl
2 InteropLogging
3 Main.ArcMerge
4 Routing
5 Swate.Components
6 Swate.Components.Api.GitLabApi
7 Swate.Components.Composite.Authentication.Types
8 Swate.Components.Composite.MarkdownText.JsBindings
9 Swate.Components.Composite.Notes.Types
10 Swate.Components.Composite.Table.Types
11 Swate.Components.Composite.TermSearch.Types
12 Swate.Components.Composite.Widgets.Types
13 Swate.Components.Page.FileExplorer.Types
14 Swate.Components.Shared
15 Swate.Components.Shared.ARCtrlHelper
16 Swate.Components.Shared.Database
17 Swate.Components.Shared.ProvenanceGrouping.Types
18 Swate.Electron.Shared.DTOs.ProvenanceGroupingDto
19 Swate.Electron.Shared.IPCTypes
20 Swate.Electron.Shared.VersionControlTypes
21 Types.FileImport
22 Swate.Components.Composite.AnnotationTable351
23 Swate.Components.Composite.MarkdownText.Plugins1
24 Swate.Components.Page.ArcFileEditor.Types12
25 Swate.Components.Page.Landing1
26 Swate.Components.Shared.ProvenanceGrouping.ARCtrlConverter10
27 Swate.Components.Shared.ProvenanceGrouping.Edit22
28 Swate.Components.Shared.ProvenanceGrouping.Grouping13
29 Swate.Electron.Shared.FileIOTypes2
30 Main.ArcVault1
31 Renderer.Components.LeftSidebar.FileExplorer.Types221
32 Renderer.Types121
33 Spreadsheet1312
34 Swate.Components.Shared.ProvenanceGrouping.Session22
35 Model121
36 Renderer.Context.GitWorkflow1354
37 Swate.Components.Page.ProvenanceGrouping.Types14411
38 MessagesModule111
39 Swate.Components.Page.ProvenanceGrouping16657
40 Swate.Components.Page.ProvenanceGrouping.DragHandlers21111
Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself
ARCtrlInteropLoggingMain.ArcMergeRoutingSwate.Components…ponents.Api.GitLabApi….Authentication.Types…rkdownText.JsBindings…Composite.Notes.Types…Composite.Table.Types…site.TermSearch.Types…mposite.Widgets.Types…ge.FileExplorer.Types…ate.Components.Shared…s.Shared.ARCtrlHelper…nents.Shared.Database…venanceGrouping.Types…ProvenanceGroupingDto…ctron.Shared.IPCTypes…d.VersionControlTypesTypes.FileImport…osite.AnnotationTable….MarkdownText.Plugins…e.ArcFileEditor.Types…mponents.Page.Landing…uping.ARCtrlConverter…ovenanceGrouping.Edit…anceGrouping.Grouping…on.Shared.FileIOTypesMain.ArcVault…ar.FileExplorer.TypesRenderer.TypesSpreadsheet…nanceGrouping.SessionModel…r.Context.GitWorkflow…venanceGrouping.TypesMessagesModule…ge.ProvenanceGrouping…Grouping.DragHandlersARCtrl1InteropLogging2Main.ArcMerge3Routing4Swate.Components5…ponents.Api.GitLabApi6….Authentication.Types7…rkdownText.JsBindings8…Composite.Notes.Types9…Composite.Table.Types10…site.TermSearch.Types11…mposite.Widgets.Types12…ge.FileExplorer.Types13…ate.Components.Shared14…s.Shared.ARCtrlHelper15…nents.Shared.Database16…venanceGrouping.Types17…ProvenanceGroupingDto18…ctron.Shared.IPCTypes19…d.VersionControlTypes20Types.FileImport21…osite.AnnotationTable22….MarkdownText.Plugins23…e.ArcFileEditor.Types24…mponents.Page.Landing25…uping.ARCtrlConverter26…ovenanceGrouping.Edit27…anceGrouping.Grouping28…on.Shared.FileIOTypes29Main.ArcVault30…ar.FileExplorer.Types31Renderer.Types32Spreadsheet33…nanceGrouping.Session34Model35…r.Context.GitWorkflow36…venanceGrouping.Types37MessagesModule38…ge.ProvenanceGrouping39…Grouping.DragHandlers403511121102213212211211312221211354144111111665721111+806 more modules (most-connected shown)

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

At a glance — Architecture · 84% · Adequate · gated by D26 ·

At a glance — Maturity · 72% · Strong ·

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

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

At a glance — Accessibility · 44% · Weak · gated by AC4 ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A06:2021 — Vulnerable & Outdated Components35High / Critical
A03:2021 — Injection25High / Critical
A05:2021 — Security Misconfiguration11High / Critical
A02:2021 — Cryptographic Failures8High / Critical

Roadmap

First, integrate static analysis and secret scanning into the CI pipeline to prevent security regressions and resolve existing leaked credentials. Next, improve code reliability by adding tests for unreached modules and cleaning up unused or misclassified dependencies. Finally, enhance deployment stability by adding health checks to the compose services and ensuring immutable image tags for reliable rollbacks.

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

Do thisHelpsEffortDimension
Resolve the 2 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED, REDACTED.+9.2 ptsLowREDACTED 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.5 ptsMediumSecurity & performance tooling
Add tests that import the unreached modules (directly or through their public entry).+9.5 ptsMediumTest Coverage
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.+9.5 ptsMediumDependency 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.2 ptsMediumDeployment & Rollback
Add eslint as package.json scripts and run them in CI.+8.6 ptsMediumTooling
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.+7.9 ptsMediumText alternatives
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+7.9 ptsMediumKeyboard semantics

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.7SlopIaC & Container Security: High IaC: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.3MixedSecrets (history): REDACTED: REDACTED
src/Electron/src/Main/IPC/IArcVaultsApi.fs4.8MixedCyclomatic Complexity: ArcVaultsApi.api (cyclomatic 146)
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED6.3MixedIaC & Container Security: Medium IaC: REDACTED
src/Electron/src/Renderer/Context/GitWorkflow.fs7.0MixedCyclomatic Complexity: GitWorkflow.updateCore (cyclomatic 210)
src/Components/src/Page/ProvenanceGrouping/Controls.fs7.0MixedCyclomatic Complexity: Controls.PropertyRailItem (cyclomatic 60)
src/Electron/src/Main/ArcVault/ArcVault.fs7.0MixedCyclomatic Complexity: ArcVaultExtensions.ArcVault._FileEventController (cyclomatic 31)
src/Server/Api/IOntologyAPI.fs7.0MixedCyclomatic Complexity: V2.ontologyApi (cyclomatic 25)
src/Client/OfficeInterop/OfficeInterop.fs7.0MixedCyclomatic Complexity: Main.tryParseToArcFile (cyclomatic 23)
src/Client/SharedComponents/Metadata/Forms.fs7.0MixedCyclomatic Complexity: FormComponents.TextInput (cyclomatic 22)
src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs7.0MixedCyclomatic Complexity: DataHubBrowser.ExplorePanel (cyclomatic 34)
src/Components/src/Composite/AnnotationTable/ContextMenu.fs7.0MixedCyclomatic Complexity: AnnotationTableContextMenuUtil.getFittedCells (cyclomatic 21)
src/Components/src/Composite/AnnotationTable/Modals.fs7.0MixedCognitive Complexity: ContextMenuModals.MoveColumnModal (cognitive 22)
src/Client/MainComponents/Widgets.fs7.0MixedCode Duplication: Near-duplicate member pair (223 shared lines)
src/Components/src/Composite/TermSearch/TermSearch.fs7.0MixedCyclomatic Complexity: TermSearch.TermSearch (cyclomatic 55)
src/Components/src/Page/GitSidebar/GitSidebar.fs7.1MixedCyclomatic Complexity: GitSidebar.Main (cyclomatic 37)

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

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

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

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

Could not be resolved — 39

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. 53 of 57 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

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

What we checked — 57 dimensions across the health lenses
D1D2D3D4D5D9D10D13D14D15D16D19D20D21D26D27D28D29D30D31D34D35D36D43D44AC1AC2AC3AC4AC5AC6AC7AX10AX3AX4AX8M1M2M3M4P1P10P3P4P6R1R10R2R3R4R5R6R7R8R9S1X28

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

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

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

Tools & methods

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

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurementLocal LLM◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a10043-c09c-72f3-8604-4178734b86c8.

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.

  • D6 Cohesion (LCOM4) — 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's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • 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 71 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, .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.
  • D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs, src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs, src/Electron/src/Main/IPC/IVersionControlApi.fs, src/Electron/src/Renderer/Context/GitWorkflow.fs, src/Components/src/Page/GitSidebar/GitSidebar.fs, … that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (src/Components/package.json), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • 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`, … (+34 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.
  • AC1 Text alternatives — 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 renders user interface from a TEMPLATE LANGUAGE or a host-language HTML BUILDER — 10 Feliz (F#) template file(s) carrying 27 markup element(s) (e.g. tests/Electron.Renderer/FileTreeRenameWorkflow.test.fs, src/Components/src/Util/Extensions.fs, src/Components/src/Page/ProvenanceGrouping/EditorActions.fs) — and the accessibility cards on this run were measured over the 190 parsed markup document(s) ONLY. The markup model reads .html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx, html`…` templates and DOM-assigned HTML strings in .ts/.js, the .erb/.ejs/.eex/.heex/.leex/.twig/.jinja/.j2/.liquid/.njk/.hbs/.mustache/.blade.php/.gohtml template languages, .astro/.templ/.pug/.jade/.haml/.slim, and the kotlinx.html/Compose HTML/kotlin-react, Giraffe/Falco/Fable.React/Feliz/Bolero and Jaspr builder DSLs; 10 of the file(s) above import an HTML builder DSL whose element calls it did not project — a builder it has no reader for, or calls in a shape its reader does not know — so those views were not merely unparsed but unenumerated: not one of their elements entered the population any card scored. Their absence from the counts above is a gap in this analyzer's frontend coverage — not a finding that they carry text alternatives, labels, keyboard semantics or correct ARIA.
  • AC2 Forms & labels — 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 renders user interface from a TEMPLATE LANGUAGE or a host-language HTML BUILDER — 10 Feliz (F#) template file(s) carrying 27 markup element(s) (e.g. tests/Electron.Renderer/FileTreeRenameWorkflow.test.fs, src/Components/src/Util/Extensions.fs, src/Components/src/Page/ProvenanceGrouping/EditorActions.fs) — and the accessibility cards on this run were measured over the 190 parsed markup document(s) ONLY. The markup model reads .html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx, html`…` templates and DOM-assigned HTML strings in .ts/.js, the .erb/.ejs/.eex/.heex/.leex/.twig/.jinja/.j2/.liquid/.njk/.hbs/.mustache/.blade.php/.gohtml template languages, .astro/.templ/.pug/.jade/.haml/.slim, and the kotlinx.html/Compose HTML/kotlin-react, Giraffe/Falco/Fable.React/Feliz/Bolero and Jaspr builder DSLs; 10 of the file(s) above import an HTML builder DSL whose element calls it did not project — a builder it has no reader for, or calls in a shape its reader does not know — so those views were not merely unparsed but unenumerated: not one of their elements entered the population any card scored. Their absence from the counts above is a gap in this analyzer's frontend coverage — not a finding that they carry text alternatives, labels, keyboard semantics or correct ARIA.
  • AC2 Forms & labels — 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. 71 further occurrence(s) are not listed individually; the score already reflects all 111.
  • AC3 Page structure — 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 renders user interface from a TEMPLATE LANGUAGE or a host-language HTML BUILDER — 10 Feliz (F#) template file(s) carrying 27 markup element(s) (e.g. tests/Electron.Renderer/FileTreeRenameWorkflow.test.fs, src/Components/src/Util/Extensions.fs, src/Components/src/Page/ProvenanceGrouping/EditorActions.fs) — and the accessibility cards on this run were measured over the 190 parsed markup document(s) ONLY. The markup model reads .html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx, html`…` templates and DOM-assigned HTML strings in .ts/.js, the .erb/.ejs/.eex/.heex/.leex/.twig/.jinja/.j2/.liquid/.njk/.hbs/.mustache/.blade.php/.gohtml template languages, .astro/.templ/.pug/.jade/.haml/.slim, and the kotlinx.html/Compose HTML/kotlin-react, Giraffe/Falco/Fable.React/Feliz/Bolero and Jaspr builder DSLs; 10 of the file(s) above import an HTML builder DSL whose element calls it did not project — a builder it has no reader for, or calls in a shape its reader does not know — so those views were not merely unparsed but unenumerated: not one of their elements entered the population any card scored. Their absence from the counts above is a gap in this analyzer's frontend coverage — not a finding that they carry text alternatives, labels, keyboard semantics or correct ARIA.
  • AC4 Keyboard semantics — 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 renders user interface from a TEMPLATE LANGUAGE or a host-language HTML BUILDER — 10 Feliz (F#) template file(s) carrying 27 markup element(s) (e.g. tests/Electron.Renderer/FileTreeRenameWorkflow.test.fs, src/Components/src/Util/Extensions.fs, src/Components/src/Page/ProvenanceGrouping/EditorActions.fs) — and the accessibility cards on this run were measured over the 190 parsed markup document(s) ONLY. The markup model reads .html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx, html`…` templates and DOM-assigned HTML strings in .ts/.js, the .erb/.ejs/.eex/.heex/.leex/.twig/.jinja/.j2/.liquid/.njk/.hbs/.mustache/.blade.php/.gohtml template languages, .astro/.templ/.pug/.jade/.haml/.slim, and the kotlinx.html/Compose HTML/kotlin-react, Giraffe/Falco/Fable.React/Feliz/Bolero and Jaspr builder DSLs; 10 of the file(s) above import an HTML builder DSL whose element calls it did not project — a builder it has no reader for, or calls in a shape its reader does not know — so those views were not merely unparsed but unenumerated: not one of their elements entered the population any card scored. Their absence from the counts above is a gap in this analyzer's frontend coverage — not a finding that they carry text alternatives, labels, keyboard semantics or correct ARIA.
  • AC5 ARIA correctness — 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 renders user interface from a TEMPLATE LANGUAGE or a host-language HTML BUILDER — 10 Feliz (F#) template file(s) carrying 27 markup element(s) (e.g. tests/Electron.Renderer/FileTreeRenameWorkflow.test.fs, src/Components/src/Util/Extensions.fs, src/Components/src/Page/ProvenanceGrouping/EditorActions.fs) — and the accessibility cards on this run were measured over the 190 parsed markup document(s) ONLY. The markup model reads .html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx, html`…` templates and DOM-assigned HTML strings in .ts/.js, the .erb/.ejs/.eex/.heex/.leex/.twig/.jinja/.j2/.liquid/.njk/.hbs/.mustache/.blade.php/.gohtml template languages, .astro/.templ/.pug/.jade/.haml/.slim, and the kotlinx.html/Compose HTML/kotlin-react, Giraffe/Falco/Fable.React/Feliz/Bolero and Jaspr builder DSLs; 10 of the file(s) above import an HTML builder DSL whose element calls it did not project — a builder it has no reader for, or calls in a shape its reader does not know — so those views were not merely unparsed but unenumerated: not one of their elements entered the population any card scored. Their absence from the counts above is a gap in this analyzer's frontend coverage — not a finding that they carry text alternatives, labels, keyboard semantics or correct ARIA.
  • AC6 Visual & motion safety — 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 renders user interface from a TEMPLATE LANGUAGE or a host-language HTML BUILDER — 10 Feliz (F#) template file(s) carrying 27 markup element(s) (e.g. tests/Electron.Renderer/FileTreeRenameWorkflow.test.fs, src/Components/src/Util/Extensions.fs, src/Components/src/Page/ProvenanceGrouping/EditorActions.fs) — and the accessibility cards on this run were measured over the 190 parsed markup document(s) ONLY. The markup model reads .html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx, html`…` templates and DOM-assigned HTML strings in .ts/.js, the .erb/.ejs/.eex/.heex/.leex/.twig/.jinja/.j2/.liquid/.njk/.hbs/.mustache/.blade.php/.gohtml template languages, .astro/.templ/.pug/.jade/.haml/.slim, and the kotlinx.html/Compose HTML/kotlin-react, Giraffe/Falco/Fable.React/Feliz/Bolero and Jaspr builder DSLs; 10 of the file(s) above import an HTML builder DSL whose element calls it did not project — a builder it has no reader for, or calls in a shape its reader does not know — so those views were not merely unparsed but unenumerated: not one of their elements entered the population any card scored. Their absence from the counts above is a gap in this analyzer's frontend coverage — not a finding that they carry text alternatives, labels, keyboard semantics or correct ARIA.
  • AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository's container is Microsoft.Extensions.DependencyInjection registered from F#, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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.
  • 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.
  • P2 Observability — 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. Observability was not assessed: this check recognises the logging, tracing/metrics and health-check idioms of .NET, the JVM, Go, Python, JavaScript/TypeScript, Rust, Ruby, PHP, Swift, Dart, Elixir and Erlang, and most of this repository's production source is in none of them. Absence of an idiom this check recognises is NOT evidence that this repo lacks structured logging. This is a gap in the analyzer, not a finding about this repository.
  • PF2 Allocation 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. Those languages have allocation-aware idioms of their own, but this check does not read them yet. That is a gap in this analyzer's language reach — not a finding that the code is careless with allocations.
  • 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.
  • 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.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • 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 REDACTED Scanning: REDACTED 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.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a 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.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • 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.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • 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 (4): D19, D21, D26, 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.2 / 10Adequate✓ Tool-verified

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

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

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

80 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was GitWorkflow.updateCore at 210. A further 18 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.

GitWorkflow.updateCore (cyclomatic 210)src/Electron/src/Renderer/Context/GitWorkflow.fs:2905
ProvenanceGrouping.Main (cyclomatic 180)src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21
ArcVaultsApi.api (cyclomatic 146)src/Electron/src/Main/IPC/IArcVaultsApi.fs:169
Interface.update (cyclomatic 77)src/Client/Update/InterfaceUpdate.fs:87
TextInputWithMarkdown.TextInputWithMarkdown (cyclomatic 76)src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:63

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

What to do

  1. Bring the 3 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with GitWorkflow.updateCore (cyclomatic 210), ProvenanceGrouping.Main (cyclomatic 180), ArcVaultsApi.api (cyclomatic 146). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cyclomatic Complexity from 5.2 to about 5.8/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
  2. 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.

D2 · Cognitive Complexity4.7 / 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.7 / 10 · rule-coverage 100% · ceiling Prevented

106 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
ArcVaultsApi.api (cognitive 169)src/Electron/src/Main/IPC/IArcVaultsApi.fs:169
GitWorkflow.updateCore (cognitive 131)src/Electron/src/Renderer/Context/GitWorkflow.fs:2905
TextInputWithMarkdown.TextInputWithMarkdown (cognitive 117)src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:63
TutorialOverlay.Main (cognitive 92)src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs:143

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

What to do

  1. Bring the 3 bodies over 120 down to 120 or less in Cognitive Complexity — start with ProvenanceGrouping.Main (cognitive 192), ArcVaultsApi.api (cognitive 169), GitWorkflow.updateCore (cognitive 131). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cognitive Complexity from 4.7 to about 5.3/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
  2. 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.

D3 · God Classes8.4 / 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.4 / 10 · rule-coverage 100% · ceiling Prevented

30 god class(es) detected.

FileTooLong: Context/GitWorkflow.fs · ×25src/Electron/src/Renderer/Context/GitWorkflow.fs
TooManyFunctions: Session · ×4src/Shared/ProvenanceGrouping/Session.fs:89
TooManyMethods: Iconssrc/Components/src/Primitive/Icons.fs:9

What to do

  1. Resolve the 25 FileTooLong finding(s) in God Classes — start with GitWorkflow.fs, GitSidebar.fs, Controls.fs. — One of this dimension's main actionable groups (25 warning-level).
  2. Resolve the 4 TooManyFunctions finding(s) in God Classes — start with Session.fs, Mappings.fs, VersionControlApiClient.fs. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 1 TooManyMethods finding(s) in God Classes — start with Icons.fs. — One of this dimension's main actionable groups (1 warning-level).
  4. 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.

D4 · Code Duplication9.3 / 10Stronggated by 133 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

125 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 (5 lines × 2) · ×8src/Client/MainComponents/EmptyTableElement.fs:23
Duplicated block (15 lines × 2) · ×7src/Client/OfficeInterop/ExcelHelper.fs:240
Duplicated block (12 lines × 2) · ×7src/Client/OfficeInterop/ExcelHelper.fs:465
Duplicated block (9 lines × 2) · ×6src/Client/Pages/FilePicker/FilePickerView.fs:186
Duplicated block (13 lines × 2) · ×5src/Client/MainComponents/Widgets.fs:249

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

What to do

  1. Resolve the 8 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Widgets.fs (2), Term.fs (2), EmptyTableElement.fs. — One of this dimension's main actionable groups (8 warning-level).
  2. Resolve the 7 Duplicated block (15 lines × 2) finding(s) in Code Duplication — start with ExcelHelper.fs (2), FilePickerView.fs, DataAnnotator.fs. — One of this dimension's main actionable groups (7 warning-level).
  3. 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).
  4. 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.

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

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.

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

D13 · REDACTED 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.

REDACTED

What to do

  1. Resolve the 2 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
  2. Enforce REDACTED 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.

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

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

Top hotspots: src/Electron/src/Renderer/Context/GitWorkflow.fs (62×210=13020); src/Electron/src/Main/IPC/IArcVaultsApi.fs (56×146=8176); src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs (19×180=3420) Repeated repair below the complexity floor: src/Components/src/ClipboardContract/Contract.fs (3 of 5 changes were fixes); src/Components/src/Util/Extensions.fs (3 of 5 changes were fixes); build/Actions/Release.fs (3 of 4 changes were fixes)

Hotspot: src/Electron/src/Renderer/Context/GitWorkflow.fs · ×35src/Electron/src/Renderer/Context/GitWorkflow.fs:2905
Repeated repair: src/Components/src/ClipboardContract/Contract.fs · ×3src/Components/src/ClipboardContract/Contract.fs:50

What to do

  1. Resolve the 35 Hotspot finding(s) in Churn × Complexity Hotspots — start with ContextMenu.fs (2), GitWorkflow.fs, IArcVaultsApi.fs. — One of this dimension's main actionable groups (35 warning-level).
  2. Resolve the 3 Repeated repair finding(s) in Churn × Complexity Hotspots — start with Contract.fs, Extensions.fs, Release.fs. — One of this dimension's main actionable groups (3 warning-level).

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

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

96 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/Electron/src/Renderer/Context/GitWorkflow.fs. Counted over 319 of the 531 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

  1. Resolve the 3 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (3 recommendation-level).
  2. 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.

D19 · Documentation QualityExemplary◐ Sampled · advisory

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

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

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

The repository's root README (Swate) and the docs/maintainer/README are both excellent: Swate is described with a strong urban-dictionary brand name, an overview of its Electron desktop app, a release-workflow pipeline diagram, and links to Storybook, knowledgebase, and the ARCitect integration. The architecture/Docs directory contains a well-structured version-control guide (12 sections) and a React component-design document covering file-placement rules, PascalCase naming, and namespace conventions for isolated components. All visible documents are complete and well-organized.

Documentation: contradicts the code · ×2docs/GitFunctionalityUserGuide.md

✓ On the Gold path — maintain.

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

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

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

Method: 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

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

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.

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

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

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

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

4 of 4 build units (npm) flagged as possibly oversized/incoherent.

Split src/Client
Split src/Components

What to do

  1. Resolve the 1 Split src/Client finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 Split src/Components finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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: REDACTED 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.

REDACTED
REDACTED

What to do

  1. Resolve the 5 REDACTED finding(s) in Secrets (history) — start with REDACTED (3), REDACTED, REDACTED. — One of this dimension's main actionable groups (5 issue-level).
  2. 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.

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 39 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), … (+34 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.

REDACTED
REDACTED
REDACTED

What to do

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

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

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 and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

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

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

35 finding(s): 2 critical, 22 high, 9 medium, 2 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D31 · IaC & Container Security7.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.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 5 High IaC finding(s) in IaC & Container Security — start with REDACTED (5). — One of this dimension's main actionable groups (5 issue-level).
  2. Resolve the 5 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3), REDACTED (2). — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — 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.

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 319 of the 531 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.

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

Strongest change-coupling: main.fs↔preload.fs 67%; GitSidebar.stories.tsx↔Types.fs 67%; REDACTED↔Server.fs 62%

Change coupling: main.fs ↔ preload.fs · ×7src/Electron/src/Main/main.fs

What to do

  1. Resolve the 7 Change coupling finding(s) in Change Coupling — start with IArcVaultsApi.fs (2), main.fs, GitSidebar.stories.tsx. — One of this dimension's main actionable groups (7 warning-level).

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

D36 · Supply-chain Provenance & Signing5.0 / 10Adequate✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. 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.

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.

  • An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. (×2) — src/Client/Pages/Info/InfoView.fs:54, src/Client/SharedComponents/Logo.fs:21

What to do

  • Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
AC2 · Forms & labels4.9 / 10Weak✓ 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 control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×23) — src/Client/Index.fs:70, src/Client/MainComponents/EmptyTableModals.fs:132, src/Client/MainComponents/FooterTabs.fs:94, …
  • This <label> has no for 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 for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×8) — src/Client/Modals/SelectiveImportModal.fs:94, src/Client/Pages/Settings/SettingsView.fs:135, src/Client/SharedComponents/Metadata/Forms.fs:197, …
  • A fieldset groups related controls but has no <legend> to name the group. Add a <legend> as its first child — or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption's id instead, which names the group without rendering a second one. — src/Client/Modals/SelectiveImportModal.fs:130
  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×2) — src/Client/Pages/BuildingBlock/Dropdown.fs:20, src/Client/Pages/BuildingBlock/SearchComponent.fs:129
  • A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×2) — src/Client/Pages/ProtocolTemplates/ProtocolView.fs:264, src/Components/src/Composite/Actionbar/Actionbar.fs:44
  • 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:40, src/Components/playground/App.tsx:62, src/Components/playground/App.tsx:74
  • 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:124

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.
AC3 · Page structure5.6 / 10Adequate✓ 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.

  • A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). (×3) — src/Client/Pages/FilePicker/FilePickerView.fs:244, src/Components/src/Composite/SortableList/SortableList.fs:142, src/Components/src/Primitive/BaseModal/BaseModal.fs:249
  • 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
  • An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative. — src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:292
  • 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

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.
AC4 · Keyboard semantics1.9 / 10Critical✓ Tool-verified

Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".

  • A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0". (×10) — src/Client/MainComponents/FooterTabs.fs:120, src/Client/MainComponents/FooterTabs.fs:167, src/Client/MainComponents/FooterTabs.fs:196, …
  • An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action. (×10) — src/Client/MainComponents/NoFileElement.fs:67, src/Client/Pages/BuildingBlock/Dropdown.fs:96, src/Client/Pages/BuildingBlock/Dropdown.fs:112, …
  • A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. (×7) — src/Client/Modals/InteropLoggingModal.fs:44, src/Client/SharedComponents/Logo.fs:11, src/Client/Views/MainPageViews.fs:20, …
  • An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action. — src/Client/Pages/BuildingBlock/Dropdown.fs:49
  • This <div> announces itself as a role="tab" and binds a click, but nothing can put focus on it: no tabindex="0" in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex="0"="0" and an Enter/Space key handler, or make it a native <button>. If a parent widget owns the keyboard model, that parent must move focus onto the active role="tab" or point aria-activedescendant at it. — src/Components/src/Composite/TermSearch/TermSearch.fs:675
  • This <article> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabindex="0", so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex="0"="0" so the element can receive that focus. — src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:417
  • This <div> carries tabindex="0", so it is in the tab order and a keyboard user will land on it — but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native <button> or <a href> and nowhere else, so this can be focused and never activated. Use a <button>, or handle Enter/Space in a key handler. — src/Components/src/Primitive/CardGrid/CardGrid.fs:13
  • This <ul> carries tabindex="0", so it is in the tab order and a keyboard user will land on it — but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native <button> or <a href> and nowhere else, so this can be focused and never activated. Use a <button>, or handle Enter/Space in a key handler. Give it a role as well, so assistive tech can announce what it is. — src/Components/src/Primitive/Dropdown/Dropdown.fs:44

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.

Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

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.

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 190 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.
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.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

AX8 · Test isolation7.5 / 10Strong✓ Tool-verified

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

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

  • `Client.Tests` (production) references the test project `Shared.Tests`. Production must never depend on test code — it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference.

What to do

  • Remove every production → test project reference: extract any shared test helper into a production support library (which the tests reference), or invert the dependency so the test project depends on production — not the reverse.
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.
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).
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.

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.

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

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

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

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

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

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

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

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.

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:87 · src/Components/playground/App.tsx:103 · src/Components/playground/App.tsx:117 · src/Components/playground/App.tsx:138 · +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:87
  • src/Components/playground/App.tsx:109 · src/Components/playground/App.tsx:123 · src/Components/playground/App.tsx:144 · src/Components/playground/App.tsx:181 · +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:109

What to do

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

R3 · Large Files4.7 / 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/Page/GitSidebar/GitSidebar.stories.tsx (802), src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (798), src/Components/src/Page/FileExplorer/FileExplorer.stories.tsx (737), 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.
R4 · Test Coverage3.3 / 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. (×2) — src/Components/playground/App.tsx, src/Components/playground/main.tsx

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
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.

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.
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) (~103 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
  • 58 file(s) (~12961 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/Composite/SortableList/SortableList.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
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.
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.

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.
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

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

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

WCAG coverage — what static analysis assessed

Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 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).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC1 · Text alternatives1.1.1, 1.2.2, 1.2.5Partial signal
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC4 · Keyboard semantics2.1.1, 2.4.3Partial signal
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only
AC7 · A11y enforcementenforcement — no page criterionEnforcement posture (process)

Not statically assessed — these 40 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.2.1, 1.2.3, 1.2.4, 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.2, 2.1.4, 2.2.2, 2.3.1, 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.

LensScoreRatingImpact
Code Health75%StrongStrongest area.
Architecture84%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity72%StrongSolid.
Readiness40%Weak — gated by D13, R4, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security70%Adequate — gated by D30Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility44%Weak — gated by AC4Capped 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 — 71 check(s) not relevant to this codebase

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

  • AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX2 Stateful singletons — Not applicable: TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • 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 — no exported interface declares behaviour
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — compose up failed (exit 18 — an image could not be pulled) — neo4j Pulling redis Pulling swobup Pulling neo4j Error Get "https://registry-1.docker.io/v2/": Forbidden redis Error Get "https://registry-1.docker.io/v2/": Forbidden swobup Error context canceled Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the earlier `compose pull` step reported: neo4j Pulling swobup Pulling redis Pulling redis Error Get "https://registry-1.docker.io/v2/": Forbidden neo4j Error Get "https://registry-1.docker.io/v2/": Forbidden swobup Error context canceled Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • 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 — No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — No inline comments to assess — comment value is not applicable here.
  • D25 ADR Conformance — no ADRs to check
  • D32 Data Compliance (PII/GDPR) — 39 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.
  • D6 Cohesion (LCOM4) — D6 reads a CS/VB/GO/SCALA/SWIFT/DART/JAVA/PY/KT/TS/TSX/MTS/CTS/JS/JSX/MJS/CJS/PHP/RB/RS/ERL/EX/EXS class graph only — this repository's production source is .fs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
  • D8 Code Coverage — Coverage NOT MEASURED: the .NET half could not be measured — the repository wires up no coverage collector for `--collect:"XPlat Code Coverage"` to use; the JavaScript/TypeScript half could not be measured — 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 Domain Modelling — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 3 strongly-typed id(s); 314 value object(s); 27 domain event(s); its domain events are published by services or handlers — no domain entity raises one; no aggregate is declared and no domain structure surrounds the state-guarding types: not claimed as DDD
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C# and JavaScript/TypeScript, and neither was read for this repository's product. 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 recognises the logging, tracing/metrics and health-check idioms of .NET, the JVM, Go, Python, JavaScript/TypeScript, Rust, Ruby, PHP, Swift, Dart, Elixir and Erlang, and most of this repository's production source is in none of them. Absence of an idiom this check recognises is NOT evidence that this repo lacks structured logging. 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 — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a BenchmarkDotNet reference in an .fsproj or .vbproj, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Allocation awareness was not assessed: this repository holds F#, whose allocation-aware idioms this check does not model yet. That is a gap in the analyzer's language reach, not a finding about your code.
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • 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
  • X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • 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.
  • X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 128 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×21
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <input> without a programmatic label · ×20
  • <input> without a programmatic label src/Client/Index.fs:70 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/MainComponents/FooterTabs.fs:94 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/MainComponents/NoFileElement.fs:22 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/MainComponents/TableFooter.fs:25 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Modals/SelectiveImportModal.fs:67 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Modals/SelectiveImportModal.fs:234 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Pages/BuildingBlock/Dropdown.fs:20 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label src/Client/Pages/BuildingBlock/SearchComponent.fs:129 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label src/Client/Pages/BuildingBlock/SearchComponent.fs:155 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Pages/FilePicker/FilePickerView.fs:51 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Pages/JsonImport/JsonImport.fs:93 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Pages/ProtocolTemplates/ProtocolView.fs:63 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/Pages/Settings/SettingsView.fs:156 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs:203 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs:897 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs:928 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs:1226 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Client/SharedComponents/Metadata/Generic.fs:64 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Components/src/Composite/AnnotationTable/Modals.fs:205 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label src/Components/src/Composite/AnnotationTable/Modals.fs:1127 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics · Click handler on a non-interactive <div> · ×14
  • Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs:120 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs:167 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs:196 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs:224 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Client/MainComponents/FooterTabs.fs:257 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Client/Modals/InteropLoggingModal.fs:44 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> src/Client/SharedComponents/Logo.fs:11 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> src/Client/Views/SpreadsheetView.fs:12 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> src/Components/src/Composite/AnnotationTable/Modals.fs:1687 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Components/src/Composite/AnnotationTable/Modals.fs:1696 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Components/src/Composite/AnnotationTable/Modals.fs:1705 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Components/src/Composite/Notes/NoteSearch/NoteSearch.fs:118 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs:137 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
  • Click handler on a non-interactive <div> src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:524 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabindex="0".
AC2 · Forms & labels · <label> that labels no control · ×11
  • <label> that labels no control src/Client/Modals/SelectiveImportModal.fs:94 — This <label> has no for 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 for="<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/Client/Pages/Settings/SettingsView.fs:135 — This <label> has no for 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 for="<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/Client/SharedComponents/Metadata/Forms.fs:197 — This <label> has no for 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 for="<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/Client/SharedComponents/Metadata/Forms.fs:1342 — This <label> has no for 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 for="<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/Client/SharedComponents/NavbarBurger.fs:14 — This <label> has no for 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 for="<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:40 — 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:62 — 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:74 — 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/src/Composite/AnnotationTable/Modals.fs:204 — This <label> has no for 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 for="<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/src/Composite/AnnotationTable/Modals.fs:230 — This <label> has no for 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 for="<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/src/Composite/AnnotationTable/Modals.fs:1080 — This <label> has no for 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 for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
AC2 · Forms & labels · <select> without a programmatic label · ×5
  • <select> without a programmatic label src/Client/MainComponents/EmptyTableModals.fs:132 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label src/Client/Pages/JsonExporter/JsonExporter.fs:58 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label src/Client/Pages/JsonImport/JsonImport.fs:70 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label src/Client/SharedComponents/Metadata/Forms.fs:881 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label src/Components/src/Composite/AnnotationTable/Modals.fs:1243 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
D28 · Secrets (history) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · High IaC · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
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").
AC1 · Text alternatives · <img> without a text alternative · ×2
  • <img> without a text alternative src/Client/Pages/Info/InfoView.fs:54 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative src/Client/SharedComponents/Logo.fs:21 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
AC2 · Forms & labels · <button> with no accessible text · ×2
  • <button> with no accessible text src/Client/Pages/ProtocolTemplates/ProtocolView.fs:264 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text src/Components/src/Composite/Actionbar/Actionbar.fs:44 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
AC4 · Keyboard semantics · Click handler on a non-interactive <li> · ×2
  • Click handler on a non-interactive <li> src/Client/Views/MainPageViews.fs:20 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <li> src/Components/src/Composite/ArcSelector/ArcSelector.fs:28 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
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 · REDACTED Scanning · Leaked secret · ×2
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×2
  • REDACTED
  • REDACTED
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>.
AC4 · Keyboard semantics · Clickable role="tab" that no keyboard user can reach · ×1
  • Clickable role="tab" that no keyboard user can reach src/Components/src/Composite/TermSearch/TermSearch.fs:675 — This <div> announces itself as a role="tab" and binds a click, but nothing can put focus on it: no tabindex="0" in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex="0"="0" and an Enter/Space key handler, or make it a native <button>. If a parent widget owns the keyboard model, that parent must move focus onto the active role="tab" or point aria-activedescendant at it.
AC4 · Keyboard semantics · Click handler on a non-interactive <span> · ×1
  • Click handler on a non-interactive <span> src/Components/src/Page/FileExplorer/FileExplorerItem.fs:257 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC4 · Keyboard semantics · Hover-only interaction on <article> · ×1
  • Hover-only interaction on <article> src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:417 — This <article> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabindex="0", so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex="0"="0" so the element can receive that focus.
AC4 · Keyboard semantics · Focusable <div> isn't keyboard-operable · ×1
  • Focusable <div> isn't keyboard-operable src/Components/src/Primitive/CardGrid/CardGrid.fs:13 — This <div> carries tabindex="0", so it is in the tab order and a keyboard user will land on it — but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native <button> or <a href> and nowhere else, so this can be focused and never activated. Use a <button>, or handle Enter/Space in a key handler.
AC4 · Keyboard semantics · Focusable <ul> isn't keyboard-operable · ×1
  • Focusable <ul> isn't keyboard-operable src/Components/src/Primitive/Dropdown/Dropdown.fs:44 — This <ul> carries tabindex="0", so it is in the tab order and a keyboard user will land on it — but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native <button> or <a href> and nowhere else, so this can be focused and never activated. Use a <button>, or handle Enter/Space in a key handler. Give it a role as well, so assistive tech can announce what it is.
AX8 · Test isolation · Production project references a test project · ×1
  • Production project references a test project: Client.Tests → Shared.Tests — `Client.Tests` (production) references the test project `Shared.Tests`. Production must never depend on test code — it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High vulnerability · ×1
  • REDACTED
Serious — 442 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×35
  • Hotspot: src/Electron/src/Renderer/Context/GitWorkflow.fs src/Electron/src/Renderer/Context/GitWorkflow.fs:2905 — src/Electron/src/Renderer/Context/GitWorkflow.fs changed 62 times in last 90 days, max cyclomatic complexity 210 in GitWorkflow.updateCore at line 2905. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Electron/src/Main/IPC/IArcVaultsApi.fs src/Electron/src/Main/IPC/IArcVaultsApi.fs:169 — src/Electron/src/Main/IPC/IArcVaultsApi.fs changed 56 times in last 90 days, max cyclomatic complexity 146 in ArcVaultsApi.api at line 169. 14 of those changes were fix/bug commits, and the other 42 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/ProvenanceGrouping.fs src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:21 — src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs changed 19 times in last 90 days, max cyclomatic complexity 180 in ProvenanceGrouping.Main at line 21. 2 of those changes were fix/bug commits, and the other 17 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/ArcVault/ArcVault.fs src/Electron/src/Main/ArcVault/ArcVault.fs:383 — src/Electron/src/Main/ArcVault/ArcVault.fs changed 78 times in last 90 days, max cyclomatic complexity 31 in ArcVaultExtensions.ArcVault._FileEventController at line 383. 18 of those changes were fix/bug commits, and the other 60 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- src/Electron/src/Main/ArcVault/ArcVault.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 30 times in last 90 days, max cyclomatic complexity 68 in FileTree.FileTree at line 43. 3 of those changes were fix/bug commits, and the other 27 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Electron/src/Main/IPC/IVersionControlApi.fs src/Electron/src/Main/IPC/IVersionControlApi.fs:411 — src/Electron/src/Main/IPC/IVersionControlApi.fs changed 23 times in last 90 days, max cyclomatic complexity 43 in IVersionControlApi.api at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- src/Electron/src/Main/IPC/IVersionControlApi.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 15 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 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Components/src/Composite/Workspace/DropOverlay.fs src/Components/src/Composite/Workspace/DropOverlay.fs:18 — src/Components/src/Composite/Workspace/DropOverlay.fs changed 8 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Electron/src/Main/ArcVault/ArcVaultHelper.fs src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:65 — src/Electron/src/Main/ArcVault/ArcVaultHelper.fs changed 17 times in last 90 days, max cyclomatic complexity 22 in ArcVaultHelper.updateARCByFileContentDTO at line 65. 3 of those changes were fix/bug commits, 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Composite/TutorialOverlay/TutorialOverlay.fs src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs:143 — src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs changed 5 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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: src/Components/src/Page/ProvenanceGrouping/GroupCard.fs src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:300 — src/Components/src/Page/ProvenanceGrouping/GroupCard.fs changed 6 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/GitSidebar/GitSidebar.fs src/Components/src/Page/GitSidebar/GitSidebar.fs:1644 — src/Components/src/Page/GitSidebar/GitSidebar.fs changed 7 times in last 90 days, max cyclomatic complexity 37 in GitSidebar.Main at line 1644. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- src/Components/src/Page/GitSidebar/GitSidebar.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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/ArcFileEditor/ArcFileFooterTabs.fs src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs:298 — src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs changed 10 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:262 — src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs changed 7 times in last 90 days, max cyclomatic complexity 34 in DataHubBrowser.ExplorePanel at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Shared/ARCtrl.Helper.fs src/Shared/ARCtrl.Helper.fs:21 — src/Shared/ARCtrl.Helper.fs changed 14 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs:121 — src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs changed 12 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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 11 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:326 — src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs changed 6 times in last 90 days, max cyclomatic complexity 29 in FolderedDraggableList.FolderedDraggableList at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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: build/Build.fs build/Build.fs:6 — build/Build.fs changed 4 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Components/src/Page/ValidationPackageBrowser/Helper.fs src/Components/src/Page/ValidationPackageBrowser/Helper.fs:14 — src/Components/src/Page/ValidationPackageBrowser/Helper.fs changed 8 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Shared/PathHelpers.fs src/Shared/PathHelpers.fs:295 — src/Shared/PathHelpers.fs changed 6 times in last 90 days, max cyclomatic complexity 22 in ArcEntityPathRules.classifyDeleteTarget at line 295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- src/Shared/PathHelpers.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/MainContent/Main.fs src/Electron/src/Renderer/Components/MainContent/Main.fs:78 — src/Electron/src/Renderer/Components/MainContent/Main.fs changed 7 times in last 90 days, max cyclomatic complexity 18 in Main.Main at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- src/Electron/src/Renderer/Components/MainContent/Main.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:49 — src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs changed 3 times in last 90 days, max cyclomatic complexity 41 in ConnectorOverlay.Main at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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/Components/src/Primitive/ContextMenu/ContextMenu.fs src/Components/src/Primitive/ContextMenu/ContextMenu.fs:82 — src/Components/src/Primitive/ContextMenu/ContextMenu.fs changed 5 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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.
  • + 10 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×25
  • FileTooLong: Context/GitWorkflow.fs src/Electron/src/Renderer/Context/GitWorkflow.fs — FileTooLong — 3300 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 118 functions. The bar is 500 significant lines; this is 2800 over it, 6.60× 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 — 1665 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1165 over it, 3.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: 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: 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: ArcVault/ArcVault.fs src/Electron/src/Main/ArcVault/ArcVault.fs — FileTooLong — 1094 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 594 over it, 2.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: 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: IPC/IVersionControlApi.fs src/Electron/src/Main/IPC/IVersionControlApi.fs — FileTooLong — 905 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 31 functions. The bar is 500 significant lines; this is 405 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: IPC/IArcVaultsApi.fs src/Electron/src/Main/IPC/IArcVaultsApi.fs — FileTooLong — 845 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 345 over it, 1.69× 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 — 815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 315 over it, 1.63× 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: 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: 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.
  • FileTooLong: FileExplorer/FileTree.fs src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.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.
AC4 · Keyboard semantics · Anchor without href · ×10
  • Anchor without href src/Client/MainComponents/NoFileElement.fs:67 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Client/Pages/BuildingBlock/Dropdown.fs:96 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Client/Pages/BuildingBlock/Dropdown.fs:112 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Client/SharedComponents/NavbarBurger.fs:53 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Client/Views/MainPageViews.fs:23 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Components/src/Composite/AnnotationTable/Modals.fs:766 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Components/src/Composite/Layout/Layout.fs:547 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Components/src/Composite/Layout/Layout.fs:555 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Components/src/Composite/TermSearch/TermSearch.fs:269 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs:311 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
D30 · Dependency Vulnerabilities · Medium CVE · ×9
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×8
  • Duplicated block (5 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.
  • 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/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/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:150-154 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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.
D35 · Change Coupling · Change coupling · ×7
  • 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 67% of the time (10 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 10 shared commits counted here, the most recent 3 are `b93028fd` Add the provider-neutral version control session host and IPC; `8b51d1f8` Ducktape fix: Fix template loading in Electron startup by moving temp…; `0c05679c` Start implementing datahubbrowser — 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: REDACTED ↔ Server.fs REDACTED — `REDACTED` 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: 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: 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 56% of the time (9 of the 16 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 53% of the time (8 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 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: 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/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/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/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/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/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 (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/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/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/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/ArcVault/ArcVault.fs:1416 — src/Electron/src/Main/ArcVault/ArcVault.fs:1416-1427 | src/Electron/src/Main/ArcVault/ArcVault.fs:1455-1466 — 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/ArcVault/ArcVault.fs:1416` 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/Electron/src/Main/ArcVault/ArcVault.fs:1430` calls `Ok` and `src/Electron/src/Main/ArcVault/ArcVault.fs:1467` 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 (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/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/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/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
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×5
  • 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/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/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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×5
  • 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/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 (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/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/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/Electron/src/Main/IPC/IVersionControlApi.fs:143 — src/Electron/src/Main/IPC/IVersionControlApi.fs:143-149 | src/Electron/src/Main/IPC/IVersionControlApi.fs:242-248 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×5
  • 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.
  • Duplicated block (6 lines × 2) src/Electron/src/Main/IPC/IVersionControlApi.fs:147 — src/Electron/src/Main/IPC/IVersionControlApi.fs:147-152 | src/Electron/src/Main/IPC/IVersionControlApi.fs:218-223 — 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/IVersionControlApi.fs:147` 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 (6 lines × 2) src/Electron/src/Renderer/Context/GitWorkflow.fs:585 — src/Electron/src/Renderer/Context/GitWorkflow.fs:585-590 | src/Electron/src/Swate.Electron.Shared/IPCTypes.fs:120-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.
D3 · God Classes · TooManyFunctions · ×4
  • 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: Mappings src/Electron/src/Main/VersionControl/Mappings.fs:4 — TooManyFunctions — 34 functions. The bar is 30 functions; this is 4 over it, 1.13× 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: VersionControlApiClient src/Electron/src/Renderer/VersionControlApiClient.fs:5 — TooManyFunctions — 33 functions. The bar is 30 functions; this is 3 over it, 1.10× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
  • TooManyFunctions: 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.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×4
  • 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/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/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/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/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/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.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×4
  • 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/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/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.
AC3 · Page structure · Data table has no header cells · ×3
  • Data table has no header cells src/Client/Pages/FilePicker/FilePickerView.fs:244 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells src/Components/src/Composite/SortableList/SortableList.fs:142 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells src/Components/src/Primitive/BaseModal/BaseModal.fs:249 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
D15 · Churn × Complexity Hotspots · Repeated repair · ×3
  • Repeated repair: src/Components/src/ClipboardContract/Contract.fs src/Components/src/ClipboardContract/Contract.fs:50 — src/Components/src/ClipboardContract/Contract.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 6 (its worst body is Mapping.map at line 50), 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 cross pasting into swate alpha and unified pasting behaviour”; “* Fixed context menu-paste with right-click * Implemented preservation of target unit term when available”; “Fixed plain numeric AnnotationTable paste has regressed for unitized cells. Fixed treatment of PlainText.parseRows of terminal newline as an additional empty spreadsheet row.”. 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- src/Components/src/ClipboardContract/Contract.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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +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.
  • Repeated repair: build/Actions/Release.fs build/Actions/Release.fs:8 — build/Actions/Release.fs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is Release.npm at line 8), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix `dotnet run --project ./build/Build.fsproj --` calls with `--` args seperator”; “more pipeline fixes”; “Fix release pipeline, temp disable tests”. 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 16:57:42 +02:00' --until='2026-10-02 16:57:42 +02:00' --full-history --no-merges -- build/Actions/Release.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication · Duplicated block (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 (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 (14 lines × 2) · ×3
  • 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/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) · ×3
  • 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/Electron/src/Main/IPC/IArcVaultsApi.fs:349 — src/Electron/src/Main/IPC/IArcVaultsApi.fs:349-359 | src/Electron/src/Main/IPC/IArcVaultsApi.fs:687-697 — 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:349` 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/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.
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/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.
  • 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.
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 (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 (18 lines × 2) · ×2
  • 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.
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 (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.
R4 · Test Coverage · No test reaches this file · ×2
  • 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/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.
AC2 · Forms & labels · <fieldset> without a <legend> · ×1
  • <fieldset> without a <legend> src/Client/Modals/SelectiveImportModal.fs:130 — A fieldset groups related controls but has no <legend> to name the group. Add a <legend> as its first child — or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption's id instead, which names the group without rendering a second one.
AC2 · Forms & labels · <ComboBox> field component without a label · ×1
  • <ComboBox> field component without a label src/Components/playground/App.tsx:124 — 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.
AC3 · Page structure · Empty <h3> heading · ×1
  • Empty <h3> heading src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:292 — An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
AC4 · Keyboard semantics · Link used as a button (placeholder href) · ×1
  • Link used as a button (placeholder href) src/Client/Pages/BuildingBlock/Dropdown.fs:49 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
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 190 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 · GitWorkflow.updateCore (cyclomatic 210) · ×1
  • GitWorkflow.updateCore (cyclomatic 210) src/Electron/src/Renderer/Context/GitWorkflow.fs:2905 — GitWorkflow.updateCore has cyclomatic complexity 210 (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 · 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 146) · ×1
  • ArcVaultsApi.api (cyclomatic 146) src/Electron/src/Main/IPC/IArcVaultsApi.fs:169 — ArcVaultsApi.api has cyclomatic complexity 146 (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 68) · ×1
  • FileTree.FileTree (cyclomatic 68) src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs:43 — FileTree.FileTree has cyclomatic complexity 68 (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 · IVersionControlApi.api (cyclomatic 43) · ×1
  • IVersionControlApi.api (cyclomatic 43) src/Electron/src/Main/IPC/IVersionControlApi.fs:411 — IVersionControlApi.api has cyclomatic complexity 43 (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 · 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:1644 — 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:262 — 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 · GitWorkflow.runPrimarySaveAttemptAsync (cyclomatic 32) · ×1
  • GitWorkflow.runPrimarySaveAttemptAsync (cyclomatic 32) src/Electron/src/Renderer/Context/GitWorkflow.fs:2095 — GitWorkflow.runPrimarySaveAttemptAsync has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ArcVaultExtensions.ArcVault._FileEventController (cyclomatic 31) · ×1
  • ArcVaultExtensions.ArcVault._FileEventController (cyclomatic 31) src/Electron/src/Main/ArcVault/ArcVault.fs:383 — ArcVaultExtensions.ArcVault._FileEventController has cyclomatic complexity 31 (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 · 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 · GitWorkflow.runPublishAsync (cyclomatic 27) · ×1
  • GitWorkflow.runPublishAsync (cyclomatic 27) src/Electron/src/Renderer/Context/GitWorkflow.fs:1944 — GitWorkflow.runPublishAsync 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 · GitWorkflow.confirmMergeResolutionAsync (cyclomatic 27) · ×1
  • GitWorkflow.confirmMergeResolutionAsync (cyclomatic 27) src/Electron/src/Renderer/Context/GitWorkflow.fs:2583 — GitWorkflow.confirmMergeResolutionAsync 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:505 — 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 · 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 · ArcVaults.OnCloseWindow (cyclomatic 23) · ×1
  • ArcVaults.OnCloseWindow (cyclomatic 23) src/Electron/src/Main/ArcVault/ArcVault.fs:1042 — ArcVaults.OnCloseWindow has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
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 · FileExplorerItem.LFSStatusPill (cyclomatic 22) · ×1
  • FileExplorerItem.LFSStatusPill (cyclomatic 22) src/Components/src/Page/FileExplorer/FileExplorerItem.fs:118 — FileExplorerItem.LFSStatusPill 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 · 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:295 — 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:29 — 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:260 — 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 · 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 · ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible (cyclomatic 19) · ×1
  • ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible (cyclomatic 19) src/Electron/src/Main/ArcVault/ArcVault.fs:311 — ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible 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 · ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cyclomatic 19) · ×1
  • ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cyclomatic 19) src/Electron/src/Main/ArcVault/ArcVault.fs:830 — ArcVaultExtensions.ArcVault.RenameOpenArcRoot has cyclomatic complexity 19 (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 · 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 · GitWorkflow.routeFailure (cyclomatic 18) · ×1
  • GitWorkflow.routeFailure (cyclomatic 18) src/Electron/src/Renderer/Context/GitWorkflow.fs:1431 — GitWorkflow.routeFailure 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. This is NOT this file's highest cyclomatic complexity: GitWorkflow.busyNoticeFromOperation (cyclomatic 24) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
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 · 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:424 — 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 · GitDiffPageLoader.load (cyclomatic 17) · ×1
  • GitDiffPageLoader.load (cyclomatic 17) src/Electron/src/Renderer/Context/GitWorkflow.fs:1277 — GitDiffPageLoader.load has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: GitWorkflow.busyNoticeFromOperation (cyclomatic 24) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
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:275 — 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.
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 · ArcVaultsApi.api (cognitive 169) · ×1
  • ArcVaultsApi.api (cognitive 169) src/Electron/src/Main/IPC/IArcVaultsApi.fs:169 — ArcVaultsApi.api has cognitive complexity 169 (threshold 15). Drivers by points: match/switch 44 (85 pts), error handling 34 (41 pts), if/else 30 (39 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 58). 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 · GitWorkflow.updateCore (cognitive 131) · ×1
  • GitWorkflow.updateCore (cognitive 131) src/Electron/src/Renderer/Context/GitWorkflow.fs:2905 — GitWorkflow.updateCore has cognitive complexity 131 (threshold 15). Drivers by points: match/switch 27 (58 pts), if/else 35 (55 pts), boolean chains 18 (nesting depth added 51). 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 · 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 75) · ×1
  • FileTree.FileTree (cognitive 75) src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs:43 — FileTree.FileTree has cognitive complexity 75 (threshold 15). Drivers by points: match/switch 24 (50 pts), if/else 18 (21 pts), boolean chains 4 (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 · ArcVaultExtensions.ArcVault._FileEventController (cognitive 74) · ×1
  • ArcVaultExtensions.ArcVault._FileEventController (cognitive 74) src/Electron/src/Main/ArcVault/ArcVault.fs:383 — ArcVaultExtensions.ArcVault._FileEventController has cognitive complexity 74 (threshold 15). Drivers by points: if/else 26 (57 pts), match/switch 4 (9 pts), boolean chains 8 (nesting depth added 36). 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 · ArcVaults.OnCloseWindow (cognitive 69) · ×1
  • ArcVaults.OnCloseWindow (cognitive 69) src/Electron/src/Main/ArcVault/ArcVault.fs:1042 — ArcVaults.OnCloseWindow has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (52 pts), error handling 2 (8 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 46). 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 · 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 · IVersionControlApi.api (cognitive 53) · ×1
  • IVersionControlApi.api (cognitive 53) src/Electron/src/Main/IPC/IVersionControlApi.fs:411 — IVersionControlApi.api has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 14 (29 pts), if/else 10 (20 pts), error handling 1 (2 pts), loops 2 (nesting depth added 26). 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:1644 — 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 · 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 · 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 · GitWorkflow.confirmMergeResolutionAsync (cognitive 39) · ×1
  • GitWorkflow.confirmMergeResolutionAsync (cognitive 39) src/Electron/src/Renderer/Context/GitWorkflow.fs:2583 — GitWorkflow.confirmMergeResolutionAsync has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 10 (14 pts), boolean chains 8 (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 · ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cognitive 39) · ×1
  • ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cognitive 39) src/Electron/src/Main/ArcVault/ArcVault.fs:830 — ArcVaultExtensions.ArcVault.RenameOpenArcRoot has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 4 (14 pts), match/switch 4 (10 pts) (nesting depth added 24). 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 · 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 · ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible (cognitive 34) · ×1
  • ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible (cognitive 34) src/Electron/src/Main/ArcVault/ArcVault.fs:311 — ArcVaultExtensions.ArcVault.TryApplyWatcherArcMergeIfEligible has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (14 pts), boolean chains 3 (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 · 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:262 — 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:424 — 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:295 — 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 · GitWorkflow.runPrimarySaveAttemptAsync (cognitive 31) · ×1
  • GitWorkflow.runPrimarySaveAttemptAsync (cognitive 31) src/Electron/src/Renderer/Context/GitWorkflow.fs:2095 — GitWorkflow.runPrimarySaveAttemptAsync has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 5 (9 pts), boolean chains 2 (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 · AuthService.revalidate (cognitive 31) · ×1
  • AuthService.revalidate (cognitive 31) src/Electron/src/Main/Auth/AuthService.fs:436 — 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 · 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 · 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 · 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 · FileExplorerItem.LFSStatusPill (cognitive 26) · ×1
  • FileExplorerItem.LFSStatusPill (cognitive 26) src/Components/src/Page/FileExplorer/FileExplorerItem.fs:118 — FileExplorerItem.LFSStatusPill has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (21 pts), match/switch 4, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
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 · 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 · 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 · GitWorkflow.runPublishAsync (cognitive 23) · ×1
  • GitWorkflow.runPublishAsync (cognitive 23) src/Electron/src/Renderer/Context/GitWorkflow.fs:1944 — GitWorkflow.runPublishAsync has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 9 (19 pts), boolean chains 2, if/else 2 (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 · 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 · FileExplorerGitLfsHelper.contextMenuItems (cognitive 21) · ×1
  • FileExplorerGitLfsHelper.contextMenuItems (cognitive 21) src/Components/src/Page/FileExplorer/FileExplorerGitLfsHelper.fs:109 — FileExplorerGitLfsHelper.contextMenuItems has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GitSidebar.OperationStatusNotice (cognitive 21) · ×1
  • GitSidebar.OperationStatusNotice (cognitive 21) src/Components/src/Page/GitSidebar/GitSidebar.fs:260 — 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 · DataHubBrowser.GitLabEntry (cognitive 20) · ×1
  • DataHubBrowser.GitLabEntry (cognitive 20) src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs:847 — 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 · 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 · GitSidebar.ChangedFilesList (cognitive 19) · ×1
  • GitSidebar.ChangedFilesList (cognitive 19) src/Components/src/Page/GitSidebar/GitSidebar.fs:1263 — GitSidebar.ChangedFilesList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 1 (2 pts) (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 · 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 · GitDiffPageLoader.load (cognitive 18) · ×1
  • GitDiffPageLoader.load (cognitive 18) src/Electron/src/Renderer/Context/GitWorkflow.fs:1277 — GitDiffPageLoader.load has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 2, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
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:505 — 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:29 — 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:163 — 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:275 — 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 · ArcVaultExtensions.ArcVault.ApplyWatcherFileTreeEvents (cognitive 17) · ×1
  • ArcVaultExtensions.ArcVault.ApplyWatcherFileTreeEvents (cognitive 17) src/Electron/src/Main/ArcVault/ArcVault.fs:246 — ArcVaultExtensions.ArcVault.ApplyWatcherFileTreeEvents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ArcVaults.DisposeVault (cognitive 17) · ×1
  • ArcVaults.DisposeVault (cognitive 17) src/Electron/src/Main/ArcVault/ArcVault.fs:977 — ArcVaults.DisposeVault has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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 · AuthService.signIn (cognitive 17) · ×1
  • AuthService.signIn (cognitive 17) src/Electron/src/Main/Auth/AuthService.fs:291 — 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 · 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 · FileTreeCreator.getFileEntries (cognitive 16) · ×1
  • FileTreeCreator.getFileEntries (cognitive 16) src/Electron/src/Main/FileTreeCreator.fs:193 — 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.
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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · 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 (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 · Near-duplicate member pair (46 shared lines) · ×1
  • Near-duplicate member pair (46 shared lines) src/Client/SharedComponents/JsBindings/DndKit.fs:1 — src/Client/SharedComponents/JsBindings/DndKit.fs:1-96 | src/Components/src/JsBindings/DndKit.fs:1-154 — These two members are variants of one another: 46 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:86-118 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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 (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 (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 (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 (27 lines × 2) · ×1
  • 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 (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 (14–19 lines × 2) · ×1
  • Duplicated block (14–19 lines × 2) src/Electron/src/Renderer/Context/GitWorkflow.fs:1879 — src/Electron/src/Renderer/Context/GitWorkflow.fs:1879-1892 | src/Electron/src/Renderer/Context/GitWorkflow.fs:2447-2465 — 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:1879` 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.
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 (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:348 — src/Electron/src/Main/IPC/IArcVaultsApi.fs:348-359 | src/Electron/src/Main/IPC/IArcVaultsApi.fs:385-395 — 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:348` 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:126-134 — before extracting anything, compare `src/Client/SharedComponents/JsBindings/DndKit.fs` and `src/Components/src/JsBindings/DndKit.fs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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:126` 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.
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:87 — src/Components/playground/App.tsx:87 · src/Components/playground/App.tsx:103 · src/Components/playground/App.tsx:117 · src/Components/playground/App.tsx:138 · +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:109 — src/Components/playground/App.tsx:109 · src/Components/playground/App.tsx:123 · src/Components/playground/App.tsx:144 · src/Components/playground/App.tsx:181 · +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/Page/GitSidebar/GitSidebar.stories.tsx (802), src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (798), src/Components/src/Page/FileExplorer/FileExplorer.stories.tsx (737), 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 — 20 finding(s)
D16 · Bus Factor · Off-boarding risk · ×3
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 43 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/DropOverlay.fs, src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs, src/Components/src/Page/ValidationPackageBrowser/Helper.fs, src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs, src/Client/Util/MessageInterop.fs (+35 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 36 significant file(s) lose their only recent owner: src/Electron/src/Renderer/Context/GitWorkflow.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/Page/ProvenanceGrouping/State.fs, src/Components/src/Page/ProvenanceGrouping/PropertyModel.fs (+28 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 16 significant file(s) lose their only recent owner: src/Electron/src/Main/IPC/FileSystemIO.fs, src/Shared/ARCtrl.Helper.fs, src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs, src/Electron/src/Main/IPC/Rename.fs, src/Components/src/ARCtrl/Extensions/CompositeCell.fs, src/Electron/src/Main/ARCtrlExtensions/LoadAsync.fs, src/Electron/src/Main/ARCtrlExtensions/InMemoryChanges.fs, src/Electron/src/Main/ArcMerge/ArcAddExtensions.fs (+8 more). Pair on, review, or document these before any departure.
D19 · Documentation Quality · Documentation · ×2
  • Documentation: contradicts the code docs/GitFunctionalityUserGuide.md — The guide describes Swate Electron's version-control interaction, but the linked repository has no Git provider configuration (lakeFS is compiled in without a configured connection) and the VersionControlRuntime catalog is stale. Update the architecture section to reflect the current provider setup and ensure the VersionControlRuntime catalog points to the latest code.
  • Documentation: contradicts the code docs/Structure.md — The 'src/Shared' project must not be Fable-compatible but the document states it is shared, Fable-compatible .NET code used by Client and Server as ground truth for shared types. Correct the Shared project description to reflect its non-Fable compatibility constraint.
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 (96 single-owned of 319 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; 319 of the 531 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/`.
D26 · Project Cohesion · Split src/Client · ×1
  • Split src/Client — At 14972 LoC the client is huge, and its 28 namespaces are spread across components like States, Util, OfficeInterop, SharedComponents, Spreadsheet, Modals, JsBindings, SidebarComponents, and a Pages building block, making it a sprawling grab-bag. Suggested: split into focused client modules (States/Util/OfficeInterop/SharedComponents/SidebarComponents/Spreadsheet/Modals/JsBindings) across the 28 namespaces
D26 · Project Cohesion · Split src/Components · ×1
  • Split src/Components — At 48615 LoC this is a massive grab-bag that is spread over 66 namespaces (Page/ProvenanceGrouping, JsBindings, Composite/Workspace, etc.) across the Components domain. Suggested: split into focused components projects covering each of the 66 namespaces
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
  • REDACTED
D30 · Dependency Vulnerabilities · Low CVE · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Low vulnerability · ×1
  • REDACTED
D31 · IaC & Container Security · Low IaC · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 11582 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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-c18c617469964ec4a03d302d675215d6/history.json --exit-code 0 --source .7artifacts/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-c18c617469964ec4a03d302d675215d6/tree.json --exit-code 0 --source .2artifacts/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 .25artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesdotnet—dotnet list Swate.sln package --vulnerable --include-transitive --format json35artifacts/raw/dotnet-vulnerable.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .11artifacts/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 39 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`, … (+34 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0artifacts/raw/trivy-fs.json

Run 01a10043-c09c-72f3-8604-4178734b86c8 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

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

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