Public report — wails, published 6 Aug 2026. Concrete security findings (CVE IDs, secret matches, dependency versions) are hidden in this version; ask the repo owner for the full report.
Watchdog 06-08-2026 @ 07:10 UTC Public
Code Health Audit

Wailsapp/wails

No baseline yet — first run
55% At Risk

Hobby · 1,741 LoC · rebuild ~0.1 person-years · weakest lens: Accessibility (44%)

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

34/36dimensions tool-verifieddeterministic · confidence 1.0 · 2 LLM-assisted, advisory
441findings with an exact file:lineof 449 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
36/95dimensions across the health lenses1741 LoC — wide & deep

Executive summary

Read through the Production lens — the standard calibration. *Green* means good enough to run in production. The score is absolute and comparable across repos.

wailsapp/wails is sound in substance but carries real gaps (55%). It is not in crisis, but the issues below raise the cost of changing it — friction its consumers ultimately inherit.

It is strongest in Architecture (100%) — the structure is clean and changes stay contained.

Most urgent: a critical security exposure was detected (see the Security & Compliance lens). Treat it as a priority regardless of the overall grade.

The area that most needs attention is Accessibility (44%) — it raises ongoing delivery and operational cost. Readiness (58%) is the next concern — releases are harder to depend on — versioning, release notes and dependency hygiene are thin, so consumers can't easily tell what changed or trust an upgrade.

Leadership focus, highest impact first: Make custom controls keyboard-operable (role + tabindex + key handler) (Keyboard semantics); accessibility in the toolchain (A11y enforcement); Give every control a programmatic label (a <label for> /… (Forms & labels).

For scale: Hobby (~1,741 production lines); rebuilding it from scratch would take roughly ~0.1 person-years (~1 engineer). Approximate, ±~30%.

It builds on a genuinely strong Architecture foundation (100%); the priorities above are the highest-leverage way to bring the rest up to that level.

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.
Accessibility 44% · 46% weightReadiness 58% · 25% weightSecurity 65% · 14% weightMaturity 69% · 8% weightCode Health 74% · 4% weightArchitecture 100% · 2% weight

Raise Accessibility 44 → 70 (the Healthy floor) ⇒ headline 55 → ~64.

Rebuild cost & value ~ Modeled — €690–€3,500
Cost to rebuild€690–€3,500 (0.1 person-years (12–37 h), ~1 engineer)
Domain complexityStandard — harder problems cost more per line
Quality factor0.8× (at 55% quality) — the last 20% of quality is most of the work
Size & shapeHobby · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

This codebase represents roughly ~0.1 person-years of build effort (about ~€2,100 to rebuild). Its weakest lens is Accessibility at 44% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.2) — CQRS × a 0.8× 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
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
+10.2 pts · Medium effort · Keyboard semantics
2
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.
+10.2 pts · Medium effort · A11y enforcement
3
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
+9.9 pts · Medium effort · Forms & labels

Diagnosis — what's actually going on

The top fix pays for itself · High · Economics
The top-ranked fix costs roughly 3–10 engineer-days once. Not doing it costs about 29.4–176.2 engineer-days every year, paid as drag on the ~320,989 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–4 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–8% 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: 79,148 line(s) changed over a 90-day window ⇒ ~320,989/year · D1/D2/D4 code quality: averaging 6.5/10 ⇒ a 4–8% drag on each change · top-ranked remediation: Medium effort ⇒ about 3–10 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 4 months.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.

Architecture — module dependency matrix

335 modules, 188 dependencies — 1 dependency cycle, shown as the red cell(s) above the diagonal. 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.)

…s/v2/internal/project…ystem/operatingsystem…ails/v2/pkg/clilogger…p/wails/v2/pkg/logger…ails/v2/pkg/menu/keys…2/pkg/options/windows…/v3/internal/defaults…ils/v3/internal/flags…rnal/generator/config…ls/v3/internal/report…/v3/internal/wake/ast…/wails/v3/pkg/updater…sapp/wails/v3/pkg/w32…ktop/windows/winc/w32…ternal/platform/win32…v2/pkg/commands/build…app/wails/v2/pkg/menu…/v3/internal/commands…nal/generator/collect…ails/v3/internal/wake…nal/webview2/pkg/edge…ls/v2/cmd/wails/flags…/internal/menumanager…/wails/v2/pkg/options…l/assetserver/webview…rnal/generator/render…pp/wails/v2/cmd/wails…md/wails/internal/dev…/v2/internal/frontend…ls/v2/pkg/assetserver…v3/internal/generator…ls/v3/pkg/application…ls/v2/internal/logger…wails/v2/internal/app…s/v2/internal/binding…/wails/v2/pkg/runtime…rnal/frontend/desktop…ntend/desktop/windows…l/frontend/dispatcher…ls/v2/pkg/application…s/v2/internal/project1…ystem/operatingsystem2…ails/v2/pkg/clilogger3…p/wails/v2/pkg/logger4…ails/v2/pkg/menu/keys5…2/pkg/options/windows6…/v3/internal/defaults7…ils/v3/internal/flags8…rnal/generator/config9…ls/v3/internal/report10…/v3/internal/wake/ast11…/wails/v3/pkg/updater12…sapp/wails/v3/pkg/w3213…ktop/windows/winc/w3214…ternal/platform/win3215…v2/pkg/commands/build16…app/wails/v2/pkg/menu17…/v3/internal/commands18…nal/generator/collect19…ails/v3/internal/wake20…nal/webview2/pkg/edge21…ls/v2/cmd/wails/flags22…/internal/menumanager23…/wails/v2/pkg/options24…l/assetserver/webview25…rnal/generator/render26…pp/wails/v2/cmd/wails27…md/wails/internal/dev28…/v2/internal/frontend29…ls/v2/pkg/assetserver30…v3/internal/generator31…ls/v3/pkg/application32…ls/v2/internal/logger33…wails/v2/internal/app34…s/v2/internal/binding35…/wails/v2/pkg/runtime36…rnal/frontend/desktop37…ntend/desktop/windows38…l/frontend/dispatcher39…ls/v2/pkg/application401124431131135111121142116212811111125616511232112122119112113212451712212323121+295 more modules (most-connected shown)

At a glance — Code Health · 74% · Strong

At a glance — Architecture · 100% · Exemplary

At a glance — Maturity · 69% · Adequate

At a glance — Readiness · 58% · Adequate

At a glance — Security · 65% · Adequate · gated by D29, D38

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
A03:2021 — Injection50High / Critical
A06:2021 — Vulnerable & Outdated Components21High / Critical
A05:2021 — Security Misconfiguration7High / Critical
A04:2021 — Insecure Design1High / Critical

Roadmap

Begin by making custom controls keyboard-operable and ensuring all anchors have valid hrefs. Next, enforce accessibility standards by integrating linting and automated testing into the CI pipeline. Then, ensure every form control and button has a proper programmatic label. After that, add text alternatives for images, SVGs, and videos. Finally, improve page structure by declaring language, title, and main landmarks, while removing meta-refresh.

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

Do thisHelpsEffortDimension
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+10.2 ptsMediumKeyboard semantics
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.+10.2 ptsMediumA11y enforcement
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+9.9 ptsMediumForms & labels
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.+9.4 ptsMediumText alternatives
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+8.9 ptsMediumPage structure
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.+8.7 ptsMediumVisual & motion safety
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).+3.8 ptsMediumDR & Backup
Stamp a version in your build/package manifest (e.g. csproj <Version>, package.json, pyproject.toml, Cargo.toml, or a VERSION file) or tag releases with semver so builds and releases are traceable.+3.8 ptsMediumRelease Hygiene

File quality

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

FileScoreBandWorst signal
v3/internal/commands/build_assets/docker/Dockerfile.server2.8SlopIaC & Container Security: High IaC: DS-0002
v3/go.mod4.1MixedOSV Dependency Vulnerabilities: Critical CVE: [GHSA redacted]
.github/workflows/build-cross-image.yml4.4MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/release-v3.yml4.4MixedStatic Analysis (SAST): High: run-shell-injection
.github/workflows/nightly-release-v3.yml4.5MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/changelog-v3.yml4.6MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/pr-master.yml4.8MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/publish-npm.yml4.8MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
v2/internal/frontend/runtime/dev/package-lock.json4.8MixedOSV Dependency Vulnerabilities: High CVE: [GHSA redacted]
v3/internal/runtime/desktop/@wailsio/runtime/package-lock.json4.8MixedOSV Dependency Vulnerabilities: High CVE: [GHSA redacted]
v2/cmd/wails/doctor.go5.0MixedData Compliance (PII/GDPR): High: watchdog-sensitive-personal-data-in-log
.github/workflows/auto-changelog-v3.yml5.1MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
v3/internal/commands/build_assets/docker/Dockerfile.cross5.1MixedIaC & Container Security: High IaC: DS-0002
v3/internal/webview2/scripts/go.mod5.1MixedOSV Dependency Vulnerabilities: High CVE: [GHSA redacted]
.github/workflows/claude.yml5.8MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/generate-sponsor-image.yml5.8MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/labeler.yml5.8MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
v2/go.mod5.9MixedOSV Dependency Vulnerabilities: Medium CVE: GO-2026-5320
v3/pkg/application/webview_window_windows.go7.0MixedCyclomatic Complexity: windowsWebviewWindow.WndProc (cyclomatic 120)
v3/internal/setupwizard/wizard.go7.0MixedCyclomatic Complexity: Wizard.pullViaDockerAPI (cyclomatic 35)

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. 34 of 36 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 2 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.7 — 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 — 36 dimensions across the health lenses
D1D2D3D4D13D15D16D19D21D28D29D31D32D33D34D35D36D37D38AC1AC2AC3AC4AC5AC6AC7AX5M1M2M3M4P1P3P4P5P6

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, 441 of 449 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
jscpdCode duplication✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.302✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.302✓ 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 019fd5e8-c85f-7121-8d39-c6d8afd1f4bb.

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.

  • D30 Dependency Vulnerabilities — scanner not present in this environment — The backing tool was not installed where this scan ran, so this dimension was not scored. Install the tool (or run in the hosted environment, where it is always present) for a graded result.

Repo exclusion declarations: 14 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

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 (jscpd) — 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.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • 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.
  • 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.
  • 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").
  • 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.
  • D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
  • D33 JS/npm Dependency Vulnerabilities: JS/npm CVE matching reads package manifests and lockfiles — risk from how a dependency is used, and advisories not yet published, fall outside this scan.
  • 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.
  • 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 clean result is "no unlabelled native 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.
  • 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.
  • 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".
  • P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score (documentation, ADR quality, naming, comment value, onboarding) — D25 sets the ADR-conformance fraction over sampled code, D22 judges API accuracy over a sample. These 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.8 / 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: DocumentedVerifiedPrevented · effective 5.8 / 10 · rule-coverage 100% · ceiling Prevented

141 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was windowsWebviewWindow.WndProc at 120. A further 8 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 win32.WMMessageToString at 200 — they are counted neither in the figure above nor in this dimension's score.

DialogConfig.apply (cyclomatic 22) · ×2v2/internal/go-common-file-dialog/cfd/DialogConfig.go:63
Provider.Download (cyclomatic 17) · ×2v3/pkg/updater/providers/appcast/appcast.go:151
windowsWebviewWindow.WndProc (cyclomatic 120)v3/pkg/application/webview_window_windows.go:1595
w32.MenuBarWndProc (cyclomatic 95)v3/pkg/w32/menubar.go:270
MessageProcessor.processWindowMethod (cyclomatic 78)v3/pkg/application/messageprocessor_window.go:123

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

What to do

  1. Resolve the 2 DialogConfig.apply (cyclomatic 22) finding(s) in Cyclomatic Complexity — start with DialogConfig.go (2). — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 2 Provider.Download (cyclomatic 17) finding(s) in Cyclomatic Complexity — start with appcast.go, github.go. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 windowsWebviewWindow.WndProc (cyclomatic 120) finding(s) in Cyclomatic Complexity — start with webview_window_windows.go. — One of this dimension's main actionable groups (1 warning-level).
  4. 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.6 / 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: DocumentedVerifiedPrevented · effective 4.6 / 10 · rule-coverage 100% · ceiling Prevented

214 method(s) exceeded the cognitive complexity threshold of 15; the worst was windowsWebviewWindow.WndProc at 212.

packagemanager.Dependencies (cognitive 23) · ×3v2/internal/system/packagemanager/packagemanager.go:62
DialogConfig.apply (cognitive 39) · ×2v2/internal/go-common-file-dialog/cfd/DialogConfig.go:63
Provider.Download (cognitive 23) · ×2v3/pkg/updater/providers/appcast/appcast.go:151
Nixpkgs.PackageInstalled (cognitive 16) · ×2v3/internal/doctor/packagemanager/nixpkgs.go:75
windowsWebviewWindow.WndProc (cognitive 212)v3/pkg/application/webview_window_windows.go:1595

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

What to do

  1. Resolve the 3 packagemanager.Dependencies (cognitive 23) finding(s) in Cognitive Complexity — start with packagemanager.go (3). — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 2 DialogConfig.apply (cognitive 39) finding(s) in Cognitive Complexity — start with DialogConfig.go (2). — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 Provider.Download (cognitive 23) finding(s) in Cognitive Complexity — start with appcast.go, github.go. — One of this dimension's main actionable groups (2 warning-level).
  4. 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 Classes10.0 / 10Exemplary✓ 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: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 god class(es) detected.

✓ On the Gold path — maintain.

Detailed fixes: d3_recommendation.md.

D4 · Code Duplication9.2 / 10Exemplary✓ 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: DocumentedVerifiedPrevented · effective 9.2 / 10 · rule-coverage 100% · ceiling Verified

6 duplicated block group(s) detected.

Duplicated block (5 lines × 2) · ×2tools/sponsorkit/render.go:297
Duplicated block (14 lines × 2)tools/sponsorkit/render.go:257
Duplicated block (12 lines × 2)tools/sponsorkit/contributors.go:275
Duplicated block (8 lines × 2)tools/sponsorkit/contributors.go:290
Duplicated block (7 lines × 2)tools/sponsorkit/render.go:76

✓ On the Gold path — maintain.

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

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

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

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

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: webview2/pkg/edge/chromium.go (4×18=72)

Hotspot: webview2/pkg/edge/chromium.gowebview2/pkg/edge/chromium.go

✓ On the Gold path — maintain.

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

D16 · Bus Factor4.6 / 10Weak✓ 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: DocumentedVerifiedPrevented · effective 4.6 / 10 · rule-coverage 100% · ceiling Documented

4 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is tools/sponsorkit/render.go.

Off-boarding risk: anonymized user #1

What to do

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

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

D19 · Documentation Quality / 10Strong◐ 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: DocumentedVerifiedPrevented · effective Strong / 10 · rule-coverage 100% · ceiling Documented

The Wails v3 documentation is clear and complete for a major framework project. It starts with an impressive branding banner (logo + GitHub license badges) and a strong README that links to Chinese, Japanese, Korean, and the full English docs. The architecture section is exemplary: it names every outlineable document (Wails v3 Documentation; Prerequisites; Use install script; 📚 Documentation Redesign; 🚀 Project Structure; 🧞 Commands; 👀 Want to learn more?), covers a real-world build-system example, and explains the deliberate emptiness of plan.json with rationale. The community templates page is also thorough for its scope (Vue, Quasar, Nuxt, Naive UI, HTMX, vanilla JS, Lit). Wails documentation is comprehensive and well-structured across READMEs, blog posts, and a dedicated community templates guide. The project maintains a consistent release cadence with detailed beta notes, an evolving roadmap, and a growing template ecosystem for Go web apps (Vue, Quasar, React, Angular, Svelte, Solid, Elm, HTMX, vanilla JS). There is no single missing section across the visible content; each document's outline confirms present sections. The templates guide is particularly strong given its size. Community templates and links documentation is strong for a Wails project: the community/links.md pages provide curated lists of awesome-wails, Discord servers, GitHub issues, Twitter/X, QQ communities, and Q&A guides for submitting templates (with clear edit/edit-this-page instructions). The main templates doc (community/templates.md) is well-structured with versioned template init commands, a dedicated caution about third-party model maintenance, and an exhaustive list of every supported framework/template combination (Vue/Quasar/Vue3/Nuxt/Naive/Svelte/Solid/HTMX/JS Vanilla/Lit). The only visible gap is the absence of an Angular section in the clipped Vue/React portion; all outlined sections exist.

What to do

  1. Improve Documentation Quality — currently 8.4/10. — The Wails v3 documentation is clear and complete for a major framework project. It starts with an impressive branding banner (logo + GitHub license badges) and a strong README that links to Chinese, Japanese, Korean, and the full English docs. The architecture section is exemplary: it names every outlineable document (Wails v3 Documentation; Prerequisites; Use install script; 📚 Documentation Redesign; 🚀 Project Structure; 🧞 Commands; 👀 Want to learn more?), covers a real-world build-system example, and explains the deliberate emptiness of plan.json with rationale. The community templates page is also thorough for its scope (Vue, Quasar, Nuxt, Naive UI, HTMX, vanilla JS, Lit). Wails documentation is comprehensive and well-structured across READMEs, blog posts, and a dedicated community templates guide. The project maintains a consistent release cadence with detailed beta notes, an evolving roadmap, and a growing template ecosystem for Go web apps (Vue, Quasar, React, Angular, Svelte, Solid, Elm, HTMX, vanilla JS). There is no single missing section across the visible content; each document's outline confirms present sections. The templates guide is particularly strong given its size. Community templates and links documentation is strong for a Wails project: the community/links.md pages provide curated lists of awesome-wails, Discord servers, GitHub issues, Twitter/X, QQ communities, and Q&A guides for submitting templates (with clear edit/edit-this-page instructions). The main templates doc (community/templates.md) is well-structured with versioned template init commands, a dedicated caution about third-party model maintenance, and an exhaustive list of every supported framework/template combination (Vue/Quasar/Vue3/Nuxt/Naive/Svelte/Solid/HTMX/JS Vanilla/Lit). The only visible gap is the absence of an Angular section in the clipped Vue/React portion; all outlined sections exist.

Detailed fixes: d19_recommendation.md.

D21 · Naming Consistency / 10Exemplary◐ 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: DocumentedVerifiedPrevented · 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.

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

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

Method: Git-history secret scan via gitleaks detect over full history in an isolated checkout; each match flagged High. Exhaustive; degrades cleanly when tool absent.

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)0.0 / 10Critical✓ Tool-verified

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

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

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

Maturity: DocumentedVerifiedPrevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

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

High: github-actions-mutable-action-tag · ×50.github/workflows/auto-changelog-v3.yml:28detected by semgrep finding

What to do

  1. Resolve the 50 High finding(s) in Static Analysis (SAST) — start with build-cross-image.yml (12), release-v3.yml (10), nightly-release-v3.yml (6). — One of this dimension's main actionable groups (50 issue-level).

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

D31 · IaC & Container Security8.9 / 10Strong✓ 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: DocumentedVerifiedPrevented · effective 8.9 / 10 · rule-coverage 100% · ceiling Documented

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

High IaC: DS-0002 · ×2v3/internal/commands/build_assets/docker/Dockerfile.crossdetected by trivy finding
Medium IaC: DS-0001 · ×4v3/internal/commands/build_assets/docker/Dockerfile.serverdetected by trivy finding
Low IaC: DS-0026v3/internal/commands/build_assets/docker/Dockerfile.serverdetected by trivy finding

What to do

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

D32 · Data Compliance (PII/GDPR)7.1 / 10Strong✓ Tool-verified

What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.

Method: Heuristic PII/GDPR pattern scan via semgrep across the repo, using Watchdog's own ruleset (personal data reaching log/console sinks, URLs and query strings, or unprotected browser storage); matches map to severity and a 0-10 wide normalizer. NotApplicable when the scan runs and detects no PII/GDPR surface (no unearned 10); reported LOUDLY as a measurement gap, never as not-applicable, if the ruleset is missing from the analyzer image. Exhaustive, advisory-leaning; degrades on parse failure.

Maturity: DocumentedVerifiedPrevented · effective 7.1 / 10 · rule-coverage 100% · ceiling Documented

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

High: watchdog-sensitive-personal-data-in-logv2/cmd/wails/doctor.go:237detected by semgrep finding

What to do

  1. Resolve the 1 High finding(s) in Data Compliance (PII/GDPR) — start with doctor.go. — One of this dimension's main actionable groups (1 issue-level).

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

D33 · JS/npm Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether JavaScript/npm dependencies have known published vulnerabilities (CVEs) — the npm ecosystem's biggest risk.

Method: JS/npm CVE scan via trivy fs --scanners vuln over JS manifests (package.json/yarn.lock/pnpm-lock/bun.lockb); 0-10 tight normalizer. NotApplicable without JS manifests. Exhaustive, deterministic.

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No known-vulnerable JS/npm dependencies.

✓ On the Gold path — maintain.

Detailed fixes: d33_recommendation.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: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Every significant source file has living knowledge — recently and meaningfully worked.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

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

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

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

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling; coupling through a build step, config, or non-source file isn't seen.

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D36 · Supply-chain Provenance & 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: DocumentedVerifiedPrevented · effective 5.0 / 10 · rule-coverage 100% · ceiling Documented

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

Unpinned build actions
PR-triggered workflow without a permissions block
No SBOM

What to do

  1. Resolve the 1 Unpinned build actions finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 PR-triggered workflow without a permissions block finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 No SBOM finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

D38 · OSV Dependency Vulnerabilities0.6 / 10Critical✓ Tool-verified

What it measures: Whether dependencies have known published vulnerabilities (CVEs) per the OSV database — read natively from whatever lockfile the repository ships (Cargo, npm, Go, Python, Maven, RubyGems, …). D33 and D30 add ecosystem-specific scanners on top for npm and .NET.

Method: Multi-ecosystem dependency-CVE scan via osv-scanner --recursive (queries the osv.dev database + parses lockfiles natively across ecosystems: npm package-lock/yarn/pnpm/bun, Go go.mod, Rust Cargo.lock, Maven/Gradle pom.xml/gradle.lockfile, PyPI requirements.txt/poetry.lock/Pipfile.lock, Composer composer.lock, RubyGems Gemfile.lock, Hex mix.lock, pub pubspec.lock, Swift Package.resolved); severity tally (Critical/High/Medium/Low) to 0-10 tight normalizer (8.0). NotApplicable only when the repo declares no supported non-.NET dependency lockfile (a NuGet-only repo stays NotApplicable — .NET CVEs are D30's domain); coverage needs a resolved lockfile. Additive to D33 (trivy fs); exhaustive + deterministic, DB kept fresh.

Maturity: DocumentedVerifiedPrevented · effective 0.6 / 10 · rule-coverage 100% · ceiling Documented

21 finding(s): 1 critical, 10 high, 10 medium, 0 low.

High CVE: [GHSA redacted] · ×9v2/internal/frontend/runtime/dev/package-lock.jsondetected by osv-scanner finding
Critical CVE: [GHSA redacted]v3/go.moddetected by osv-scanner finding
High vulnerability: [GHSA redacted]v2/internal/frontend/runtime/package-lock.jsondetected by osv-scanner finding
Medium CVE: GO-2026-5320 · ×8v3/go.moddetected by osv-scanner finding
Medium vulnerability: GO-2026-5841 · ×2v3/go.moddetected by osv-scanner finding

What to do

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

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

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives6.3 / 10Adequate✓ 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.

  • 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) — defaultindex.html:34, index.html:73

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 & labels5.0 / 10Adequate✓ 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, 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.

  • This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×9) — app.tsx:22, app.jsx:22, App.tsx:21, …
  • This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×10) — App.svelte:7, App.svelte:7, HelloWorld.vue:5, …
  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. (×6) — InitFlow.tsx:171, InitFlow.tsx:275, SigningStep.tsx:288, …

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 structure7.2 / 10Strong✓ 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.

  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×5) — defaultindex.html:2, index.tmpl.html:2, index.tmpl.html:2, …
  • The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×2) — index.tmpl.html:2, index.tmpl.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.0 / 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 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.

  • 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. (×11) — index.html:17, index.html:20, index.html:46, …

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.

AC6 · Visual & motion safety7.5 / 10Strong✓ Tool-verified

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.

  • `.error-icon` sets color: white on background-color: #EF4444 — 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×2) — index.en.html:7, index.zh.html:7
  • This element's Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade. — App.tsx:1092
  • outline:none/0 with no :focus rule in the same stylesheet removes the focus ring. Provide a visible :focus / :focus-visible style. — index.html:6

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
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.

  • 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 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.
AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

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

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

M1 · Documentation (README)7.2 / 10Strong✓ 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 '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 56 of 78 project(s) that lack one — worth up to 1.4 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 `NNNN-title.md` documents 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 `NNNN-title.md` names is the most discoverable form).
M3 · Folder & project structure8.0 / 10Strong✓ 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.

  • Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.

What to do

  • Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
M4 · Documentation accuracy8.5 / 10Strong◐ 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.

  • README claims v2 and v3 versions of Wails exist with separate install commands; v3 has no corresponding package.json or directory in evidence

What to do

  • Reconcile the README with reality: README claims v2 and v3 versions of Wails exist with separate install commands; v3 has no corresponding package.json or directory in evidence.
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.

P3 · Security & performance tooling5.0 / 10Adequate✓ Tool-verified

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

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

What to do

  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ 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.

P5 · DR & Backup4.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.

Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.

What to do

  • Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
  • Enable purge protection / soft-delete (and prevent_destroy on critical resources) so data stores can't be lost to an accidental or malicious delete.
P6 · Release Hygiene5.0 / 10Adequate✓ 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.

What to do

  • Stamp a version in your build/package manifest (e.g. csproj <Version>, package.json, pyproject.toml, Cargo.toml, or a VERSION file) or tag releases with semver so builds and releases are traceable.

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 Health74%StrongSolid.
Architecture100%ExemplaryStrongest area.
Maturity69%AdequateAcceptable, with room to improve.
Readiness58%AdequateAcceptable, with room to improve.
Security65%Adequate — gated by D29, D38Capped 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 included — 59 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 — no DI registrations detected
  • AX10 Code composition — not assessed — code composition is computed by ROLE over a document set 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 — no singleton implementations detected
  • AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
  • AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • 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.
  • D10 Test Quality — ~0 lines of test source are present (.js) but the test-quality collector reads C# only, so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included
  • D12 Dependency Hygiene — Dependency hygiene not measured — dependency manifest found but not parsed for hygiene
  • D14 License Compliance — Not scored — this repository's package manifest is not parsed for licence data yet. A gap in the analyzer's language coverage, NOT a finding that the repository's licenses are compliant (a Go module (go.mod/go.sum) and package.json), which this pass does not parse yet — so this dimension asserts nothing about this repository's licensing in either direction.
  • D17 Explicit Debt — explicit-debt markers are read through a C# workspace today, so they were not read for this repository's language — this asserts nothing about how many markers the code carries. Not scored — this is a gap in the analyzer, not a finding about this repository
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D22 Internal API Consistency — No exposed public API
  • D23 Boundary Type-Coupling — Production source is present (.go, .ts) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — No inline comments to assess — comment value is not applicable here.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
  • D27 Navigability — No calls could be sampled, so navigability was not assessed — tracing effort is measured over resolved call sites and this target exposed none. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
  • D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Go module (go.mod/go.sum) and package.json — not scanned yet) — where an OSV-supported manifest exists, dependency vulnerabilities for this repository are reported under D38 instead.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
  • D6 Cohesion (LCOM4) — Cohesion (LCOM4) is measured over a C#/VB class graph, and this repository's production source is mostly .go, .ts, which this pass does not read, so cohesion was not assessed for this repository. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • D9 Test Distribution — Test source is present (.js) but the test-pyramid classifier reads C# only, so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • DM1 Domain Modelling — applicable but not scored (2 of 2 signals for this style — below the bar we score at): 15 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 5 value object(s)
  • ED1 Event-Driven — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 1 CQRS handler(s); 20 event-sourced shape(s) (event folds / event-recording aggregates)
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 1 aggregate(s) with Apply/When folds; 19 Go aggregate(s) recording domain events (own events-slice append / raise-record)
  • GD1 Unfinished & placeholder code — no source files
  • 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, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
  • P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
  • P8 Schema migrations — not assessed — schema-migration practice is read from a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`go test -coverprofile=coverage.out ./...`) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • S1 Web-Security Posture — Not assessed: these web-security 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 web-security 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.
  • 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
  • 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
  • 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
  • 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

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.

Issue — 64 finding(s)
D29 · Static Analysis (SAST) · High · ×50
  • High: github-actions-mutable-action-tag .github/workflows/auto-changelog-v3.yml:28 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
  • High: run-shell-injection .github/workflows/auto-changelog-v3.yml:36 — Using variable interpolation `${{...}}` with `github` context data in a `run:` step could allow an attacker to inject their own code into the runner. This would allow them to steal secrets and code. `github` context data can have arbitrary user input and should be treated as untrusted. Instead, use an intermediate environment variable with `env:` to store the data and use the environment variable in the `run:` script. Reference it as a shell VARIABLE rather than a `${{ }}` interpolation, using your shell's own syntax (`"$ENVVAR"` in bash, `$env:ENVVAR` in PowerShell), so the value is passed as data and never re-expanded as code.
  • High: github-actions-mutable-action-tag .github/workflows/auto-changelog-v3.yml:64 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-go@<40-character SHA>`. This step references `actions/setup-go@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-go/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:53 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:58 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/setup-qemu-action@<40-character SHA>`. This step references `docker/setup-qemu-action@v3`; resolve the SHA it points at today with `gh api repos/docker/setup-qemu-action/commits/v3 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:61 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/setup-buildx-action@<40-character SHA>`. This step references `docker/setup-buildx-action@v3`; resolve the SHA it points at today with `gh api repos/docker/setup-buildx-action/commits/v3 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:64 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/login-action@<40-character SHA>`. This step references `docker/login-action@v3`; resolve the SHA it points at today with `gh api repos/docker/login-action/commits/v3 --jq .sha`.
  • High: run-shell-injection .github/workflows/build-cross-image.yml:72 — Using variable interpolation `${{...}}` with a workflow input in a `run:` step could allow an attacker to inject their own code into the runner. This would allow them to steal secrets and code. A workflow input is not bounded by this step and should be treated as untrusted. Instead, use an intermediate environment variable with `env:` to store the data and use the environment variable in the `run:` script. Reference it as a shell VARIABLE rather than a `${{ }}` interpolation, using your shell's own syntax (`"$ENVVAR"` in bash, `$env:ENVVAR` in PowerShell), so the value is passed as data and never re-expanded as code.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:79 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/metadata-action@<40-character SHA>`. This step references `docker/metadata-action@v5`; resolve the SHA it points at today with `gh api repos/docker/metadata-action/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:88 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/build-push-action@<40-character SHA>`. This step references `docker/build-push-action@v5`; resolve the SHA it points at today with `gh api repos/docker/build-push-action/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:148 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:153 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-go@<40-character SHA>`. This step references `actions/setup-go@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-go/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:159 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-node@<40-character SHA>`. This step references `actions/setup-node@v4`; resolve the SHA it points at today with `gh api repos/actions/setup-node/commits/v4 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:175 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/setup-qemu-action@<40-character SHA>`. This step references `docker/setup-qemu-action@v3`; resolve the SHA it points at today with `gh api repos/docker/setup-qemu-action/commits/v3 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-cross-image.yml:178 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: docker/login-action@<40-character SHA>`. This step references `docker/login-action@v3`; resolve the SHA it points at today with `gh api repos/docker/login-action/commits/v3 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/changelog-v3.yml:28 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/changelog-v3.yml:44 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-go@<40-character SHA>`. This step references `actions/setup-go@v4`; resolve the SHA it points at today with `gh api repos/actions/setup-go/commits/v4 --jq .sha`.
  • High: run-shell-injection .github/workflows/changelog-v3.yml:50 — Using variable interpolation `${{...}}` with `github` context data in a `run:` step could allow an attacker to inject their own code into the runner. This would allow them to steal secrets and code. `github` context data can have arbitrary user input and should be treated as untrusted. Instead, use an intermediate environment variable with `env:` to store the data and use the environment variable in the `run:` script. Reference it as a shell VARIABLE rather than a `${{ }}` interpolation, using your shell's own syntax (`"$ENVVAR"` in bash, `$env:ENVVAR` in PowerShell), so the value is passed as data and never re-expanded as code.
  • High: run-shell-injection .github/workflows/changelog-v3.yml:99 — Using variable interpolation `${{...}}` with `github` context data in a `run:` step could allow an attacker to inject their own code into the runner. This would allow them to steal secrets and code. `github` context data can have arbitrary user input and should be treated as untrusted. Instead, use an intermediate environment variable with `env:` to store the data and use the environment variable in the `run:` script. Reference it as a shell VARIABLE rather than a `${{ }}` interpolation, using your shell's own syntax (`"$ENVVAR"` in bash, `$env:ENVVAR` in PowerShell), so the value is passed as data and never re-expanded as code.
  • High: github-actions-mutable-action-tag .github/workflows/changelog-v3.yml:168 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/github-script@<40-character SHA>`. This step references `actions/github-script@v7`; resolve the SHA it points at today with `gh api repos/actions/github-script/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/claude.yml:29 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/claude.yml:35 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: anthropics/claude-code-action@<40-character SHA>`. This step references `anthropics/claude-code-action@v1`; resolve the SHA it points at today with `gh api repos/anthropics/claude-code-action/commits/v1 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/generate-sponsor-image.yml:16 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/generate-sponsor-image.yml:23 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-go@<40-character SHA>`. This step references `actions/setup-go@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-go/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/labeler.yml:17 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: github/issue-labeler@<40-character SHA>`. This step references `github/issue-labeler@v3.4`; resolve the SHA it points at today with `gh api repos/github/issue-labeler/commits/v3.4 --jq .sha`.
  • + 25 more in this group — see findings.md.
D38 · OSV Dependency Vulnerabilities · High CVE · ×9
  • High CVE: [GHSA redacted] v2/internal/frontend/runtime/dev/package-lock.json — brace-expansion 1.1.11: [GHSA redacted] — brace-expansion is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin brace-expansion to 1.1.16 with an `overrides` entry (`pnpm.overrides` for pnpm)). This is 1 of 5 advisories with a published fix this scan raises against brace-expansion 1.1.11, and their fixed versions do not agree — anything below 1.1.18 still leaves at least one of them open. Take this package to 1.1.18 or later: that is the floor for the package, not this row's target alone. (in 2 dependency files: v2/internal/frontend/runtime/dev/package-lock.json, v2/internal/frontend/runtime/package-lock.json) This one row stands for the 5 advisories this scan raises against brace-expansion 1.1.11: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
  • High CVE: [GHSA redacted] v3/internal/runtime/desktop/@wailsio/runtime/package-lock.json — brace-expansion 2.1.0: [GHSA redacted] — brace-expansion is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin brace-expansion to 2.1.2 with an `overrides` entry (`pnpm.overrides` for pnpm)). This is 1 of 3 advisories with a published fix this scan raises against brace-expansion 2.1.0, and their fixed versions do not agree — anything below 2.1.4 still leaves at least one of them open. Take this package to 2.1.4 or later: that is the floor for the package, not this row's target alone. This one row stands for the 3 advisories this scan raises against brace-expansion 2.1.0: [GHSA redacted], [GHSA redacted], [GHSA redacted].
  • High CVE: [GHSA redacted] v3/internal/runtime/desktop/@wailsio/runtime/package-lock.json — brace-expansion 5.0.6: [GHSA redacted] — brace-expansion is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin brace-expansion to 5.0.7 with an `overrides` entry (`pnpm.overrides` for pnpm)). This is 1 of 3 advisories with a published fix this scan raises against brace-expansion 5.0.6, and their fixed versions do not agree — anything below 5.0.9 still leaves at least one of them open. Take this package to 5.0.9 or later: that is the floor for the package, not this row's target alone. This one row stands for the 3 advisories this scan raises against brace-expansion 5.0.6: [GHSA redacted], [GHSA redacted], [GHSA redacted].
  • High CVE: [GHSA redacted] v2/internal/frontend/runtime/dev/package-lock.json — cross-spawn 6.0.5: [GHSA redacted] — cross-spawn is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin cross-spawn to 6.0.6 with an `overrides` entry (`pnpm.overrides` for pnpm)). (in 2 dependency files: v2/internal/frontend/runtime/dev/package-lock.json, v2/internal/frontend/runtime/package-lock.json)
  • High CVE: [GHSA redacted] v3/internal/webview2/scripts/go.mod — golang.org/x/net 0.0.0-20211030010937-7b24c0a3601d: [GHSA redacted] — golang.org/x/net is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v3/internal/webview2/scripts get golang.org/x/net@v0.17.0`, which updates the require line v3/internal/webview2/scripts/go.mod already holds for it). This one row stands for the 21 advisories this scan raises against golang.org/x/net 0.0.0-20211030010937-7b24c0a3601d: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], GO-2022-0288, GO-2024-3333, GO-2026-4440, GO-2026-4441, GO-2026-4918, GO-2026-5025, GO-2026-5026, GO-2026-5027, GO-2026-5029, GO-2026-5030, GO-2026-5942.
  • High CVE: [GHSA redacted] v3/internal/runtime/desktop/@wailsio/runtime/package-lock.json — js-yaml 4.2.0: [GHSA redacted] — js-yaml is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin js-yaml to 4.3.0 with an `overrides` entry (`pnpm.overrides` for pnpm)).
  • High CVE: [GHSA redacted] v3/internal/runtime/desktop/@wailsio/runtime/package-lock.json — linkify-it 5.0.1: [GHSA redacted] — linkify-it is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin linkify-it to 5.0.2 with an `overrides` entry (`pnpm.overrides` for pnpm)).
  • High CVE: [GHSA redacted] v2/internal/frontend/runtime/dev/package-lock.json — semver 5.7.1: [GHSA redacted] — semver is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin semver to 5.7.2 with an `overrides` entry (`pnpm.overrides` for pnpm)).
  • High CVE: [GHSA redacted] v2/internal/frontend/runtime/dev/package-lock.json — shell-quote 1.8.4: [GHSA redacted] — shell-quote is not declared in this repo's manifests: it is pulled in transitively, so upgrade the dependency that requires it (or pin shell-quote to 1.9.0 with an `overrides` entry (`pnpm.overrides` for pnpm)). (in 2 dependency files: v2/internal/frontend/runtime/dev/package-lock.json, v2/internal/frontend/runtime/package-lock.json)
D31 · IaC & Container Security · High IaC · ×2
  • High IaC: DS-0002 v3/internal/commands/build_assets/docker/Dockerfile.cross — Image user should not be 'root' A container that starts as root runs your process with root's capabilities inside the namespace, so a compromise of the process starts from there. The step: create an unprivileged account in the image (`RUN adduser --system --no-create-home app`), give it ownership of the paths the process writes at runtime (`COPY --chown=` on those layers, or a `RUN chown -R`), and end the final stage with `USER app` so it is the default at start. Build stages that only compile can stay root; it is the stage that RUNS that needs the account. If the process genuinely requires root — it manages the container runtime, ptraces another process or opens raw devices — say so here rather than making a change that breaks it.
  • High IaC: DS-0002 v3/internal/commands/build_assets/docker/Dockerfile.server — Image user should not be 'root' A container that starts as root runs your process with root's capabilities inside the namespace, so a compromise of the process starts from there. The step: create an unprivileged account in the image (`RUN adduser -S -D app`), give it ownership of the paths the process writes at runtime (`COPY --chown=` on those layers, or a `RUN chown -R`), and end the final stage with `USER app` so it is the default at start. Build stages that only compile can stay root; it is the stage that RUNS that needs the account. If the process genuinely requires root — it manages the container runtime, ptraces another process or opens raw devices — say so here rather than making a change that breaks it.
D32 · Data Compliance (PII/GDPR) · High · ×1
  • High: watchdog-sensitive-personal-data-in-log v2/cmd/wails/doctor.go:237 — Special-category or directly-identifying personal data appears to be written to a log or console sink. Logs are copied, shipped to third parties and retained far longer than the data itself is lawfully needed. Log a stable pseudonymous reference instead of the value.
D38 · OSV Dependency Vulnerabilities · Critical CVE · ×1
  • Critical CVE: [GHSA redacted] v3/go.mod — golang.org/x/crypto 0.51.0: [GHSA redacted] — golang.org/x/crypto is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v3 get golang.org/x/crypto@v0.52.0`, which updates the require line v3/go.mod already holds for it). This one row stands for the 14 advisories this scan raises against golang.org/x/crypto 0.51.0: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], GO-2026-5932.
D38 · OSV Dependency Vulnerabilities · High vulnerability · ×1
  • High vulnerability: [GHSA redacted] v2/internal/frontend/runtime/package-lock.json — postcss 8.5.15: [GHSA redacted] — postcss is not declared by the manifests that govern this lockfile: it is pulled in transitively here (the ^8.4.47 this repo declares for it belongs to a separate install root and does not reach this one), so upgrade the dependency that requires it (or pin postcss to 8.5.18 with an `overrides` entry (`pnpm.overrides` for pnpm)). This is 1 of 2 advisories with a published fix this scan raises against postcss 8.5.15, and their fixed versions do not agree — anything below 8.5.23 still leaves at least one of them open. Take this package to 8.5.23 or later: that is the floor for the package, not this row's target alone. (in 3 dependency files: v2/internal/frontend/runtime/package-lock.json, v3/internal/runtime/desktop/@wailsio/runtime/package-lock.json, v3/internal/setupwizard/frontend/package-lock.json) This one row stands for the 2 advisories this scan raises against postcss 8.5.15: [GHSA redacted], [GHSA redacted].
Warning — 378 finding(s)
D38 · OSV Dependency Vulnerabilities · Medium CVE · ×8
  • Medium CVE: GO-2026-5320 v3/go.mod — github.com/yuin/goldmark 1.7.16 (github.com/yuin/goldmark/renderer/html): GO-2026-5320 — github.com/yuin/goldmark is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v3 get github.com/yuin/goldmark@v1.7.17`, which updates the require line v3/go.mod already holds for it).
  • Medium CVE: GO-2026-5320 v2/go.mod — github.com/yuin/goldmark 1.7.4 (github.com/yuin/goldmark/renderer/html): GO-2026-5320 — github.com/yuin/goldmark is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v2 get github.com/yuin/goldmark@v1.7.17`, which updates the require line v2/go.mod already holds for it).
  • Medium CVE: GO-2026-4961 v2/go.mod — golang.org/x/image 0.41.0 (golang.org/x/image/webp): GO-2026-4961 — golang.org/x/image is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v2 get golang.org/x/image@v0.42.0`, which updates the require line v2/go.mod already holds for it). (in 2 dependency files: v2/go.mod, v3/go.mod) This one row stands for the 4 advisories this scan raises against golang.org/x/image 0.41.0: GO-2026-4961, GO-2026-5061, GO-2026-5062, GO-2026-5066.
  • Medium CVE: GO-2026-5942 v2/go.mod — golang.org/x/net 0.55.0 (golang.org/x/net/dns/dnsmessage): GO-2026-5942 — upgrade to 0.56.0 (in 2 dependency files: v2/go.mod, v3/go.mod)
  • Medium CVE: GO-2026-5970 v2/go.mod — golang.org/x/text 0.37.0 (golang.org/x/text/unicode/norm): GO-2026-5970 — golang.org/x/text is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v2 get golang.org/x/text@v0.39.0`, which updates the require line v2/go.mod already holds for it). (in 2 dependency files: v2/go.mod, v3/go.mod)
  • Medium CVE: GO-2026-4601 v3/internal/webview2/scripts/go.mod — stdlib 1.20.99 (net/url): GO-2026-4601 — fixed in Go 1.25.8; pin a build toolchain at or above it (go.mod `toolchain` directive, or your CI's Go version) — the `go` directive is a minimum language version, not the compiler that builds your binaries. This one row stands for the 22 advisories this scan raises against stdlib 1.20.99: GO-2026-4601, GO-2026-4602, GO-2026-4603, GO-2026-4864, GO-2026-4865, GO-2026-4869, GO-2026-4870, GO-2026-4918, GO-2026-4946, GO-2026-4947, GO-2026-4970, GO-2026-4971, GO-2026-4976, GO-2026-4977, GO-2026-4980, GO-2026-4981, GO-2026-4982, GO-2026-4986, GO-2026-5037, GO-2026-5038, GO-2026-5039, GO-2026-5856.
  • Medium CVE: GO-2026-4601 v3/tasks/events/go.mod — stdlib 1.24.99 (net/url): GO-2026-4601 — fixed in Go 1.25.8; pin a build toolchain at or above it (go.mod `toolchain` directive, or your CI's Go version) — the `go` directive is a minimum language version, not the compiler that builds your binaries. This one row stands for the 22 advisories this scan raises against stdlib 1.24.99: GO-2026-4601, GO-2026-4602, GO-2026-4603, GO-2026-4864, GO-2026-4865, GO-2026-4869, GO-2026-4870, GO-2026-4918, GO-2026-4946, GO-2026-4947, GO-2026-4970, GO-2026-4971, GO-2026-4976, GO-2026-4977, GO-2026-4980, GO-2026-4981, GO-2026-4982, GO-2026-4986, GO-2026-5037, GO-2026-5038, GO-2026-5039, GO-2026-5856.
  • Medium CVE: GO-2025-3955 tools/sponsorkit/go.mod — stdlib 1.25.0 (net/http): GO-2025-3955 — fixed in Go 1.25.1; pin a build toolchain at or above it (go.mod `toolchain` directive, or your CI's Go version) — the `go` directive is a minimum language version, not the compiler that builds your binaries. (in 3 dependency files: tools/sponsorkit/go.mod, v2/go.mod, v3/go.mod) This one row stands for the 39 advisories this scan raises against stdlib 1.25.0: GO-2025-3955, GO-2025-4006, GO-2025-4007, GO-2025-4008, GO-2025-4009, GO-2025-4010, GO-2025-4011, GO-2025-4012, GO-2025-4013, GO-2025-4014, GO-2025-4015, GO-2025-4155, GO-2025-4175, GO-2026-4337, GO-2026-4340, GO-2026-4341, GO-2026-4342, GO-2026-4601, GO-2026-4602, GO-2026-4603, GO-2026-4864, GO-2026-4865, GO-2026-4869, GO-2026-4870, GO-2026-4918, GO-2026-4946, GO-2026-4947, GO-2026-4970, GO-2026-4971, GO-2026-4976, GO-2026-4977, GO-2026-4980, GO-2026-4981, GO-2026-4982, GO-2026-4986, GO-2026-5037, GO-2026-5038, GO-2026-5039, GO-2026-5856.
D31 · IaC & Container Security · Medium IaC · ×4
  • Medium IaC: DS-0001 v3/internal/commands/build_assets/docker/Dockerfile.server — ':latest' tag used A `:latest` base pins nothing: the stage rebuilds against whatever that tag points at on the day, so the same commit produces different images and a change you did not make arrives without a diff. The step: pin the base to a concrete release and, where the registry offers one, its digest — `FROM alpine:3.21@sha256:…` — then bump it deliberately, which is a review a bot can raise. A build stage that only compiles is worth pinning for the same reason: it decides what ends up in the layers you ship.
  • Medium IaC: CKV_DOCKER_3 v3/internal/commands/build_assets/docker/Dockerfile.cross:1 — Ensure that a user for the container has been created
  • Medium IaC: CKV_DOCKER_7 v3/internal/commands/build_assets/docker/Dockerfile.server:21 — Ensure the base image uses a non latest version tag
  • Medium IaC: CKV_DOCKER_3 v3/internal/commands/build_assets/docker/Dockerfile.server:1 — Ensure that a user for the container has been created
D2 · Cognitive Complexity · packagemanager.Dependencies (cognitive 23) · ×3
  • packagemanager.Dependencies (cognitive 23) v2/internal/system/packagemanager/packagemanager.go:62 — packagemanager.Dependencies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 3 (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.
  • packagemanager.Dependencies (cognitive 23) v3/internal/doctor/packagemanager/packagemanager.go:81 — packagemanager.Dependencies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 3 (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.
  • packagemanager.Dependencies (cognitive 23) v3/pkg/doctor-ng/packagemanager/packagemanager.go:70 — packagemanager.Dependencies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 3 (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.
D1 · Cyclomatic Complexity · DialogConfig.apply (cyclomatic 22) · ×2
  • DialogConfig.apply (cyclomatic 22) v2/internal/go-common-file-dialog/cfd/DialogConfig.go:63 — DialogConfig.apply 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.
  • DialogConfig.apply (cyclomatic 22) v3/internal/go-common-file-dialog/cfd/DialogConfig.go:63 — DialogConfig.apply 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 · Provider.Download (cyclomatic 17) · ×2
  • Provider.Download (cyclomatic 17) v3/pkg/updater/providers/appcast/appcast.go:151 — Provider.Download 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.
  • Provider.Download (cyclomatic 17) v3/pkg/updater/providers/github/github.go:186 — Provider.Download 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.
D2 · Cognitive Complexity · DialogConfig.apply (cognitive 39) · ×2
  • DialogConfig.apply (cognitive 39) v2/internal/go-common-file-dialog/cfd/DialogConfig.go:63 — DialogConfig.apply has cognitive complexity 39 (threshold 15). Drivers by points: if/else 38, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • DialogConfig.apply (cognitive 39) v3/internal/go-common-file-dialog/cfd/DialogConfig.go:63 — DialogConfig.apply has cognitive complexity 39 (threshold 15). Drivers by points: if/else 38, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Provider.Download (cognitive 23) · ×2
  • Provider.Download (cognitive 23) v3/pkg/updater/providers/appcast/appcast.go:151 — Provider.Download has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, boolean chains 4, 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.
  • Provider.Download (cognitive 23) v3/pkg/updater/providers/github/github.go:186 — Provider.Download has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, boolean chains 4, 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 · Nixpkgs.PackageInstalled (cognitive 16) · ×2
  • Nixpkgs.PackageInstalled (cognitive 16) v3/internal/doctor/packagemanager/nixpkgs.go:75 — Nixpkgs.PackageInstalled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 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.
  • Nixpkgs.PackageInstalled (cognitive 16) v3/pkg/doctor-ng/packagemanager/nixpkgs.go:75 — Nixpkgs.PackageInstalled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 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.
D38 · OSV Dependency Vulnerabilities · Medium vulnerability · ×2
  • Medium vulnerability: GO-2026-5841 v3/go.mod — github.com/klauspost/compress 1.18.3 (github.com/klauspost/compress/s2): GO-2026-5841 — github.com/klauspost/compress is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so raise it in place (run `go -C v3 get github.com/klauspost/compress@v1.18.7`, which updates the require line v3/go.mod already holds for it).
  • Medium vulnerability: GO-2026-5932 v2/go.mod — golang.org/x/crypto 0.52.0 (golang.org/x/crypto/openpgp, golang.org/x/crypto/openpgp/packet, golang.org/x/crypto/openpgp/armor, +4 more): GO-2026-5932 — no fixed version has been published yet. Track the advisory; golang.org/x/crypto is not a DIRECT requirement of this module: go.mod records it as `// indirect`, pulled in transitively, so the action is on the dependency that requires it — upgrade or replace that dependent. Before doing either, check whether any affected package above is actually linked here: `go list -deps ./... | grep -F -e golang.org/x/crypto/openpgp` lists it whether your own code imports it or a dependency pulls it in — a module can be in the build list for one sub-package while the vulnerable one is never reached, in which case there is nothing to remove and tracking the advisory is the whole action.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×2
  • Duplicated block (5 lines × 2) tools/sponsorkit/render.go:297 — tools/sponsorkit/render.go:297-301 | tools/sponsorkit/render_contributors.go:203-207 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/sponsorkit/render.go:297` 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.
  • Duplicated block (5 lines × 2) tools/sponsorkit/render.go:356 — tools/sponsorkit/render.go:356-360 | tools/sponsorkit/render_contributors.go:249-253 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/sponsorkit/render.go:356` 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.
D1 · Cyclomatic Complexity · windowsWebviewWindow.WndProc (cyclomatic 120) · ×1
  • windowsWebviewWindow.WndProc (cyclomatic 120) v3/pkg/application/webview_window_windows.go:1595 — windowsWebviewWindow.WndProc has cyclomatic complexity 120 (threshold 15). Of this number, 119 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · w32.MenuBarWndProc (cyclomatic 95) · ×1
  • w32.MenuBarWndProc (cyclomatic 95) v3/pkg/w32/menubar.go:270 — w32.MenuBarWndProc has cyclomatic complexity 95 (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 · MessageProcessor.processWindowMethod (cyclomatic 78) · ×1
  • MessageProcessor.processWindowMethod (cyclomatic 78) v3/pkg/application/messageprocessor_window.go:123 — MessageProcessor.processWindowMethod has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · main.main (cyclomatic 63) · ×1
  • main.main (cyclomatic 63) v3/tasks/events/generate.go:160 — main.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 · BaseBuilder.CompileProject (cyclomatic 50) · ×1
  • BaseBuilder.CompileProject (cyclomatic 50) v2/pkg/commands/build/base.go:156 — BaseBuilder.CompileProject has cyclomatic complexity 50 (threshold 15). Of this number, 43 points are the body's own statements and 7 belong to 3 function literals inside it that branch. 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 · TypeScriptify.convertType (cyclomatic 49) · ×1
  • TypeScriptify.convertType (cyclomatic 49) v2/internal/typescriptify/typescriptify.go:633 — TypeScriptify.convertType has cyclomatic complexity 49 (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 · Executor.runTask (cyclomatic 48) · ×1
  • Executor.runTask (cyclomatic 48) v3/internal/wake/exec/exec.go:202 — Executor.runTask has cyclomatic complexity 48 (threshold 15). Of this number, 46 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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 · windowsWebviewWindow.printStyle (cyclomatic 48) · ×1
  • windowsWebviewWindow.printStyle (cyclomatic 48) v3/pkg/application/webview_window_windows.go:1121 — windowsWebviewWindow.printStyle has cyclomatic complexity 48 (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 · Dispatcher.processSystemCall (cyclomatic 44) · ×1
  • Dispatcher.processSystemCall (cyclomatic 44) v2/internal/frontend/dispatcher/systemcalls.go:26 — Dispatcher.processSystemCall has cyclomatic complexity 44 (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 · dev.doWatcherLoop (cyclomatic 43) · ×1
  • dev.doWatcherLoop (cyclomatic 43) v2/cmd/wails/internal/dev/dev.go:334 — dev.doWatcherLoop has cyclomatic complexity 43 (threshold 15). Of this number, 40 points are the body's own statements and 3 belong to 2 function literals inside it that branch. 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.main (cyclomatic 43) · ×1
  • main.main (cyclomatic 43) v3/internal/commands/build_assets/ios/scripts/deps/install_deps.go:30 — main.main has cyclomatic complexity 43 (threshold 15). Of this number, 24 points are the body's own statements and 19 belong to 4 function literals inside it that branch. 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.buildApplication (cyclomatic 42) · ×1
  • main.buildApplication (cyclomatic 42) v2/cmd/wails/build.go:22 — main.buildApplication has cyclomatic complexity 42 (threshold 15). Of this number, 22 points are the body's own statements and 20 belong to one function literal inside it that branches. 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 · main.diagnoseEnvironment (cyclomatic 42) · ×1
  • main.diagnoseEnvironment (cyclomatic 42) v2/cmd/wails/doctor.go:21 — main.diagnoseEnvironment has cyclomatic complexity 42 (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 · menu.ParseANSI (cyclomatic 41) · ×1
  • menu.ParseANSI (cyclomatic 41) v2/pkg/menu/styledlabel.go:94 — menu.ParseANSI has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · commands.RunTask (cyclomatic 39) · ×1
  • commands.RunTask (cyclomatic 39) v3/internal/commands/task.go:89 — commands.RunTask has cyclomatic complexity 39 (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 · windowsWebviewWindow.run (cyclomatic 39) · ×1
  • windowsWebviewWindow.run (cyclomatic 39) v3/pkg/application/webview_window_windows.go:385 — windowsWebviewWindow.run has cyclomatic complexity 39 (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 · generator.FindServices (cyclomatic 38) · ×1
  • generator.FindServices (cyclomatic 38) v3/internal/generator/analyse.go:21 — generator.FindServices has cyclomatic complexity 38 (threshold 15). Of this number, 27 points are the body's own statements and 11 belong to one function literal inside it that branches. 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 · ModelInfo.Collect (cyclomatic 38) · ×1
  • ModelInfo.Collect (cyclomatic 38) v3/internal/generator/collect/model.go:118 — ModelInfo.Collect has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 127). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · templates.Install (cyclomatic 37) · ×1
  • templates.Install (cyclomatic 37) v3/internal/templates/templates.go:308 — templates.Install has cyclomatic complexity 37 (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.main (cyclomatic 36) · ×1
  • main.main (cyclomatic 36) v3/examples/systray-stress/main.go:192 — main.main has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 4 of the 36 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 293, 260, 354, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · windowsWebviewWindow.setupChromium (cyclomatic 36) · ×1
  • windowsWebviewWindow.setupChromium (cyclomatic 36) v3/pkg/application/webview_window_windows.go:2369 — windowsWebviewWindow.setupChromium has cyclomatic complexity 36 (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 · w32.ComInvoke (cyclomatic 36) · ×1
  • w32.ComInvoke (cyclomatic 36) v3/pkg/w32/utils.go:125 — w32.ComInvoke has cyclomatic complexity 36 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · Wizard.pullViaDockerAPI (cyclomatic 35) · ×1
  • Wizard.pullViaDockerAPI (cyclomatic 35) v3/internal/setupwizard/wizard.go:816 — Wizard.pullViaDockerAPI has cyclomatic complexity 35 (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 · ImportMap.addTypeImpl (cyclomatic 34) · ×1
  • ImportMap.addTypeImpl (cyclomatic 34) v3/internal/generator/collect/imports.go:128 — ImportMap.addTypeImpl has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Collector.findDeclaration (cyclomatic 33) · ×1
  • Collector.findDeclaration (cyclomatic 33) v3/internal/generator/collect/declaration.go:36 — Collector.findDeclaration has cyclomatic complexity 33 (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 · StructInfo.Collect (cyclomatic 33) · ×1
  • StructInfo.Collect (cyclomatic 33) v3/internal/generator/collect/struct.go:93 — StructInfo.Collect has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 2 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 106). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · build.execBuildApplication (cyclomatic 32) · ×1
  • build.execBuildApplication (cyclomatic 32) v2/pkg/commands/build/build.go:340 — build.execBuildApplication has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · collect.IsParametric (cyclomatic 32) · ×1
  • collect.IsParametric (cyclomatic 32) v3/internal/generator/collect/predicates.go:544 — collect.IsParametric has cyclomatic complexity 32 (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 · module.JSCreateWithParams (cyclomatic 32) · ×1
  • module.JSCreateWithParams (cyclomatic 32) v3/internal/generator/render/create.go:113 — module.JSCreateWithParams has cyclomatic complexity 32 (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 · parse.parseTask (cyclomatic 30) · ×1
  • parse.parseTask (cyclomatic 30) v3/internal/wake/parse/parse.go:163 — parse.parseTask has cyclomatic complexity 30 (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 · commands.UpdateBuildAssets (cyclomatic 29) · ×1
  • commands.UpdateBuildAssets (cyclomatic 29) v3/internal/commands/build-assets.go:228 — commands.UpdateBuildAssets 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 · commands.generateMacAsset (cyclomatic 29) · ×1
  • commands.generateMacAsset (cyclomatic 29) v3/internal/commands/icons.go:168 — commands.generateMacAsset has cyclomatic complexity 29 (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 · main.initProject (cyclomatic 28) · ×1
  • main.initProject (cyclomatic 28) v2/cmd/wails/init.go:24 — main.initProject has cyclomatic complexity 28 (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 · linuxWebviewWindow.run (cyclomatic 28) · ×1
  • linuxWebviewWindow.run (cyclomatic 28) v3/pkg/application/webview_window_linux.go:313 — linuxWebviewWindow.run has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · windowsApp.wndProc (cyclomatic 28) · ×1
  • windowsApp.wndProc (cyclomatic 28) v3/pkg/application/application_windows.go:228 — windowsApp.wndProc has cyclomatic complexity 28 (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 · Dispatcher.processWindowMessage (cyclomatic 27) · ×1
  • Dispatcher.processWindowMessage (cyclomatic 27) v2/internal/frontend/dispatcher/window.go:21 — Dispatcher.processWindowMessage 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 · main.attemptFix (cyclomatic 27) · ×1
  • main.attemptFix (cyclomatic 27) v3/scripts/validate-changelog.go:144 — main.attemptFix has cyclomatic complexity 27 (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.runRelease (cyclomatic 27) · ×1
  • main.runRelease (cyclomatic 27) v3/tasks/release/release.go:483 — main.runRelease has cyclomatic complexity 27 (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 · Task.Clone (cyclomatic 26) · ×1
  • Task.Clone (cyclomatic 26) v3/internal/wake/ast/ast.go:97 — Task.Clone 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 · application.New (cyclomatic 26) · ×1
  • application.New (cyclomatic 26) v3/pkg/application/application.go:43 — application.New has cyclomatic complexity 26 (threshold 15). Of this number, 19 points are the body's own statements and 7 belong to 3 function literals inside it that branch. 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 · Validator.ValidateContent (cyclomatic 25) · ×1
  • Validator.ValidateContent (cyclomatic 25) v3/internal/changelog/validator.go:49 — Validator.ValidateContent has cyclomatic complexity 25 (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 · commands.syncDirs (cyclomatic 25) · ×1
  • commands.syncDirs (cyclomatic 25) v3/internal/commands/bindings_sync.go:22 — commands.syncDirs has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 50, 82). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · Generator.Generate (cyclomatic 25) · ×1
  • Generator.Generate (cyclomatic 25) v3/internal/generator/generate.go:93 — Generator.Generate has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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 · MessageProcessor.processDialogMethod (cyclomatic 25) · ×1
  • MessageProcessor.processDialogMethod (cyclomatic 25) v3/pkg/application/messageprocessor_dialog.go:27 — MessageProcessor.processDialogMethod has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · notifications.validateNotificationOptions (cyclomatic 25) · ×1
  • notifications.validateNotificationOptions (cyclomatic 25) v3/pkg/services/notifications/notifications.go:332 — notifications.validateNotificationOptions has cyclomatic complexity 25 (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 · Provider.Check (cyclomatic 25) · ×1
  • Provider.Check (cyclomatic 25) v3/pkg/updater/providers/endpoint/endpoint.go:96 — Provider.Check 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 · main.extractChangelogContent (cyclomatic 25) · ×1
  • main.extractChangelogContent (cyclomatic 25) v3/tasks/release/release.go:124 — main.extractChangelogContent has cyclomatic complexity 25 (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 · Win32Menu.buildMenu (cyclomatic 25) · ×1
  • Win32Menu.buildMenu (cyclomatic 25) v3/pkg/application/popupmenu_windows.go:104 — Win32Menu.buildMenu has cyclomatic complexity 25 (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.main (cyclomatic 25) · ×1
  • main.main (cyclomatic 25) v3/internal/webview2/scripts/update_version_mapping.go:62 — main.main has cyclomatic complexity 25 (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 · commands.GenerateBindings (cyclomatic 24) · ×1
  • commands.GenerateBindings (cyclomatic 24) v3/internal/commands/bindings.go:15 — commands.GenerateBindings has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · commands.verifyUpdaterArtifact (cyclomatic 24) · ×1
  • commands.verifyUpdaterArtifact (cyclomatic 24) v3/internal/commands/updater_tool.go:388 — commands.verifyUpdaterArtifact 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.main (cyclomatic 24) · ×1
  • main.main (cyclomatic 24) v3/internal/commands/build_assets/android/scripts/deps/install_deps.go:14 — main.main 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 · doctor.collectReport (cyclomatic 24) · ×1
  • doctor.collectReport (cyclomatic 24) v3/internal/doctor/doctor.go:72 — doctor.collectReport 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 · collect.isMarshaler (cyclomatic 24) · ×1
  • collect.isMarshaler (cyclomatic 24) v3/internal/generator/collect/predicates.go:101 — collect.isMarshaler 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 · EventMap.collectEventsInPackage (cyclomatic 24) · ×1
  • EventMap.collectEventsInPackage (cyclomatic 24) v3/internal/generator/collect/events.go:147 — EventMap.collectEventsInPackage 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 · BoundMethod.Call (cyclomatic 24) · ×1
  • BoundMethod.Call (cyclomatic 24) v3/pkg/application/bindings.go:308 — BoundMethod.Call has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body's own statements and 4 belong to one function literal inside it that branches. 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 · linuxMenu.processMenu (cyclomatic 24) · ×1
  • linuxMenu.processMenu (cyclomatic 24) v3/pkg/application/menu_linux.go:29 — linuxMenu.processMenu 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 · windowsWebviewWindow.resizeBorderHitTest (cyclomatic 24) · ×1
  • windowsWebviewWindow.resizeBorderHitTest (cyclomatic 24) v3/pkg/application/webview_window_windows_nonclient.go:206 — windowsWebviewWindow.resizeBorderHitTest has cyclomatic complexity 24 (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 · commands.GenerateIcons (cyclomatic 23) · ×1
  • commands.GenerateIcons (cyclomatic 23) v3/internal/commands/icons.go:43 — commands.GenerateIcons 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 · ServiceInfo.collectMethod (cyclomatic 23) · ×1
  • ServiceInfo.collectMethod (cyclomatic 23) v3/internal/generator/collect/service.go:202 — ServiceInfo.collectMethod 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 · parse.Parse (cyclomatic 23) · ×1
  • parse.Parse (cyclomatic 23) v3/internal/wake/parse/parse.go:14 — parse.Parse 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 · MessageProcessor.processCallMethod (cyclomatic 23) · ×1
  • MessageProcessor.processCallMethod (cyclomatic 23) v3/pkg/application/messageprocessor_call.go:39 — MessageProcessor.processCallMethod has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body's own statements and 7 belong to 3 function literals inside it that branch. 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.FetchContributors (cyclomatic 22) · ×1
  • main.FetchContributors (cyclomatic 22) tools/sponsorkit/contributors.go:68 — main.FetchContributors has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · dev.Application (cyclomatic 22) · ×1
  • dev.Application (cyclomatic 22) v2/cmd/wails/internal/dev/dev.go:54 — dev.Application has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · linuxSystemTray.run (cyclomatic 22) · ×1
  • linuxSystemTray.run (cyclomatic 22) v3/pkg/application/systemtray_linux.go:321 — linuxSystemTray.run has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body's own statements and 11 belong to one function literal inside it that branches. This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · linuxNotifier.notify (cyclomatic 22) · ×1
  • linuxNotifier.notify (cyclomatic 22) v3/pkg/services/notifications/notifications_linux.go:193 — linuxNotifier.notify 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 · windowsSystemTray.run (cyclomatic 22) · ×1
  • windowsSystemTray.run (cyclomatic 22) v3/pkg/application/systemtray_windows.go:206 — windowsSystemTray.run has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · windowsWebviewWindow.routeNonClientInput (cyclomatic 22) · ×1
  • windowsWebviewWindow.routeNonClientInput (cyclomatic 22) v3/pkg/application/webview_window_windows_nonclient.go:55 — windowsWebviewWindow.routeNonClientInput 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 · main.main (cyclomatic 21) · ×1
  • main.main (cyclomatic 21) v3/examples/dialogs/main.go:15 — main.main has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 261, 279, 178, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · commands.updateTaskfileVars (cyclomatic 21) · ×1
  • commands.updateTaskfileVars (cyclomatic 21) v3/internal/commands/signing_setup.go:444 — commands.updateTaskfileVars 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 · module.PostponedCreates (cyclomatic 21) · ×1
  • module.PostponedCreates (cyclomatic 21) v3/internal/generator/render/create.go:237 — module.PostponedCreates has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 240). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · Executor.mergeVars (cyclomatic 21) · ×1
  • Executor.mergeVars (cyclomatic 21) v3/internal/wake/exec/exec.go:700 — Executor.mergeVars 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 · updater.extractTarGz (cyclomatic 21) · ×1
  • updater.extractTarGz (cyclomatic 21) v3/pkg/updater/extract.go:187 — updater.extractTarGz 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 · windowsNotifier.buildToastXML (cyclomatic 21) · ×1
  • windowsNotifier.buildToastXML (cyclomatic 21) v3/pkg/services/notifications/notifications_windows.go:454 — windowsNotifier.buildToastXML 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 · Project.setDefaults (cyclomatic 20) · ×1
  • Project.setDefaults (cyclomatic 20) v2/internal/project/project.go:155 — Project.setDefaults has cyclomatic complexity 20 (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 · templates.Install (cyclomatic 20) · ×1
  • templates.Install (cyclomatic 20) v2/pkg/templates/templates.go:169 — templates.Install has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · Parser.ParseContent (cyclomatic 20) · ×1
  • Parser.ParseContent (cyclomatic 20) v3/internal/changelog/parser.go:41 — Parser.ParseContent has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · commands.GenerateBuildAssets (cyclomatic 20) · ×1
  • commands.GenerateBuildAssets (cyclomatic 20) v3/internal/commands/build-assets.go:96 — commands.GenerateBuildAssets has cyclomatic complexity 20 (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 · commands.Init (cyclomatic 20) · ×1
  • commands.Init (cyclomatic 20) v3/internal/commands/init.go:200 — commands.Init has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · commands.UpdaterManifest (cyclomatic 20) · ×1
  • commands.UpdaterManifest (cyclomatic 20) v3/internal/commands/updater_tool.go:211 — commands.UpdaterManifest has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · module.needsCreateImpl (cyclomatic 20) · ×1
  • module.needsCreateImpl (cyclomatic 20) v3/internal/generator/render/create.go:29 — module.needsCreateImpl has cyclomatic complexity 20 (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 · module.renderNamedDefault (cyclomatic 20) · ×1
  • module.renderNamedDefault (cyclomatic 20) v3/internal/generator/render/default.go:99 — module.renderNamedDefault has cyclomatic complexity 20 (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 · setupwizard.findToolchainGo (cyclomatic 20) · ×1
  • setupwizard.findToolchainGo (cyclomatic 20) v3/internal/setupwizard/wizard_linux.go:136 — setupwizard.findToolchainGo has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wake.Execute (cyclomatic 20) · ×1
  • wake.Execute (cyclomatic 20) v3/internal/wake/wake.go:64 — wake.Execute has cyclomatic complexity 20 (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 · main.generateTemplate (cyclomatic 19) · ×1
  • main.generateTemplate (cyclomatic 19) v2/cmd/wails/generate.go:63 — main.generateTemplate has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Bindings.GenerateModels (cyclomatic 19) · ×1
  • Bindings.GenerateModels (cyclomatic 19) v2/internal/binding/binding.go:90 — Bindings.GenerateModels 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 · assetFileServer.serveFSFile (cyclomatic 19) · ×1
  • assetFileServer.serveFSFile (cyclomatic 19) v3/internal/assetserver/asset_fileserver.go:67 — assetFileServer.serveFSFile 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 · AssetServer.processWebViewRequestInternal (cyclomatic 19) · ×1
  • AssetServer.processWebViewRequestInternal (cyclomatic 19) v3/internal/assetserver/assetserver_webview.go:66 — AssetServer.processWebViewRequestInternal has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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 · commands.loadIOSProjectConfig (cyclomatic 19) · ×1
  • commands.loadIOSProjectConfig (cyclomatic 19) v3/internal/commands/ios_xcode_gen.go:115 — commands.loadIOSProjectConfig has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · PackageInfo.Collect (cyclomatic 19) · ×1
  • PackageInfo.Collect (cyclomatic 19) v3/internal/generator/collect/package.go:136 — PackageInfo.Collect has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 141). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · updater.runHelperSwap (cyclomatic 19) · ×1
  • updater.runHelperSwap (cyclomatic 19) v3/pkg/updater/helper.go:88 — updater.runHelperSwap 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 · Provider.Download (cyclomatic 19) · ×1
  • Provider.Download (cyclomatic 19) v3/pkg/updater/providers/endpoint/endpoint.go:213 — Provider.Download 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 · windowsMenu.processMenu (cyclomatic 19) · ×1
  • windowsMenu.processMenu (cyclomatic 19) v3/pkg/application/menu_windows.go:85 — windowsMenu.processMenu 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 · windowsSystemTray.positionWindow (cyclomatic 19) · ×1
  • windowsSystemTray.positionWindow (cyclomatic 19) v3/pkg/application/systemtray_windows.go:69 — windowsSystemTray.positionWindow 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 · windowsWebviewWindow.nonClientHitTestFromScreen (cyclomatic 19) · ×1
  • windowsWebviewWindow.nonClientHitTestFromScreen (cyclomatic 19) v3/pkg/application/webview_window_windows_nonclient.go:146 — windowsWebviewWindow.nonClientHitTestFromScreen has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TypeScriptify.getJSONFieldName (cyclomatic 18) · ×1
  • TypeScriptify.getJSONFieldName (cyclomatic 18) v2/internal/typescriptify/typescriptify.go:589 — TypeScriptify.getJSONFieldName has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · build.GenerateNSISInstaller (cyclomatic 18) · ×1
  • build.GenerateNSISInstaller (cyclomatic 18) v2/pkg/commands/build/nsis_installer.go:25 — build.GenerateNSISInstaller has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · commands.resolveSigningDefaults (cyclomatic 18) · ×1
  • commands.resolveSigningDefaults (cyclomatic 18) v3/internal/commands/sign.go:21 — commands.resolveSigningDefaults 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 · commands.GenerateSyso (cyclomatic 18) · ×1
  • commands.GenerateSyso (cyclomatic 18) v3/internal/commands/syso.go:26 — commands.GenerateSyso has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · commands.ToolPackage (cyclomatic 18) · ×1
  • commands.ToolPackage (cyclomatic 18) v3/internal/commands/tool_package.go:16 — commands.ToolPackage has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · doctor.renderReport (cyclomatic 18) · ×1
  • doctor.renderReport (cyclomatic 18) v3/internal/doctor/doctor.go:193 — doctor.renderReport 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 · module.renderNamedType (cyclomatic 18) · ×1
  • module.renderNamedType (cyclomatic 18) v3/internal/generator/render/type.go:173 — module.renderNamedType has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Wizard.handleGPGCreate (cyclomatic 18) · ×1
  • Wizard.handleGPGCreate (cyclomatic 18) v3/internal/setupwizard/wizard.go:1491 — Wizard.handleGPGCreate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TaskCache.ShouldSkip (cyclomatic 18) · ×1
  • TaskCache.ShouldSkip (cyclomatic 18) v3/internal/wake/exec/cache.go:111 — TaskCache.ShouldSkip has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · parse.ExpandTemplates (cyclomatic 18) · ×1
  • parse.ExpandTemplates (cyclomatic 18) v3/internal/wake/parse/expr.go:17 — parse.ExpandTemplates has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body's own statements and 8 belong to 3 function literals inside it that branch. 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 · parse.parseCmds (cyclomatic 18) · ×1
  • parse.parseCmds (cyclomatic 18) v3/internal/wake/parse/parse.go:269 — parse.parseCmds has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · resolve.MergeTask (cyclomatic 18) · ×1
  • resolve.MergeTask (cyclomatic 18) v3/internal/wake/resolve/merge.go:40 — resolve.MergeTask 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 · App.Run (cyclomatic 18) · ×1
  • App.Run (cyclomatic 18) v3/pkg/application/application.go:560 — App.Run has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · Model.Update (cyclomatic 18) · ×1
  • Model.Update (cyclomatic 18) v3/pkg/doctor-ng/tui/model.go:67 — Model.Update has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Provider.Check (cyclomatic 18) · ×1
  • Provider.Check (cyclomatic 18) v3/pkg/updater/providers/keygen/keygen.go:102 — Provider.Check 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 · Provider.Download (cyclomatic 18) · ×1
  • Provider.Download (cyclomatic 18) v3/pkg/updater/providers/keygen/keygen.go:217 — Provider.Download has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Chromium.initializeController (cyclomatic 18) · ×1
  • Chromium.initializeController (cyclomatic 18) v3/internal/webview2/pkg/edge/chromium.go:467 — Chromium.initializeController has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · windowsWebviewWindow.updateTheme (cyclomatic 18) · ×1
  • windowsWebviewWindow.updateTheme (cyclomatic 18) v3/pkg/application/webview_window_windows.go:1472 — windowsWebviewWindow.updateTheme has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · main.FetchSponsors (cyclomatic 17) · ×1
  • main.FetchSponsors (cyclomatic 17) tools/sponsorkit/github.go:78 — main.FetchSponsors has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.updateToVersion (cyclomatic 17) · ×1
  • main.updateToVersion (cyclomatic 17) v2/cmd/wails/update.go:74 — main.updateToVersion 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 · assetHandler.serveFSFile (cyclomatic 17) · ×1
  • assetHandler.serveFSFile (cyclomatic 17) v2/pkg/assetserver/assethandler.go:114 — assetHandler.serveFSFile 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 · AssetServer.ServeHTTP (cyclomatic 17) · ×1
  • AssetServer.ServeHTTP (cyclomatic 17) v2/pkg/assetserver/assetserver.go:109 — AssetServer.ServeHTTP has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · build.Build (cyclomatic 17) · ×1
  • build.Build (cyclomatic 17) v2/pkg/commands/build/build.go:78 — build.Build 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 · commands.generateAppImage (cyclomatic 17) · ×1
  • commands.generateAppImage (cyclomatic 17) v3/internal/commands/appimage.go:76 — commands.generateAppImage has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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 · commands.ToolVersion (cyclomatic 17) · ×1
  • commands.ToolVersion (cyclomatic 17) v3/internal/commands/tool_version.go:54 — commands.ToolVersion has cyclomatic complexity 17 (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 · commands.updateToVersion (cyclomatic 17) · ×1
  • commands.updateToVersion (cyclomatic 17) v3/internal/commands/update_cli.go:99 — commands.updateToVersion 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 · s.splitShell (cyclomatic 17) · ×1
  • s.splitShell (cyclomatic 17) v3/internal/s/s.go:269 — s.splitShell 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 · Wizard.pullViaDockerCLI (cyclomatic 17) · ×1
  • Wizard.pullViaDockerCLI (cyclomatic 17) v3/internal/setupwizard/wizard.go:984 — Wizard.pullViaDockerCLI has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body's own statements and 5 belong to one function literal inside it that branches. 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 · cmds.shellSplit (cyclomatic 17) · ×1
  • cmds.shellSplit (cyclomatic 17) v3/internal/wake/cmds/shell.go:109 — cmds.shellSplit 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 · cmds.parseGoBuildArgs (cyclomatic 17) · ×1
  • cmds.parseGoBuildArgs (cyclomatic 17) v3/internal/wake/cmds/shell.go:158 — cmds.parseGoBuildArgs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · main.main (cyclomatic 17) · ×1
  • main.main (cyclomatic 17) v3/scripts/validate-changelog.go:11 — main.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · main.fetchMergedPRCounts (cyclomatic 16) · ×1
  • main.fetchMergedPRCounts (cyclomatic 16) tools/sponsorkit/contributors.go:252 — main.fetchMergedPRCounts 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 · Bindings.getMethods (cyclomatic 16) · ×1
  • Bindings.getMethods (cyclomatic 16) v2/internal/binding/reflect.go:47 — Bindings.getMethods 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 · Dispatcher.ProcessMessage (cyclomatic 16) · ×1
  • Dispatcher.ProcessMessage (cyclomatic 16) v2/internal/frontend/dispatcher/dispatcher.go:35 — Dispatcher.ProcessMessage has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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 · utils.ValidateAndSanitizeURL (cyclomatic 16) · ×1
  • utils.ValidateAndSanitizeURL (cyclomatic 16) v2/internal/frontend/utils/urlValidator.go:11 — utils.ValidateAndSanitizeURL has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · commands.IOSXcodeGen (cyclomatic 16) · ×1
  • commands.IOSXcodeGen (cyclomatic 16) v3/internal/commands/ios_xcode_gen.go:189 — commands.IOSXcodeGen has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · commands.UpdaterVerify (cyclomatic 16) · ×1
  • commands.UpdaterVerify (cyclomatic 16) v3/internal/commands/updater_tool.go:319 — commands.UpdaterVerify 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 · Reporter.writePanelLocked (cyclomatic 16) · ×1
  • Reporter.writePanelLocked (cyclomatic 16) v3/internal/report/pulse/summary.go:450 — Reporter.writePanelLocked has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Wizard.handleWindowsCertCreate (cyclomatic 16) · ×1
  • Wizard.handleWindowsCertCreate (cyclomatic 16) v3/internal/setupwizard/wizard.go:1701 — Wizard.handleWindowsCertCreate has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to one function literal inside it that branches. 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 · templates.GenerateTemplate (cyclomatic 16) · ×1
  • templates.GenerateTemplate (cyclomatic 16) v3/internal/templates/templates.go:542 — templates.GenerateTemplate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · application.ValidateAndSanitizeURL (cyclomatic 16) · ×1
  • application.ValidateAndSanitizeURL (cyclomatic 16) v3/pkg/application/urlvalidator.go:11 — application.ValidateAndSanitizeURL has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · windowsSystemTray.wndProc (cyclomatic 16) · ×1
  • windowsSystemTray.wndProc (cyclomatic 16) v3/pkg/application/systemtray_windows.go:454 — windowsSystemTray.wndProc 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×1
  • Hotspot: webview2/pkg/edge/chromium.go webview2/pkg/edge/chromium.go — webview2/pkg/edge/chromium.go changed 4 times in last 90 days, max complexity 18. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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.
D2 · Cognitive Complexity · windowsWebviewWindow.WndProc (cognitive 212) · ×1
  • windowsWebviewWindow.WndProc (cognitive 212) v3/pkg/application/webview_window_windows.go:1595 — windowsWebviewWindow.WndProc has cognitive complexity 212 (threshold 15). Drivers by points: if/else 182, boolean chains 16, match/switch 14 (nesting depth added 119). Of this number, 210 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · w32.MenuBarWndProc (cognitive 187) · ×1
  • w32.MenuBarWndProc (cognitive 187) v3/pkg/w32/menubar.go:270 — w32.MenuBarWndProc has cognitive complexity 187 (threshold 15). Drivers by points: if/else 165, boolean chains 13, loops 8, match/switch 1 (nesting depth added 112). 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 · dev.doWatcherLoop (cognitive 129) · ×1
  • dev.doWatcherLoop (cognitive 129) v2/cmd/wails/internal/dev/dev.go:334 — dev.doWatcherLoop has cognitive complexity 129 (threshold 15). Drivers by points: if/else 114, loops 11, boolean chains 2, match/switch 2 (nesting depth added 87). Of this number, 121 points are the body's own statements and 8 belong to 2 function literals inside it that branch. 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.main (cognitive 113) · ×1
  • main.main (cognitive 113) v3/internal/commands/build_assets/ios/scripts/deps/install_deps.go:30 — main.main has cognitive complexity 113 (threshold 15). Drivers by points: if/else 96, loops 13, boolean chains 4 (nesting depth added 61). Of this number, 84 points are the body's own statements and 29 belong to 4 function literals inside it that branch. 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.main (cognitive 110) · ×1
  • main.main (cognitive 110) v3/tasks/events/generate.go:160 — main.main has cognitive complexity 110 (threshold 15). Drivers by points: if/else 98, match/switch 6, loops 5, jumps 1 (nesting depth added 55). 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 · TypeScriptify.convertType (cognitive 104) · ×1
  • TypeScriptify.convertType (cognitive 104) v2/internal/typescriptify/typescriptify.go:633 — TypeScriptify.convertType has cognitive complexity 104 (threshold 15). Drivers by points: if/else 89, match/switch 6, boolean chains 5, loops 4 (nesting depth added 54). 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.diagnoseEnvironment (cognitive 100) · ×1
  • main.diagnoseEnvironment (cognitive 100) v2/cmd/wails/doctor.go:21 — main.diagnoseEnvironment has cognitive complexity 100 (threshold 15). Drivers by points: if/else 88, loops 11, boolean chains 1 (nesting depth added 52). 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 · generator.FindServices (cognitive 94) · ×1
  • generator.FindServices (cognitive 94) v3/internal/generator/analyse.go:21 — generator.FindServices has cognitive complexity 94 (threshold 15). Drivers by points: if/else 68, loops 18, boolean chains 5, match/switch 3 (nesting depth added 61). Of this number, 66 points are the body's own statements and 28 belong to one function literal inside it that branches. 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 · menu.ParseANSI (cognitive 86) · ×1
  • menu.ParseANSI (cognitive 86) v2/pkg/menu/styledlabel.go:94 — menu.ParseANSI has cognitive complexity 86 (threshold 15). Drivers by points: if/else 77, boolean chains 3, loops 3, match/switch 3 (nesting depth added 59). 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 · Executor.runTask (cognitive 84) · ×1
  • Executor.runTask (cognitive 84) v3/internal/wake/exec/exec.go:202 — Executor.runTask has cognitive complexity 84 (threshold 15). Drivers by points: if/else 65, loops 13, boolean chains 4, match/switch 2 (nesting depth added 41). Of this number, 78 points are the body's own statements and 6 belong to 2 function literals inside it that branch. 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 · StructInfo.Collect (cognitive 81) · ×1
  • StructInfo.Collect (cognitive 81) v3/internal/generator/collect/struct.go:93 — StructInfo.Collect has cognitive complexity 81 (threshold 15). Drivers by points: if/else 69, loops 8, boolean chains 4 (nesting depth added 50). Most of this is not in the body itself: 1 of the 81 points is its own statement and the rest belongs to one function literal inside it that branches (line 106). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · BaseBuilder.CompileProject (cognitive 77) · ×1
  • BaseBuilder.CompileProject (cognitive 77) v2/pkg/commands/build/base.go:156 — BaseBuilder.CompileProject has cognitive complexity 77 (threshold 15). Drivers by points: if/else 73, boolean chains 4 (nesting depth added 27). Of this number, 58 points are the body's own statements and 19 belong to 3 function literals inside it that branch. 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 · ModelInfo.Collect (cognitive 73) · ×1
  • ModelInfo.Collect (cognitive 73) v3/internal/generator/collect/model.go:118 — ModelInfo.Collect has cognitive complexity 73 (threshold 15). Drivers by points: if/else 51, loops 14, boolean chains 7, match/switch 1 (nesting depth added 41). Most of this is not in the body itself: 1 of the 73 points is its own statement and the rest belongs to one function literal inside it that branches (line 127). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · collect.IsParametric (cognitive 69) · ×1
  • collect.IsParametric (cognitive 69) v3/internal/generator/collect/predicates.go:544 — collect.IsParametric has cognitive complexity 69 (threshold 15). Drivers by points: if/else 48, loops 19, match/switch 2 (nesting depth added 47). 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 · ImportMap.addTypeImpl (cognitive 61) · ×1
  • ImportMap.addTypeImpl (cognitive 61) v3/internal/generator/collect/imports.go:128 — ImportMap.addTypeImpl has cognitive complexity 61 (threshold 15). Drivers by points: if/else 44, loops 9, match/switch 5, boolean chains 3 (nesting depth added 37). 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 · Wizard.pullViaDockerAPI (cognitive 60) · ×1
  • Wizard.pullViaDockerAPI (cognitive 60) v3/internal/setupwizard/wizard.go:816 — Wizard.pullViaDockerAPI has cognitive complexity 60 (threshold 15). Drivers by points: if/else 51, boolean chains 3, loops 3, match/switch 3 (nesting depth added 28). 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 · Win32Menu.buildMenu (cognitive 59) · ×1
  • Win32Menu.buildMenu (cognitive 59) v3/pkg/application/popupmenu_windows.go:104 — Win32Menu.buildMenu has cognitive complexity 59 (threshold 15). Drivers by points: if/else 51, loops 7, boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · templates.Install (cognitive 57) · ×1
  • templates.Install (cognitive 57) v3/internal/templates/templates.go:308 — templates.Install has cognitive complexity 57 (threshold 15). Drivers by points: if/else 54, boolean chains 2, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commands.RunTask (cognitive 55) · ×1
  • commands.RunTask (cognitive 55) v3/internal/commands/task.go:89 — commands.RunTask has cognitive complexity 55 (threshold 15). Drivers by points: if/else 41, boolean chains 9, loops 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · main.attemptFix (cognitive 54) · ×1
  • main.attemptFix (cognitive 54) v3/scripts/validate-changelog.go:144 — main.attemptFix has cognitive complexity 54 (threshold 15). Drivers by points: if/else 29, loops 19, boolean chains 6 (nesting depth added 27). 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.extractChangelogContent (cognitive 53) · ×1
  • main.extractChangelogContent (cognitive 53) v3/tasks/release/release.go:124 — main.extractChangelogContent has cognitive complexity 53 (threshold 15). Drivers by points: if/else 47, boolean chains 4, loops 2 (nesting depth added 29). 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 · Task.Clone (cognitive 52) · ×1
  • Task.Clone (cognitive 52) v3/internal/wake/ast/ast.go:97 — Task.Clone has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29, loops 23 (nesting depth added 27). 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 · windowsWebviewWindow.setupChromium (cognitive 52) · ×1
  • windowsWebviewWindow.setupChromium (cognitive 52) v3/pkg/application/webview_window_windows.go:2369 — windowsWebviewWindow.setupChromium has cognitive complexity 52 (threshold 15). Drivers by points: if/else 46, boolean chains 3, loops 3 (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 · MessageProcessor.processWindowMethod (cognitive 51) · ×1
  • MessageProcessor.processWindowMethod (cognitive 51) v3/pkg/application/messageprocessor_window.go:123 — MessageProcessor.processWindowMethod has cognitive complexity 51 (threshold 15). Drivers by points: if/else 50, match/switch 1 (nesting depth added 25). 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.main (cognitive 51) · ×1
  • main.main (cognitive 51) v3/examples/systray-stress/main.go:192 — main.main has cognitive complexity 51 (threshold 15). Drivers by points: if/else 34, boolean chains 10, loops 6, match/switch 1 (nesting depth added 18). Most of this is not in the body itself: 4 of the 51 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 293, 260, 339, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · build.execBuildApplication (cognitive 50) · ×1
  • build.execBuildApplication (cognitive 50) v2/pkg/commands/build/build.go:340 — build.execBuildApplication has cognitive complexity 50 (threshold 15). Drivers by points: if/else 43, boolean chains 7 (nesting depth added 17). Of this number, 48 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · MessageProcessor.processCallMethod (cognitive 50) · ×1
  • MessageProcessor.processCallMethod (cognitive 50) v3/pkg/application/messageprocessor_call.go:39 — MessageProcessor.processCallMethod has cognitive complexity 50 (threshold 15). Drivers by points: if/else 45, match/switch 4, boolean chains 1 (nesting depth added 27). Of this number, 29 points are the body's own statements and 21 belong to 3 function literals inside it that branch. 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.buildApplication (cognitive 49) · ×1
  • main.buildApplication (cognitive 49) v2/cmd/wails/build.go:22 — main.buildApplication has cognitive complexity 49 (threshold 15). Drivers by points: if/else 41, boolean chains 5, match/switch 3 (nesting depth added 8). Of this number, 25 points are the body's own statements and 24 belong to one function literal inside it that branches. 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.main (cognitive 47) · ×1
  • main.main (cognitive 47) v3/internal/commands/build_assets/android/scripts/deps/install_deps.go:14 — main.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 38, loops 7, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · module.JSCreateWithParams (cognitive 47) · ×1
  • module.JSCreateWithParams (cognitive 47) v3/internal/generator/render/create.go:113 — module.JSCreateWithParams has cognitive complexity 47 (threshold 15). Drivers by points: if/else 32, loops 6, match/switch 6, boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · windowsWebviewWindow.run (cognitive 47) · ×1
  • windowsWebviewWindow.run (cognitive 47) v3/pkg/application/webview_window_windows.go:385 — windowsWebviewWindow.run has cognitive complexity 47 (threshold 15). Drivers by points: if/else 42, boolean chains 3, match/switch 2 (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 · windowsWebviewWindow.printStyle (cognitive 47) · ×1
  • windowsWebviewWindow.printStyle (cognitive 47) v3/pkg/application/webview_window_windows.go:1121 — windowsWebviewWindow.printStyle has cognitive complexity 47 (threshold 15). Drivers by points: if/else 47. 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 · Collector.findDeclaration (cognitive 46) · ×1
  • Collector.findDeclaration (cognitive 46) v3/internal/generator/collect/declaration.go:36 — Collector.findDeclaration has cognitive complexity 46 (threshold 15). Drivers by points: if/else 35, match/switch 6, boolean chains 4, loops 1 (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 · notifications.validateNotificationOptions (cognitive 46) · ×1
  • notifications.validateNotificationOptions (cognitive 46) v3/pkg/services/notifications/notifications.go:332 — notifications.validateNotificationOptions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 39, boolean chains 4, match/switch 2, loops 1 (nesting depth added 22). 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 · PackageInfo.Collect (cognitive 45) · ×1
  • PackageInfo.Collect (cognitive 45) v3/internal/generator/collect/package.go:136 — PackageInfo.Collect has cognitive complexity 45 (threshold 15). Drivers by points: if/else 34, loops 7, match/switch 3, boolean chains 1 (nesting depth added 28). Most of this is not in the body itself: 1 of the 45 points is its own statement and the rest belongs to one function literal inside it that branches (line 141). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Validator.ValidateContent (cognitive 44) · ×1
  • Validator.ValidateContent (cognitive 44) v3/internal/changelog/validator.go:49 — Validator.ValidateContent has cognitive complexity 44 (threshold 15). Drivers by points: if/else 37, boolean chains 6, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventMap.collectEventsInPackage (cognitive 43) · ×1
  • EventMap.collectEventsInPackage (cognitive 43) v3/internal/generator/collect/events.go:147 — EventMap.collectEventsInPackage has cognitive complexity 43 (threshold 15). Drivers by points: if/else 39, boolean chains 3, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · templates.Install (cognitive 42) · ×1
  • templates.Install (cognitive 42) v2/pkg/templates/templates.go:169 — templates.Install has cognitive complexity 42 (threshold 15). Drivers by points: if/else 42 (nesting depth added 20). Of this number, 39 points are the body's own statements and 3 belong to one function literal inside it that branches. 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.main (cognitive 42) · ×1
  • main.main (cognitive 42) v3/internal/webview2/scripts/update_version_mapping.go:62 — main.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 38, loops 3, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commands.GenerateIcons (cognitive 41) · ×1
  • commands.GenerateIcons (cognitive 41) v3/internal/commands/icons.go:43 — commands.GenerateIcons has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, boolean chains 4 (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 · linuxMenu.processMenu (cognitive 41) · ×1
  • linuxMenu.processMenu (cognitive 41) v3/pkg/application/menu_linux.go:29 — linuxMenu.processMenu has cognitive complexity 41 (threshold 15). Drivers by points: if/else 35, loops 3, match/switch 2, boolean chains 1 (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 · windowsMenu.processMenu (cognitive 41) · ×1
  • windowsMenu.processMenu (cognitive 41) v3/pkg/application/menu_windows.go:85 — windowsMenu.processMenu has cognitive complexity 41 (threshold 15). Drivers by points: if/else 38, boolean chains 2, loops 1 (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 · commands.UpdateBuildAssets (cognitive 40) · ×1
  • commands.UpdateBuildAssets (cognitive 40) v3/internal/commands/build-assets.go:228 — commands.UpdateBuildAssets has cognitive complexity 40 (threshold 15). Drivers by points: if/else 33, boolean chains 7 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dispatcher.processSystemCall (cognitive 39) · ×1
  • Dispatcher.processSystemCall (cognitive 39) v2/internal/frontend/dispatcher/systemcalls.go:26 — Dispatcher.processSystemCall has cognitive complexity 39 (threshold 15). Drivers by points: if/else 38, match/switch 1 (nesting depth added 19). 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 · setupwizard.findToolchainGo (cognitive 39) · ×1
  • setupwizard.findToolchainGo (cognitive 39) v3/internal/setupwizard/wizard_linux.go:136 — setupwizard.findToolchainGo has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, loops 7, boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MessageProcessor.processDialogMethod (cognitive 39) · ×1
  • MessageProcessor.processDialogMethod (cognitive 39) v3/pkg/application/messageprocessor_dialog.go:27 — MessageProcessor.processDialogMethod has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, match/switch 9, boolean chains 3, loops 2 (nesting depth added 19). Of this number, 36 points are the body's own statements and 3 belong to one function literal inside it that branches. 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 · Bindings.GenerateModels (cognitive 38) · ×1
  • Bindings.GenerateModels (cognitive 38) v2/internal/binding/binding.go:90 — Bindings.GenerateModels has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20, loops 18 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Bindings.getMethods (cognitive 38) · ×1
  • Bindings.getMethods (cognitive 38) v2/internal/binding/reflect.go:47 — Bindings.getMethods has cognitive complexity 38 (threshold 15). Drivers by points: if/else 33, loops 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commands.updateTaskfileVars (cognitive 38) · ×1
  • commands.updateTaskfileVars (cognitive 38) v3/internal/commands/signing_setup.go:444 — commands.updateTaskfileVars has cognitive complexity 38 (threshold 15). Drivers by points: if/else 27, loops 8, boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BoundMethod.Call (cognitive 38) · ×1
  • BoundMethod.Call (cognitive 38) v3/pkg/application/bindings.go:308 — BoundMethod.Call has cognitive complexity 38 (threshold 15). Drivers by points: if/else 34, loops 4 (nesting depth added 11). Of this number, 32 points are the body's own statements and 6 belong to one function literal inside it that branches. 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 · updater.extractTarGz (cognitive 38) · ×1
  • updater.extractTarGz (cognitive 38) v3/pkg/updater/extract.go:187 — updater.extractTarGz has cognitive complexity 38 (threshold 15). Drivers by points: if/else 33, loops 2, match/switch 2, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · module.PostponedCreates (cognitive 37) · ×1
  • module.PostponedCreates (cognitive 37) v3/internal/generator/render/create.go:237 — module.PostponedCreates has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28, loops 7, boolean chains 1, match/switch 1 (nesting depth added 18). Most of this is not in the body itself: 3 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 240). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Wizard.checkAllDependencies (cognitive 37) · ×1
  • Wizard.checkAllDependencies (cognitive 37) v3/internal/setupwizard/wizard_linux.go:15 — Wizard.checkAllDependencies has cognitive complexity 37 (threshold 15). Drivers by points: if/else 35, loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · main.runRelease (cognitive 37) · ×1
  • main.runRelease (cognitive 37) v3/tasks/release/release.go:483 — main.runRelease has cognitive complexity 37 (threshold 15). Drivers by points: if/else 37 (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 · main.FetchContributors (cognitive 36) · ×1
  • main.FetchContributors (cognitive 36) tools/sponsorkit/contributors.go:68 — main.FetchContributors has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, loops 7, boolean chains 3 (nesting depth added 16). Of this number, 35 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · application.New (cognitive 36) · ×1
  • application.New (cognitive 36) v3/pkg/application/application.go:43 — application.New has cognitive complexity 36 (threshold 15). Drivers by points: if/else 34, boolean chains 1, match/switch 1 (nesting depth added 10). Of this number, 29 points are the body's own statements and 7 belong to 3 function literals inside it that branch. 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.initProject (cognitive 34) · ×1
  • main.initProject (cognitive 34) v2/cmd/wails/init.go:24 — main.initProject has cognitive complexity 34 (threshold 15). Drivers by points: if/else 31, loops 2, match/switch 1 (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.FetchSponsors (cognitive 33) · ×1
  • main.FetchSponsors (cognitive 33) tools/sponsorkit/github.go:78 — main.FetchSponsors has cognitive complexity 33 (threshold 15). Drivers by points: if/else 29, loops 3, boolean chains 1 (nesting depth added 17). Of this number, 32 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · Executor.mergeVars (cognitive 33) · ×1
  • Executor.mergeVars (cognitive 33) v3/internal/wake/exec/exec.go:700 — Executor.mergeVars has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22, loops 8, boolean chains 3 (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 · parse.resolveIncludes (cognitive 33) · ×1
  • parse.resolveIncludes (cognitive 33) v3/internal/wake/parse/parse.go:425 — parse.resolveIncludes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22, loops 11 (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 · commands.GenerateBindings (cognitive 32) · ×1
  • commands.GenerateBindings (cognitive 32) v3/internal/commands/bindings.go:15 — commands.GenerateBindings has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, boolean chains 2, match/switch 2 (nesting depth added 8). Of this number, 30 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · commands.verifyUpdaterArtifact (cognitive 32) · ×1
  • commands.verifyUpdaterArtifact (cognitive 32) v3/internal/commands/updater_tool.go:388 — commands.verifyUpdaterArtifact has cognitive complexity 32 (threshold 15). Drivers by points: if/else 29, boolean chains 2, match/switch 1 (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 · ServiceInfo.collectMethod (cognitive 32) · ×1
  • ServiceInfo.collectMethod (cognitive 32) v3/internal/generator/collect/service.go:202 — ServiceInfo.collectMethod has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20, boolean chains 5, loops 4, match/switch 3 (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 · main.main (cognitive 31) · ×1
  • main.main (cognitive 31) v3/examples/dialogs/main.go:15 — main.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 30, boolean chains 1. Most of this is not in the body itself: 4 of the 31 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 261, 279, 178, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · doctor.collectReport (cognitive 31) · ×1
  • doctor.collectReport (cognitive 31) v3/internal/doctor/doctor.go:72 — doctor.collectReport has cognitive complexity 31 (threshold 15). Drivers by points: if/else 28, boolean chains 3 (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 · collect.isMarshaler (cognitive 31) · ×1
  • collect.isMarshaler (cognitive 31) v3/internal/generator/collect/predicates.go:101 — collect.isMarshaler has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24, loops 4, boolean chains 3 (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 · linuxSystemTray.run (cognitive 31) · ×1
  • linuxSystemTray.run (cognitive 31) v3/pkg/application/systemtray_linux.go:321 — linuxSystemTray.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 26, boolean chains 2, match/switch 2, loops 1 (nesting depth added 11). Most of this is not in the body itself: 10 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 392). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Bindings.AddStructToGenerateTS (cognitive 30) · ×1
  • Bindings.AddStructToGenerateTS (cognitive 30) v2/internal/binding/binding.go:257 — Bindings.AddStructToGenerateTS has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, loops 5, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · windowsApp.wndProc (cognitive 30) · ×1
  • windowsApp.wndProc (cognitive 30) v3/pkg/application/application_windows.go:228 — windowsApp.wndProc has cognitive complexity 30 (threshold 15). Drivers by points: if/else 23, boolean chains 4, match/switch 3 (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 · commands.syncDirs (cognitive 29) · ×1
  • commands.syncDirs (cognitive 29) v3/internal/commands/bindings_sync.go:22 — commands.syncDirs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, boolean chains 2, loops 1, match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 50, 82). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Generator.Generate (cognitive 29) · ×1
  • Generator.Generate (cognitive 29) v3/internal/generator/generate.go:93 — Generator.Generate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, loops 6, boolean chains 2 (nesting depth added 3). Of this number, 26 points are the body's own statements and 3 belong to 2 function literals inside it that branch. 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 · windowsSystemTray.run (cognitive 29) · ×1
  • windowsSystemTray.run (cognitive 29) v3/pkg/application/systemtray_windows.go:206 — windowsSystemTray.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, boolean chains 3 (nesting depth added 5). Of this number, 27 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · windowsWebviewWindow.routeNonClientInput (cognitive 29) · ×1
  • windowsWebviewWindow.routeNonClientInput (cognitive 29) v3/pkg/application/webview_window_windows_nonclient.go:55 — windowsWebviewWindow.routeNonClientInput has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, boolean chains 5, match/switch 3 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · windowsNotifier.buildToastXML (cognitive 29) · ×1
  • windowsNotifier.buildToastXML (cognitive 29) v3/pkg/services/notifications/notifications_windows.go:454 — windowsNotifier.buildToastXML has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, loops 3, match/switch 2, boolean chains 1 (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 · w32.init (cognitive 29) · ×1
  • w32.init (cognitive 29) v3/pkg/w32/theme.go:98 — w32.init has cognitive complexity 29 (threshold 15). Drivers by points: if/else 29 (nesting depth added 19). Of this number, 25 points are the body's own statements and 4 belong to one function literal inside it that branches. 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 · WebSocketTransport.handleWebSocket (cognitive 28) · ×1
  • WebSocketTransport.handleWebSocket (cognitive 28) v3/examples/websocket-transport/transport_websocket.go:141 — WebSocketTransport.handleWebSocket has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23, loops 2, match/switch 2, boolean chains 1 (nesting depth added 14). Most of this is not in the body itself: 13 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 167, 155). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · assetFileServer.serveFSFile (cognitive 28) · ×1
  • assetFileServer.serveFSFile (cognitive 28) v3/internal/assetserver/asset_fileserver.go:67 — assetFileServer.serveFSFile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 26, boolean chains 2 (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 · commands.generateMacAsset (cognitive 28) · ×1
  • commands.generateMacAsset (cognitive 28) v3/internal/commands/icons.go:168 — commands.generateMacAsset has cognitive complexity 28 (threshold 15). Drivers by points: if/else 25, match/switch 2, loops 1 (nesting depth added 2). 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 · commands.Init (cognitive 28) · ×1
  • commands.Init (cognitive 28) v3/internal/commands/init.go:200 — commands.Init has cognitive complexity 28 (threshold 15). Drivers by points: if/else 28 (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 · doctor.renderReport (cognitive 28) · ×1
  • doctor.renderReport (cognitive 28) v3/internal/doctor/doctor.go:193 — doctor.renderReport has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, loops 7 (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 · module.renderNamedDefault (cognitive 28) · ×1
  • module.renderNamedDefault (cognitive 28) v3/internal/generator/render/default.go:99 — module.renderNamedDefault has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, match/switch 5, 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 · module.renderNamedType (cognitive 28) · ×1
  • module.renderNamedType (cognitive 28) v3/internal/generator/render/type.go:173 — module.renderNamedType has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, loops 3, match/switch 3, 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 · linuxWebviewWindow.run (cognitive 28) · ×1
  • linuxWebviewWindow.run (cognitive 28) v3/pkg/application/webview_window_linux.go:313 — linuxWebviewWindow.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, boolean chains 2, loops 1, match/switch 1 (nesting depth added 3). Of this number, 26 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · dev.Application (cognitive 27) · ×1
  • dev.Application (cognitive 27) v2/cmd/wails/internal/dev/dev.go:54 — dev.Application has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, boolean chains 2 (nesting depth added 6). Of this number, 26 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · TaskCache.ShouldSkip (cognitive 27) · ×1
  • TaskCache.ShouldSkip (cognitive 27) v3/internal/wake/exec/cache.go:111 — TaskCache.ShouldSkip has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20, loops 6, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · windowsWebviewWindow.updateTheme (cognitive 27) · ×1
  • windowsWebviewWindow.updateTheme (cognitive 27) v3/pkg/application/webview_window_windows.go:1472 — windowsWebviewWindow.updateTheme has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, boolean chains 3 (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 · main.fetchMergedPRCounts (cognitive 26) · ×1
  • main.fetchMergedPRCounts (cognitive 26) tools/sponsorkit/contributors.go:252 — main.fetchMergedPRCounts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 3, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · main.updateToVersion (cognitive 26) · ×1
  • main.updateToVersion (cognitive 26) v2/cmd/wails/update.go:74 — main.updateToVersion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, boolean chains 5 (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 · staticanalysis.GetEmbedDetailsForFile (cognitive 26) · ×1
  • staticanalysis.GetEmbedDetailsForFile (cognitive 26) v2/internal/staticanalysis/staticanalysis.go:49 — staticanalysis.GetEmbedDetailsForFile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 7, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.ParseContent (cognitive 26) · ×1
  • Parser.ParseContent (cognitive 26) v3/internal/changelog/parser.go:41 — Parser.ParseContent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, match/switch 3, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commands.UpdateCLI (cognitive 26) · ×1
  • commands.UpdateCLI (cognitive 26) v3/internal/commands/update_cli.go:23 — commands.UpdateCLI has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, 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 · commands.updateToVersion (cognitive 26) · ×1
  • commands.updateToVersion (cognitive 26) v3/internal/commands/update_cli.go:99 — commands.updateToVersion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, boolean chains 5 (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 · setupwizard.checkGo (cognitive 26) · ×1
  • setupwizard.checkGo (cognitive 26) v3/internal/setupwizard/wizard_linux.go:75 — setupwizard.checkGo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 4, loops 3 (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 · HTTPTransport.processBody (cognitive 26) · ×1
  • HTTPTransport.processBody (cognitive 26) v3/pkg/application/transport_http.go:247 — HTTPTransport.processBody has cognitive complexity 26 (threshold 15). Drivers by points: if/else 26 (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 · Provider.Download (cognitive 26) · ×1
  • Provider.Download (cognitive 26) v3/pkg/updater/providers/endpoint/endpoint.go:213 — Provider.Download has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 4, loops 3 (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 · commands.UpdaterManifest (cognitive 25) · ×1
  • commands.UpdaterManifest (cognitive 25) v3/internal/commands/updater_tool.go:211 — commands.UpdaterManifest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, 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 · parse.parseCmds (cognitive 25) · ×1
  • parse.parseCmds (cognitive 25) v3/internal/wake/parse/parse.go:269 — parse.parseCmds has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 4, match/switch 4, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wake.executeParallel (cognitive 25) · ×1
  • wake.executeParallel (cognitive 25) v3/internal/wake/wake.go:467 — wake.executeParallel has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, loops 11 (nesting depth added 14). Of this number, 19 points are the body's own statements and 6 belong to one function literal inside it that branches. 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 · linuxNotifier.notify (cognitive 25) · ×1
  • linuxNotifier.notify (cognitive 25) v3/pkg/services/notifications/notifications_linux.go:193 — linuxNotifier.notify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, loops 2, boolean chains 1, match/switch 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 · Provider.Download (cognitive 25) · ×1
  • Provider.Download (cognitive 25) v3/pkg/updater/providers/keygen/keygen.go:217 — Provider.Download has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TypeScriptify.getJSONFieldName (cognitive 24) · ×1
  • TypeScriptify.getJSONFieldName (cognitive 24) v2/internal/typescriptify/typescriptify.go:589 — TypeScriptify.getJSONFieldName has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, boolean chains 4, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build.Build (cognitive 24) · ×1
  • build.Build (cognitive 24) v2/pkg/commands/build/build.go:78 — build.Build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, loops 3, match/switch 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 · doctor.checkAndroid (cognitive 24) · ×1
  • doctor.checkAndroid (cognitive 24) v3/internal/doctor/doctor_common.go:72 — doctor.checkAndroid has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, loops 3 (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 · Generator.generateIncludes (cognitive 24) · ×1
  • Generator.generateIncludes (cognitive 24) v3/internal/generator/includes.go:15 — Generator.generateIncludes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, match/switch 2, boolean chains 1, loops 1 (nesting depth added 12). Of this number, 12 points are the body's own statements and 12 belong to one function literal inside it that branches. 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 · setupwizard.checkJDK (cognitive 24) · ×1
  • setupwizard.checkJDK (cognitive 24) v3/internal/setupwizard/wizard_mobile.go:148 — setupwizard.checkJDK has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setupwizard.refreshPath (cognitive 24) · ×1
  • setupwizard.refreshPath (cognitive 24) v3/internal/setupwizard/wizard_windows.go:18 — setupwizard.refreshPath has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, loops 1 (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 · Wizard.pullViaDockerCLI (cognitive 24) · ×1
  • Wizard.pullViaDockerCLI (cognitive 24) v3/internal/setupwizard/wizard.go:984 — Wizard.pullViaDockerCLI has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 2, match/switch 2 (nesting depth added 8). Of this number, 17 points are the body's own statements and 7 belong to one function literal inside it that branches. 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 · Wizard.handleGPGCreate (cognitive 24) · ×1
  • Wizard.handleGPGCreate (cognitive 24) v3/internal/setupwizard/wizard.go:1491 — Wizard.handleGPGCreate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, boolean chains 1, 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 · wake.Execute (cognitive 24) · ×1
  • wake.Execute (cognitive 24) v3/internal/wake/wake.go:64 — wake.Execute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · updater.runHelperSwap (cognitive 24) · ×1
  • updater.runHelperSwap (cognitive 24) v3/pkg/updater/helper.go:88 — updater.runHelperSwap has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, boolean chains 1, 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 · Chromium.initializeController (cognitive 24) · ×1
  • Chromium.initializeController (cognitive 24) v3/internal/webview2/pkg/edge/chromium.go:467 — Chromium.initializeController has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (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 · AssetServer.ServeHTTP (cognitive 23) · ×1
  • AssetServer.ServeHTTP (cognitive 23) v2/pkg/assetserver/assetserver.go:109 — AssetServer.ServeHTTP has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, match/switch 2, boolean chains 1 (nesting depth added 7). Of this number, 19 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build.GenerateNSISInstaller (cognitive 23) · ×1
  • build.GenerateNSISInstaller (cognitive 23) v2/pkg/commands/build/nsis_installer.go:25 — build.GenerateNSISInstaller has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 2, match/switch 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 · generator.GenerateConstants (cognitive 23) · ×1
  • generator.GenerateConstants (cognitive 23) v3/internal/generator/constants.go:11 — generator.GenerateConstants has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 9, boolean chains 1 (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 · module.needsCreateImpl (cognitive 23) · ×1
  • module.needsCreateImpl (cognitive 23) v3/internal/generator/render/create.go:29 — module.needsCreateImpl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 6, boolean chains 2, loops 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 · windowsSystemTray.wndProc (cognitive 23) · ×1
  • windowsSystemTray.wndProc (cognitive 23) v3/pkg/application/systemtray_windows.go:454 — windowsSystemTray.wndProc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, match/switch 3 (nesting depth added 14). 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 · windowsWebviewWindow.processMessageWithAdditionalObjects (cognitive 23) · ×1
  • windowsWebviewWindow.processMessageWithAdditionalObjects (cognitive 23) v3/pkg/application/webview_window_windows.go:2778 — windowsWebviewWindow.processMessageWithAdditionalObjects has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, loops 2 (nesting depth added 13). Of this number, 21 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · fs.CopyDirExtended (cognitive 22) · ×1
  • fs.CopyDirExtended (cognitive 22) v2/internal/fs/fs.go:286 — fs.CopyDirExtended has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · assetHandler.serveFSFile (cognitive 22) · ×1
  • assetHandler.serveFSFile (cognitive 22) v2/pkg/assetserver/assethandler.go:114 — assetHandler.serveFSFile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, 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 · commands.GenerateBuildAssets (cognitive 22) · ×1
  • commands.GenerateBuildAssets (cognitive 22) v3/internal/commands/build-assets.go:96 — commands.GenerateBuildAssets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22 (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.
D2 · Cognitive Complexity · PackageInfo.Index (cognitive 22) · ×1
  • PackageInfo.Index (cognitive 22) v3/internal/generator/collect/index.go:35 — PackageInfo.Index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 2 (nesting depth added 7). Of this number, 12 points are the body's own statements and 10 belong to 2 function literals inside it that branch. 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 · ServiceInfo.Collect (cognitive 22) · ×1
  • ServiceInfo.Collect (cognitive 22) v3/internal/generator/collect/service.go:104 — ServiceInfo.Collect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, match/switch 5, loops 4 (nesting depth added 12). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to one function literal inside it that branches (line 109). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · cmds.parseGoBuildArgs (cognitive 22) · ×1
  • cmds.parseGoBuildArgs (cognitive 22) v3/internal/wake/cmds/shell.go:158 — cmds.parseGoBuildArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, match/switch 2, loops 1 (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 · parse.ExpandTemplates (cognitive 22) · ×1
  • parse.ExpandTemplates (cognitive 22) v3/internal/wake/parse/expr.go:17 — parse.ExpandTemplates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 4, loops 3 (nesting depth added 5). Of this number, 12 points are the body's own statements and 10 belong to 3 function literals inside it that branch. 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 · Model.Update (cognitive 22) · ×1
  • Model.Update (cognitive 22) v3/pkg/doctor-ng/tui/model.go:67 — Model.Update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, match/switch 3, boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · updater.extractZip (cognitive 22) · ×1
  • updater.extractZip (cognitive 22) v3/pkg/updater/extract.go:126 — updater.extractZip has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, loops 2, match/switch 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 · Provider.Check (cognitive 22) · ×1
  • Provider.Check (cognitive 22) v3/pkg/updater/providers/endpoint/endpoint.go:96 — Provider.Check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 1, match/switch 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 · main.main (cognitive 22) · ×1
  • main.main (cognitive 22) v3/scripts/validate-changelog.go:11 — main.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, 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 · main.update (cognitive 21) · ×1
  • main.update (cognitive 21) v2/cmd/wails/update.go:17 — main.update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (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 · ScreenService.ProcessExampleScreens (cognitive 21) · ×1
  • ScreenService.ProcessExampleScreens (cognitive 21) v3/examples/screen/screens.go:34 — ScreenService.ProcessExampleScreens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, loops 1 (nesting depth added 9). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · commands.GenerateSyso (cognitive 21) · ×1
  • commands.GenerateSyso (cognitive 21) v3/internal/commands/syso.go:26 — commands.GenerateSyso has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, boolean chains 1 (nesting depth added 4). Of this number, 19 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · commands.ToolDockerMounts (cognitive 21) · ×1
  • commands.ToolDockerMounts (cognitive 21) v3/internal/commands/tool_docker_mounts.go:58 — commands.ToolDockerMounts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Executor.runForLoop (cognitive 21) · ×1
  • Executor.runForLoop (cognitive 21) v3/internal/wake/exec/exec.go:647 — Executor.runForLoop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, loops 3 (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 · parse.parseFor (cognitive 21) · ×1
  • parse.parseFor (cognitive 21) v3/internal/wake/parse/parse.go:317 — parse.parseFor has cognitive complexity 21 (threshold 15). Drivers by points: loops 9, if/else 8, match/switch 4 (nesting depth added 14). 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.main (cognitive 21) · ×1
  • main.main (cognitive 21) v3/tasks/release/release.go:358 — main.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, match/switch 2, boolean chains 1 (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 · windowsSystemTray.positionWindow (cognitive 21) · ×1
  • windowsSystemTray.positionWindow (cognitive 21) v3/pkg/application/systemtray_windows.go:69 — windowsSystemTray.positionWindow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 4, match/switch 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 · main.generateTemplate (cognitive 20) · ×1
  • main.generateTemplate (cognitive 20) v2/cmd/wails/generate.go:63 — main.generateTemplate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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.
D2 · Cognitive Complexity · fs.CopyDir (cognitive 20) · ×1
  • fs.CopyDir (cognitive 20) v2/internal/fs/fs.go:216 — fs.CopyDir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 1, 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 · commands.IOSXcodeGen (cognitive 20) · ×1
  • commands.IOSXcodeGen (cognitive 20) v3/internal/commands/ios_xcode_gen.go:189 — commands.IOSXcodeGen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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 · commands.UpdaterVerify (cognitive 20) · ×1
  • commands.UpdaterVerify (cognitive 20) v3/internal/commands/updater_tool.go:319 — commands.UpdaterVerify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 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 · generator.resolveTargetPackageName (cognitive 20) · ×1
  • generator.resolveTargetPackageName (cognitive 20) v3/internal/generator/binding_ids.go:297 — generator.resolveTargetPackageName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 3, 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 · Renderer.Models (cognitive 20) · ×1
  • Renderer.Models (cognitive 20) v3/internal/generator/render/renderer.go:91 — Renderer.Models has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 5, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · s.splitShell (cognitive 20) · ×1
  • s.splitShell (cognitive 20) v3/internal/s/s.go:269 — s.splitShell has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 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 · cmds.parseGoTestArgs (cognitive 20) · ×1
  • cmds.parseGoTestArgs (cognitive 20) v3/internal/wake/cmds/shell.go:256 — cmds.parseGoTestArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, match/switch 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · exec.isUpToDate (cognitive 20) · ×1
  • exec.isUpToDate (cognitive 20) v3/internal/wake/exec/runner.go:47 — exec.isUpToDate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 6, 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 · parse.Parse (cognitive 20) · ×1
  • parse.Parse (cognitive 20) v3/internal/wake/parse/parse.go:14 — parse.Parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, match/switch 2, loops 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 · WebviewWindow.HandleMessage (cognitive 20) · ×1
  • WebviewWindow.HandleMessage (cognitive 20) v3/pkg/application/webview_window.go:776 — WebviewWindow.HandleMessage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 2, match/switch 1 (nesting depth added 11). Of this number, 17 points are the body's own statements and 3 belong to one function literal inside it that branches. 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 · updater.copyTree (cognitive 20) · ×1
  • updater.copyTree (cognitive 20) v3/pkg/updater/helper.go:254 — updater.copyTree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · renderer.sponsor (cognitive 19) · ×1
  • renderer.sponsor (cognitive 19) tools/sponsorkit/render.go:291 — renderer.sponsor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, match/switch 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 · Project.setDefaults (cognitive 19) · ×1
  • Project.setDefaults (cognitive 19) v2/internal/project/project.go:155 — Project.setDefaults has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · typeScriptClassBuilder.AddMapField (cognitive 19) · ×1
  • typeScriptClassBuilder.AddMapField (cognitive 19) v2/internal/typescriptify/typescriptify.go:275 — typeScriptClassBuilder.AddMapField has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 2 (nesting depth added 2). 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 · build.SyncFrontendDistToEmbedTarget (cognitive 19) · ×1
  • build.SyncFrontendDistToEmbedTarget (cognitive 19) v2/pkg/commands/build/build.go:176 — build.SyncFrontendDistToEmbedTarget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, loops 2 (nesting depth added 5). Of this number, 16 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build.executeBuildHook (cognitive 19) · ×1
  • build.executeBuildHook (cognitive 19) v2/pkg/commands/build/build.go:495 — build.executeBuildHook has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, loops 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 · commands.generatePGPKeyForSetup (cognitive 19) · ×1
  • commands.generatePGPKeyForSetup (cognitive 19) v3/internal/commands/signing_setup.go:521 — commands.generatePGPKeyForSetup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, loops 2 (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 · commands.ToolPackage (cognitive 19) · ×1
  • commands.ToolPackage (cognitive 19) v3/internal/commands/tool_package.go:16 — commands.ToolPackage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, 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 · commands.collectUpdaterArtifacts (cognitive 19) · ×1
  • commands.collectUpdaterArtifacts (cognitive 19) v3/internal/commands/updater_tool.go:595 — commands.collectUpdaterArtifacts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 3 (nesting depth added 10). Of this number, 18 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · Reporter.writePanelLocked (cognitive 19) · ×1
  • Reporter.writePanelLocked (cognitive 19) v3/internal/report/pulse/summary.go:450 — Reporter.writePanelLocked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 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 · templates.GenerateTemplate (cognitive 19) · ×1
  • templates.GenerateTemplate (cognitive 19) v3/internal/templates/templates.go:542 — templates.GenerateTemplate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19 (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 · wake.filterTaskNamespaces (cognitive 19) · ×1
  • wake.filterTaskNamespaces (cognitive 19) v3/internal/wake/wake.go:325 — wake.filterTaskNamespaces has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, loops 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 · application.changedLinuxWindowStateEvents (cognitive 19) · ×1
  • application.changedLinuxWindowStateEvents (cognitive 19) v3/pkg/application/webview_window_linux.go:58 — application.changedLinuxWindowStateEvents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19 (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 · windowsDialog.show (cognitive 19) · ×1
  • windowsDialog.show (cognitive 19) v3/pkg/application/dialogs_windows.go:33 — windowsDialog.show has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, 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 · w32.ComInvoke (cognitive 19) · ×1
  • w32.ComInvoke (cognitive 19) v3/pkg/w32/utils.go:125 — w32.ComInvoke has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 3, match/switch 3, boolean chains 1 (nesting depth added 8). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · stdoutScanner.Write (cognitive 18) · ×1
  • stdoutScanner.Write (cognitive 18) v2/cmd/wails/internal/dev/stdout_scanner.go:32 — stdoutScanner.Write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2 (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 · Bindings.hasExportedJSONFields (cognitive 18) · ×1
  • Bindings.hasExportedJSONFields (cognitive 18) v2/internal/binding/binding.go:351 — Bindings.hasExportedJSONFields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 2 (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 · BaseBuilder.BuildFrontend (cognitive 18) · ×1
  • BaseBuilder.BuildFrontend (cognitive 18) v2/pkg/commands/build/base.go:549 — BaseBuilder.BuildFrontend has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · AssetServer.processWebViewRequestInternal (cognitive 18) · ×1
  • AssetServer.processWebViewRequestInternal (cognitive 18) v3/internal/assetserver/assetserver_webview.go:66 — AssetServer.processWebViewRequestInternal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 3. Of this number, 16 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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 · ChangelogEntry.FormatForChangelog (cognitive 18) · ×1
  • ChangelogEntry.FormatForChangelog (cognitive 18) v3/internal/changelog/parser.go:132 — ChangelogEntry.FormatForChangelog has cognitive complexity 18 (threshold 15). Drivers by points: loops 12, if/else 6 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ChangelogEntry.FormatForRelease (cognitive 18) · ×1
  • ChangelogEntry.FormatForRelease (cognitive 18) v3/internal/changelog/parser.go:187 — ChangelogEntry.FormatForRelease has cognitive complexity 18 (threshold 15). Drivers by points: loops 12, if/else 6 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · commands.loadIOSProjectConfig (cognitive 18) · ×1
  • commands.loadIOSProjectConfig (cognitive 18) v3/internal/commands/ios_xcode_gen.go:115 — commands.loadIOSProjectConfig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. 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 · fileexplorer.ParseDesktopReader (cognitive 18) · ×1
  • fileexplorer.ParseDesktopReader (cognitive 18) v3/internal/fileexplorer/desktopfile.go:34 — fileexplorer.ParseDesktopReader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · module.renderMapType (cognitive 18) · ×1
  • module.renderMapType (cognitive 18) v3/internal/generator/render/type.go:132 — module.renderMapType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 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 · parse.parseTask (cognitive 18) · ×1
  • parse.parseTask (cognitive 18) v3/internal/wake/parse/parse.go:163 — parse.parseTask has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, match/switch 2, loops 1 (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 · application.getMethods (cognitive 18) · ×1
  • application.getMethods (cognitive 18) v3/pkg/application/bindings.go:208 — application.getMethods has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 5, 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 · App.Run (cognitive 18) · ×1
  • App.Run (cognitive 18) v3/pkg/application/application.go:560 — App.Run has cognitive complexity 18 (threshold 15). Drivers by points: loops 9, if/else 8, boolean chains 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · doctorng.collectGPUs (cognitive 18) · ×1
  • doctorng.collectGPUs (cognitive 18) v3/pkg/doctor-ng/hardware.go:44 — doctorng.collectGPUs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Provider.Check (cognitive 18) · ×1
  • Provider.Check (cognitive 18) v3/pkg/updater/providers/keygen/keygen.go:102 — Provider.Check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, match/switch 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.
D2 · Cognitive Complexity · main.createGitHubRelease (cognitive 18) · ×1
  • main.createGitHubRelease (cognitive 18) v3/tasks/release/release.go:944 — main.createGitHubRelease has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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 · main.changelogMentions (cognitive 17) · ×1
  • main.changelogMentions (cognitive 17) tools/sponsorkit/contributors.go:180 — main.changelogMentions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 3, boolean chains 2 (nesting depth added 8). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · gomod.SyncGoMod (cognitive 17) · ×1
  • gomod.SyncGoMod (cognitive 17) v2/cmd/wails/internal/gomod/gomod.go:16 — gomod.SyncGoMod has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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 · commands.generateAppImage (cognitive 17) · ×1
  • commands.generateAppImage (cognitive 17) v3/internal/commands/appimage.go:76 — commands.generateAppImage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 1, match/switch 1 (nesting depth added 3). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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 · commands.findGTKFiles (cognitive 17) · ×1
  • commands.findGTKFiles (cognitive 17) v3/internal/commands/appimage.go:242 — commands.findGTKFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 4 (nesting depth added 6). Of this number, 10 points are the body's own statements and 7 belong to one function literal inside it that branches. 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 · commands.resolveSigningDefaults (cognitive 17) · ×1
  • commands.resolveSigningDefaults (cognitive 17) v3/internal/commands/sign.go:21 — commands.resolveSigningDefaults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. 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 · Reporter.writePhaseBarLocked (cognitive 17) · ×1
  • Reporter.writePhaseBarLocked (cognitive 17) v3/internal/report/pulse/summary.go:164 — Reporter.writePhaseBarLocked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 5, boolean chains 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 · setupwizard.checkWebView2 (cognitive 17) · ×1
  • setupwizard.checkWebView2 (cognitive 17) v3/internal/setupwizard/wizard_windows.go:133 — setupwizard.checkWebView2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 4, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Wizard.handleNotarizeCreate (cognitive 17) · ×1
  • Wizard.handleNotarizeCreate (cognitive 17) v3/internal/setupwizard/wizard.go:1384 — Wizard.handleNotarizeCreate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · templates.parseTemplate (cognitive 17) · ×1
  • templates.parseTemplate (cognitive 17) v3/internal/templates/templates.go:216 — templates.parseTemplate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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 · resolve.MergeTask (cognitive 17) · ×1
  • resolve.MergeTask (cognitive 17) v3/internal/wake/resolve/merge.go:40 — resolve.MergeTask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3. 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 · Info.discover (cognitive 16) · ×1
  • Info.discover (cognitive 16) v2/internal/system/system_linux.go:62 — Info.discover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (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 · TypeScriptify.AddEnum (cognitive 16) · ×1
  • TypeScriptify.AddEnum (cognitive 16) v2/internal/typescriptify/typescriptify.go:340 — TypeScriptify.AddEnum has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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 · assetHandler.ServeHTTP (cognitive 16) · ×1
  • assetHandler.ServeHTTP (cognitive 16) v2/pkg/assetserver/assethandler.go:81 — assetHandler.ServeHTTP has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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 · build.CreateEmbedDirectories (cognitive 16) · ×1
  • build.CreateEmbedDirectories (cognitive 16) v2/pkg/commands/build/build.go:249 — build.CreateEmbedDirectories has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 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 · BaseBuilder.OutputFilename (cognitive 16) · ×1
  • BaseBuilder.OutputFilename (cognitive 16) v2/pkg/commands/build/base.go:122 — BaseBuilder.OutputFilename has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 2 (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 · BaseBuilder.NpmInstallUsingCommand (cognitive 16) · ×1
  • BaseBuilder.NpmInstallUsingCommand (cognitive 16) v2/pkg/commands/build/base.go:453 — BaseBuilder.NpmInstallUsingCommand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · main.main (cognitive 16) · ×1
  • main.main (cognitive 16) v3/examples/window/main.go:73 — main.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 1. Of this number, 11 points are the body's own statements and 5 belong to 4 function literals inside it that branch. 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 · doctor.getDefaultGPGKey (cognitive 16) · ×1
  • doctor.getDefaultGPGKey (cognitive 16) v3/internal/doctor/signing.go:166 — doctor.getDefaultGPGKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 4 (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 · Reporter.writeSlowestLocked (cognitive 16) · ×1
  • Reporter.writeSlowestLocked (cognitive 16) v3/internal/report/pulse/summary.go:363 — Reporter.writeSlowestLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 3, boolean chains 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 · pullParser.calculateProgress (cognitive 16) · ×1
  • pullParser.calculateProgress (cognitive 16) v3/internal/setupwizard/wizard.go:147 — pullParser.calculateProgress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 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 · Executor.resolveDepVars (cognitive 16) · ×1
  • Executor.resolveDepVars (cognitive 16) v3/internal/wake/exec/exec.go:163 — Executor.resolveDepVars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · override.LoadLocal (cognitive 16) · ×1
  • override.LoadLocal (cognitive 16) v3/internal/wake/override/override.go:26 — override.LoadLocal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 3 (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 · parse.parseDeps (cognitive 16) · ×1
  • parse.parseDeps (cognitive 16) v3/internal/wake/parse/parse.go:240 — parse.parseDeps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 4, match/switch 4 (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 · ScreenManager.deIntersectScreens (cognitive 16) · ×1
  • ScreenManager.deIntersectScreens (cognitive 16) v3/pkg/application/screenmanager.go:674 — ScreenManager.deIntersectScreens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 7, boolean chains 1 (nesting depth added 6). Of this number, 14 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · ScreenManager.screenNearestRect (cognitive 16) · ×1
  • ScreenManager.screenNearestRect (cognitive 16) v3/pkg/application/screenmanager.go:808 — ScreenManager.screenNearestRect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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 · combridge.new (cognitive 16) · ×1
  • combridge.new (cognitive 16) v3/internal/webview2/pkg/combridge/bridge.go:59 — combridge.new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 4 (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 · windowOpenFileDialog.show (cognitive 16) · ×1
  • windowOpenFileDialog.show (cognitive 16) v3/pkg/application/dialogs_windows.go:111 — windowOpenFileDialog.show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 1 (nesting depth added 6). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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 · windowsDock.SetCustomBadge (cognitive 16) · ×1
  • windowsDock.SetCustomBadge (cognitive 16) v3/pkg/services/dock/dock_windows.go:132 — windowsDock.SetCustomBadge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 3 (nesting depth added 5). Most of this is not in the body itself: 0 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 133). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D36 · Supply-chain Provenance & Signing · Unpinned build actions · ×1
  • Unpinned build actions — CI references GitHub Actions by a floating ref (@main / @tag) rather than a pinned commit SHA, weakening build integrity. 84 floating ref(s) across 19 workflow file(s). Each floating ref is itemized at file:line by the SAST (D29) lens.
D36 · Supply-chain Provenance & Signing · PR-triggered workflow without a permissions block · ×1
  • PR-triggered workflow without a permissions block — 2 workflow(s) triggered by pull_request declare no `permissions:` block (semgrep.yml, build-and-test-v3.yml) and so run with the repository's default GITHUB_TOKEN scope, while 14 sibling workflows in the same repository are already scoped. Pull-request runs build the least-trusted code in the repository; give each of these workflows its own least-privilege block — `permissions: {contents: read}` at the top of the workflow, widened per job only where a job genuinely writes.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) tools/sponsorkit/render.go:257 — tools/sponsorkit/render.go:257-270 | tools/sponsorkit/render_contributors.go:162-175 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/sponsorkit/render.go:257` 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) · ×1
  • Duplicated block (12 lines × 2) tools/sponsorkit/contributors.go:275 — tools/sponsorkit/contributors.go:275-286 | tools/sponsorkit/github.go:103-114 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/sponsorkit/contributors.go:275` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) tools/sponsorkit/contributors.go:290 — tools/sponsorkit/contributors.go:290-297 | tools/sponsorkit/github.go:119-126 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1
  • Duplicated block (7 lines × 2) tools/sponsorkit/render.go:76 — tools/sponsorkit/render.go:76-83 | tools/sponsorkit/render_contributors.go:119-125 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/sponsorkit/render.go:76` 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.
Recommendation — 5 finding(s)
D11 · Test Reliability · Test reliability not included · ×1
  • Test reliability not included — Test source is present (.js) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: tools/sponsorkit/render.go, tools/sponsorkit/config.go, tools/sponsorkit/avatar.go, tools/sponsorkit/main.go. Pair on, review, or document these before any departure.
D31 · IaC & Container Security · Low IaC · ×1
  • Low IaC: DS-0026 v3/internal/commands/build_assets/docker/Dockerfile.server — No HEALTHCHECK defined Without one the runtime only knows whether the process is alive, not whether it is serving, so a wedged container is restarted by nobody. The step: add a `HEALTHCHECK` to the image that probes the service the way a client would — this image already declares `EXPOSE 8080`, so a request to `localhost:8080` on the service's own health or root route, exiting non-zero when it does not answer, is the probe — and give it an `--interval`, a `--timeout` and a `--start-period` long enough to cover startup. If the image ships no HTTP client, probe with whatever the runtime already has, or declare the check in the orchestrator instead and say so here.
D36 · Supply-chain Provenance & Signing · No SBOM · ×1
  • No SBOM — No SBOM generation or committed SBOM found — produce one with what your ecosystem ships (`syft` (or `anchore/sbom-action` in CI) over the source tree or released image). Your CI already runs an attestation step, so the cheapest route is to emit the SBOM there and attach it as a subject rather than adding a separate pipeline.
D8 · Code Coverage · Coverage not included · ×1
  • Coverage not included — suite not readable by the collector — Coverage NOT MEASURED: test source is present (.js) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored.
Info — 2 finding(s)
D12 · Dependency Hygiene · Dependency hygiene not measured · ×1
  • Dependency hygiene not measured — dependency manifest found but not parsed for hygiene — This repository's dependency manifests (a Go module (go.mod/go.sum) and package.json) were found, but this pass cannot parse them for hygiene, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D38 wherever the manifest is OSV-readable.
D22 · Internal API Consistency · No exposed public API · ×1
  • No exposed public API — No intentionally-exposed types (IsPackable or .Contracts) to evaluate.

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)gitleaksgitleaks detect --no-banner --report-format json --report-path /dev/stdout --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D29 · Static Analysis (SAST)semgrepsemgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --json --quiet --timeout 0 --metrics off .70artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnone (no readable dependency manifest)none (no readable dependency manifest): not present in this environment0
D31 · IaC & Container Securitytrivytrivy config --format json --quiet .7artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrepsemgrep --config /opt/semgrep-rules/gdpr.yml --json --quiet --timeout 0 --metrics off .1artifacts/raw/semgrep-gdpr.json
D33 · JS/npm Dependency Vulnerabilitiestrivytrivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0
D38 · OSV Dependency Vulnerabilitiesosv-scannerosv-scanner --format json --recursive .21artifacts/raw/osv-scanner.json
D40 · Network Egress Confinementruntime-hardeningruntime-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-hardeningruntime-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-hardeningruntime-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

Run 019fd5e8-c85f-7121-8d39-c6d8afd1f4bb · 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