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

bernaferrari/ChangeDetection

Measured 17 November 2026, 03:33 UTC, at code version e0b7b81

First survey, so nothing to compare with yet
CAI score 50.6out of 100 Adequate
CriticalWeakAdequateStrongExemplary

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

A medium codebase: 35,183 lines of product code in 8 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Production Readiness, 43.0

Findings by how serious they are

21 critical 232 serious 28 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 03:33 UTC

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

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

61of 61 dimensions measured by tools.
269of 281 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
61dimensions across 7 lenses, read from 35,183 lines of product code in 8 projects.
Chapters

Executive summary

bernaferrari/ChangeDetection falls short of our standard for production because we found no automated security scanning of the code, its secrets or its dependencies. It scores 50.6 out of 100 and is rated Adequate, and all 21 of its critical findings are security problems.

Production Readiness, at 43.0, is the weakest lens and counts most in the score. The best first step for the work it takes is recording design decisions, worth about 2.5 points. Adding automated security scanning would lift Production Readiness itself, worth about 4.3 points. Raising Production Readiness to 70 would lift the score to about 55.8.

Fourteen pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Three passwords or keys are open to anyone who can read the repository, and three weaknesses in the code could be used by an attacker. Pinning each tool to an exact version, replacing each exposed password or key and fixing the weaknesses the scanner points to would close these risks. Setting a waiting period for automatic updates would fix the automatic dependency update that takes a new release at once.

The product code is 35,183 lines, about €54,000 to rebuild.

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

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

If Production Readiness rose from 43.0 to 70, the lowest score rated Strong, the score would rise from 50.6 to about 55.8.

Code composition: what the lines of code are
Product code 61%Tests 39%
Rebuild cost: about €54,000 · Estimate
Cost to rebuild€18,000 to €91,000, for 301 to 954 hours of work, about 0.4 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 51. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 35,183 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with build.gradle.kts.
Raises the score by about 2.5 points · Low effort · ADR Quality
2
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Raises the score by about 4.3 points · Medium effort · Security & performance tooling
3
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Raises the score by about 4.1 points · Medium effort · Type Safety

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €54,000 to build again, about 0.4 person-years of work. Its weakest lens is Production Readiness, at 43.0 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 2.5 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 119,179 lines over the last 90 days, which is about 483,337 lines a year. At that pace, the extra work comes to an estimated 24.2 to 161.1 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

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

arch :androidApp :androidApp :shared :shared :androidApp->:shared :sqliteWasmWorker :sqliteWasmWorker :shared->:sqliteWasmWorker :webDemo :webDemo :webDemo->:shared :webDemo->:sqliteWasmWorker codehealth-iso-9d34f4d7c2494277a85afad017573234 codehealth-iso-9d34f4d7c2494277a85afad017573234 sqlite-wasm-worker sqlite-wasm-worker website website

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

193 modules, with 272 dependencies between them. 6 loops run through 16 of the modules, marked above the diagonal.

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 detection2 logging3 model4 preview.EditSegment5 platform6 repo7 addedit.AddEditViewModel8 error9 image10 repo.source11 util12 diagnostics13 preview14 storage15 sync.SyncEngine.FetchResult16 addedit.CapturePreview17 browser18 preview.ChangePreview19 repo.source.local20 ui.comparison.ReaderBlock21 addedit.CapturePreviewState22 sync23 ui.comparison.ReaderItem24 ui.components25 ui.kit26 background27 sync.AndroidScreenshotBrowserFactory28 addedit29 backup30 ui.comparison31 ui.settings32 addedit.LivePageCapture33 backup.BackupFiles34 ui.main35 com.bernaferrari.changedetection36 ui.detail37 ui.home38 di39 ui.logs.HistoryPreviewContent40 ui.logs
1 detection
2 logging
3 model
4 preview.EditSegment
5 platform1
6 repo2
7 addedit.AddEditViewModel11
8 error11
9 image111
10 repo.source11
11 util1
12 diagnostics1234
13 preview21121
14 storage1224
15 sync.SyncEngine.FetchResult1
16 addedit.CapturePreview122
17 browser323
18 preview.ChangePreview29
19 repo.source.local113212
20 ui.comparison.ReaderBlock12
21 addedit.CapturePreviewState26
22 sync51843121217
23 ui.comparison.ReaderItem124
24 ui.components132
25 ui.kit3122
26 background3415
27 sync.AndroidScreenshotBrowserFactory112
28 addedit2012211311411
29 backup52131
30 ui.comparison111618213211
31 ui.settings11441121
32 addedit.LivePageCapture444
33 backup.BackupFiles112
34 ui.main16331231
35 com.bernaferrari.changedetection44122381
36 ui.detail512211
37 ui.home11
38 di22155114135111
39 ui.logs.HistoryPreviewContent12
40 ui.logs15211121
Uses a module listed above itPart of a loopThe module itself
1 detection2 logging3 model4 preview.EditSegment5 platform6 repo7 addedit.AddEditViewModel8 error9 image10 repo.source11 util12 diagnostics13 preview14 storage15 sync.SyncEngine.FetchResult16 addedit.CapturePreview17 browser18 preview.ChangePreview19 repo.source.local20 ui.comparison.ReaderBlock21 addedit.CapturePreviewState22 sync23 ui.comparison.ReaderItem24 ui.components25 ui.kit26 background27 sync.AndroidScreenshotBrowserFactory28 addedit29 backup30 ui.comparison31 ui.settings32 addedit.LivePageCapture33 backup.BackupFiles34 ui.main35 com.bernaferrari.changedetection36 ui.detail37 ui.home38 di39 ui.logs.HistoryPreviewContent40 ui.logsdetection1logging2model3preview.EditSegment4platform5repo6addedit.AddEditViewModel7error8image9repo.source10util11diagnostics12preview13storage14sync.SyncEngine.FetchResult15addedit.CapturePreview16browser17preview.ChangePreview18repo.source.local19ui.comparison.ReaderBlock20addedit.CapturePreviewState21sync22ui.comparison.ReaderItem23ui.components24ui.kit25background26sync.AndroidScreenshotBrowserFactory27addedit28backup29ui.comparison30ui.settings31addedit.LivePageCapture32backup.BackupFiles33ui.main34com.bernaferrari.changedetection35ui.detail36ui.home37di38ui.logs.HistoryPreviewContent39ui.logs4012111111111112342112112241122323291132121226518431212171241323122341511220122113114115213111161821321111441121444112163312314412238151221111221551141351111215211121+153 more modules (most-connected shown)

At a glance — Code Health · 43.6 · Weak · gated by D2, R1, R2 ·

At a glance — Architecture · 95.7 · Exemplary ·

At a glance — Maturity · 59.4 · Adequate · gated by M2 ·

At a glance — Readiness · 43.0 · Weak · gated by P3 ·

At a glance — Security · 61.2 · Adequate · gated by D36 ·

At a glance — Accessibility · 88.0 · Strong ·

At a glance — Performance · 100.0 · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection18High / Critical
A07:2025 — Authentication Failures4High / Critical
A03:2025 — Software Supply Chain Failures4Medium

Roadmap

Top priorities: Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing; Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up; Resolve the 1 finding(s) in Cyclomatic Complexity.

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

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with build.gradle.kts.+2.5 ptsLowADR Quality
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.+4.3 ptsMediumSecurity & performance tooling
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.+4.1 ptsMediumType Safety
Resolve the 1 finding(s) in Cyclomatic Complexity.+2.8 ptsMediumCyclomatic Complexity
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+2.4 ptsMediumArchitecture documentation
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).+1.7 ptsMediumDR & Backup
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.+1.3 ptsMediumObservability
Resolve the 1 `encodeURLParameter` spells `URL` where 55 names in the project spell it… finding(s) in Naming Consistency — start with PlatformUtils.kt.+0.6 ptsLowNaming Consistency

File quality

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

FileScoreBandWorst signal
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt5.1MixedCyclomatic Complexity: AppContentKt.ChangeDetectionApp (cyclomatic 28)
REDACTED5.8MixedSecrets (history): REDACTED: REDACTED
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt7.0MixedCyclomatic Complexity: HomeScreenKt.HomeScreen (cyclomatic 42)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt7.0MixedCyclomatic Complexity: VisualRegions.compare (cyclomatic 36)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt7.0MixedCyclomatic Complexity: AddEditConfirmComponentsKt.AddEditConfirmScreen (cyclomatic 67)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt7.0MixedCyclomatic Complexity: SyncEngine.processSuccessResult (cyclomatic 38)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt7.1MixedCyclomatic Complexity: AddEditViewModel.performSave (cyclomatic 25)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt7.1MixedCyclomatic Complexity: ErrorHandler.classifyError (cyclomatic 24)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt7.2MixedCyclomatic Complexity: ComparisonScreenKt.ComparisonScreen (cyclomatic 65)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt7.2MixedCyclomatic Complexity: KitKt.PageAvatar (cyclomatic 31)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt7.2MixedCyclomatic Complexity: PageDetailScreenKt.DetailList (cyclomatic 29)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt7.2MixedCyclomatic Complexity: ActivityScreenKt.ActivityFeed (cyclomatic 25)
shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt7.2MixedCyclomatic Complexity: AndroidPageCapture.captureLoaded (cyclomatic 22)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt7.2MixedCyclomatic Complexity: BackupService.import (cyclomatic 17)
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt7.2MixedCyclomatic Complexity: ChangePreviewViewsKt.PreviewBody (cyclomatic 17)
REDACTED7.2MixedSecrets (history): REDACTED: REDACTED
REDACTED7.2MixedStatic Analysis (SAST): High: REDACTED
shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt7.4MixedCyclomatic Complexity: WatchBrowserKt.WatchBrowser (cyclomatic 27)

How the grades work

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

Critical — 21

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 232

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 28

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

Could not be resolved — 13

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

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 61 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

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

What we checked — 61 dimensions across the health lenses
D1D2D3D4D5D6D12D13D14D15D17D19D20D21D26D27D28D29D30D34D35D36D43D44AC2AC3AC5AC6AX10AX3AX4AX6M1M2M3M4P1P2P3P5P6PF3R1R10R2R3R6R8R9X1X12X16X18X2X21X25X27X28X29X3X5

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, 269 of 281 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1e790-fed3-764f-b4c9-2b888e1419e3.

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.

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.kt) 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.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.kt) and this repository declares a JVM test suite (repository root, Gradle), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Gradle build (build.gradle/build.gradle.kts), but the licence verdict published here was taken over its gem dependencies. Nothing was read about its Gradle dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its gem dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (8 contributor(s) across 422 commit(s) sampled, automation and bot accounts excluded). One of them holds 98% of the history; the other 7 hold 0.3% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidScreenshotSyncer.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewer.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/TextRegionPicker.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt`, … (+11 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • AX1 Captive dependencies — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository's container is Koin, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The dev server exited, and its output does not match a cause we recognise. (rule: unrecognised-exit). The renderer reported: the dev server (`npm run dev`) exited before it served a page. Likely cause (not identified): the dev server exited, and its output does not match a cause we recognise. Last output: "npm error code EBADDEVENGINES / npm error EBADDEVENGINES The developer of this package has specified the following through devEngines / npm error EBADDEVENGINES Invalid engine "packageManager" / npm error EBADDEVENGINES Invalid name "yarn" does not match "npm" for "packageManager" / npm error EBADDEVENGINES { / npm error EBADDEVENGINES current: { name: 'npm', version: '10.9.2' }, / npm error EBADDEVENGINES required: { name: 'yarn', version: '^1.22.22' } / npm error EBADDEVENGINES } / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Boot via AndroidApp (androidApp). the Android app did not build — `./gradlew :androidApp:assembleDebug` exited 1: false}) from 'https://api.foojay.io/disco/v3.0/ids/50dff0498c7a09126e3b7e7f2749f324/redirect', due to: Could not HEAD 'https://api.foojay.io/disco/v3.0/ids/50dff0498c7a09126e3b7e7f2749f324/redirect'.…; runtime evidence skipped (launch chosen because androidApp/build.gradle.kts applies the Android application plugin and gradlew builds it).
  • C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java source only, and this repository's Kotlin, Swift is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and this repository's Kotlin, Swift is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • 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.

Dimensions

D1 · Cyclomatic Complexity6.0 / 10Adequate✓ Tool-verified

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

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

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

46 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was AddEditConfirmComponentsKt.AddEditConfirmScreen at 67. A further 3 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 CheckFailureNoticeKt.checkFailureTitle at 22 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/CheckFailureNotice.kt (CheckFailureNoticeKt.checkFailureTitle at 22). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

AddEditConfirmComponentsKt.AddEditConfirmScreen (cyclomatic 67)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:91
ComparisonScreenKt.ComparisonScreen (cyclomatic 65)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152
HomeScreenKt.HomeScreen (cyclomatic 42)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:152
CheckFailure.from (cyclomatic 39)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt:47
SyncEngine.processSuccessResult (cyclomatic 38)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:329

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

What to do

  1. Bring the 8 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with AddEditConfirmComponentsKt.AddEditConfirmScreen (cyclomatic 67), ComparisonScreenKt.ComparisonScreen (cyclomatic 65), HomeScreenKt.HomeScreen (cyclomatic 42). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 8 together lifts Cyclomatic Complexity from 6.0 to about 7.1/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

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

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

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

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

79 method(s) exceeded the cognitive complexity threshold of 15; the worst was AddEditConfirmComponentsKt.AddEditConfirmScreen at 85.

AddEditConfirmComponentsKt.AddEditConfirmScreen (cognitive 85)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:91
ComparisonScreenKt.ComparisonScreen (cognitive 83)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152
HomeScreenKt.HomeScreen (cognitive 59)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:152
VisualRegions.compare (cognitive 53)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:89
VisualRegions.sameAfterShift (cognitive 52)shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:460

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

What to do

  1. Bring the 2 bodies over 60 down to 60 or less in Cognitive Complexity — start with AddEditConfirmComponentsKt.AddEditConfirmScreen (cognitive 85), ComparisonScreenKt.ComparisonScreen (cognitive 83). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cognitive Complexity from 4.0 to about 4.8/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

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

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

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

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

14 god class(es) detected.

MethodTooLong: ComparisonScreenKt.ComparisonScreen · ×6shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152
FileTooLong: addedit/AddEditConfirmComponents.kt · ×5shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt
ClassTooLong: SyncEngine · ×2shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:64
FunctionTooLong: page.Homewebsite/app/page.tsx:28

What to do

  1. Resolve the 6 MethodTooLong finding(s) in God Classes — start with ComparisonScreen.kt, HomeScreen.kt, WatchBrowser.kt. — One of this dimension's main actionable groups (6 warning-level).
  2. Resolve the 5 FileTooLong finding(s) in God Classes — start with AddEditConfirmComponents.kt, HomeScreen.kt, PageDetailScreen.kt. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 2 ClassTooLong finding(s) in God Classes — start with SyncEngine.kt, VisualRegions.kt. — One of this dimension's main actionable groups (2 warning-level).

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

D4 · Code Duplication9.1 / 10Stronggated by 27 serious findings✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

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

15 duplicated block group(s) detected. 2.3 % of the production lines (811 of 35,183) are in a reported copy. A further 12 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (9 lines × 2) · ×3shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:284
Edited copy of a member (1 corresponding lines) · ×2shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/DesktopPlatform.kt:93
Duplicated block (10 lines × 2) · ×2shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/CryptoUtils.kt:9
Duplicated block (8 lines × 2) · ×2shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:202
Edited copy of a member (72 corresponding lines)shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/PlatformImageDiff.desktop.kt:18

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

What to do

  1. Resolve the 3 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with AppContent.kt, RenderedSelectionDocument.kt, BackupService.kt. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 2 Edited copy of a member (1 corresponding lines) finding(s) in Code Duplication — start with DesktopPlatform.kt, TlsFailure.android.kt. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with CryptoUtils.kt, UnifiedDiffUtils.kt. — One of this dimension's main actionable groups (2 warning-level).

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

D5 · Coupling8.9 / 10Strong✓ Tool-verified

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

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

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

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

7 production modules (Gradle+npm), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 1 module(s) off the main sequence, with abstractness counted on 6 of the 7 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Off the main sequence: :sqliteWasmWorker

What to do

  1. Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

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

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

0 of 55 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D12 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

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

0 outdated direct gem(s), 0 pinning defect(s). 1 declaration(s) graded against rubygems.org, none of them against a committed Gemfile.lock — this repository commits none, which a published gem correctly does not, so currency is read off the declared requirements: a declaration that does not cap below the current release resolves to it on `bundle install`. 1 declaration(s) carry a requirement that EXCLUDES the current release; that is a deliberate constraint (a supported-version ceiling or a held-back CI pin) and is counted, not charged. Whether any of these gems is DEPRECATED or YANKED is not graded — rubygems.org publishes no deprecation marker, and a yank removes a version rather than flagging it. Whether any is UNMAINTAINED is not graded either: no registry publishes a maintenance status, and release age does not stand in for one. Whether any is UNUSED is a source question, not a registry one. Known CVEs in this dependency graph are D30's question, read from the manifest there.

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md.

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

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

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

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

REDACTED scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 105 shipped gem(s) use a banned license. Licences were resolved from rubygems.org over the 105 gem(s) a consumer installs — this repository's runtime declarations closed transitively over its committed Gemfile.lock. Development-group and `add_development_dependency` gems are excluded: they are not distributed with this repository. 1 of them publish no licence on rubygems.org; that is missing data, not a violation, and none of them is charged. ★ COVERAGE OF THIS VERDICT: it grades this repository's gem dependencies and nothing else. The repository also declares a Gradle build (build.gradle/build.gradle.kts) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.5 / 10Stronggated by 27 serious findings✓ Tool-verified

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

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

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

Top hotspots: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt (30×67=2010); shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt (25×65=1625); shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt (27×42=1134)

Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt · ×27shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:91

What to do

  1. Resolve the 27 Hotspot finding(s) in Churn × Complexity Hotspots — start with AddEditConfirmComponents.kt, ComparisonScreen.kt, HomeScreen.kt. — One of this dimension's main actionable groups (27 warning-level).

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

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

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

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

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

0 deducted task-comment markers across 35183 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

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

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

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

1 of 1 documentation facets pass in full. 7 document(s) read across 3 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

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

No architecture decision records were found.

No ADRs foundshared/build.gradle.kts:208

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with build.gradle.kts. — One of this dimension's main actionable groups (1 recommendation-level).

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

D21 · Naming Consistency8.0 / 10Strong✓ Tool-verified

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

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

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

1 naming inconsistencies among 50 declarations measured against a convention their peers follow.

`encodeURLParameter` spells `URL` where 55 names in the project spell it `Url`shared/src/iosMain/kotlin/com/bernaferrari/changedetection/platform/PlatformUtils.kt:64

What to do

  1. Resolve the 1 `encodeURLParameter` spells `URL` where 55 names in the project spell it… finding(s) in Naming Consistency — start with PlatformUtils.kt. — One of this dimension's main actionable groups (1 recommendation-level).

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

D26 · Project Cohesion7.5 / 10Strong✓ Tool-verified

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

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

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

1 of 8 build units (Gradle, Xcode, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesionshared/build.gradle.kts:1

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with build.gradle.kts. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)7.0 / 10Adequategated by 3 critical findings✓ Tool-verified

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

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

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

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

REDACTED
REDACTED

What to do

  1. Resolve the 3 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

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

D29 · Static Analysis (SAST)5.0 / 10Adequate✓ Tool-verified

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

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

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

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

18 finding(s): 0 critical, 18 high, 0 medium, 0 low. 14 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 2 file(s) — `gradlew` (line 74, line 178), `website/lib/site.ts` (lines 32–40) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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

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

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

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

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_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: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

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

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change Coupling10.0 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

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

Strongest change-coupling: AppContent.kt↔ComparisonScreen.kt 50%; AppContent.kt↔SettingsScreen.kt 50%

Change coupling: AppContent.kt ↔ ComparisonScreen.kt · ×2shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:1

What to do

  1. Resolve the 2 Change coupling finding(s) in Change Coupling — start with AppContent.kt (2). — One of this dimension's main actionable groups (2 warning-level).

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

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged

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

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

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

AC3 · Page structure6.7 / 10Adequate✓ Tool-verified

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

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

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

  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — webDemo/src/wasmJsMain/resources/index.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.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  • `SnapsDataSource` declares 20 abstract methods: `observeStorageBytes`, `observeOlderVersionBytes`, `clearOlderVersions`, `deleteSiteWithSnaps`, `getContentTypeInfo`, `getMostRecentSnap`, `getAllMostRecentSnaps`, `getSnaps`, `observeSnapsTable`, `getSnapsFiltered`, `getAllSnapsForSite`, `getSnapById`, `getSnapContent`, `getLastNSnapsForSiteId`, `getSnapPair`, `deleteSnap`, `pruneSnaps`, `getSingleSnapPair`, `getLastContentHash`, `getLastProcessedContentHash`. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/SnapsDataSource.kt:11
  • `SitesDao` declares 21 abstract methods: `getSitesList`, `getDataWithChanges`, `observeWatchlist`, `getSiteById`, `getSiteByUrl`, `insertSite`, `updateSite`, `updateIconColor`, `updateIconShape`, `setMonitoringEnabled`, `setNotificationsEnabled`, `updateMonitoringOptions`, `updateIcon`, `deleteSnapshotRows`, `markSiteRead`, `undoSiteRead`, `updateCompleted`, `updateSyncMetadata`, `claimFailureAlert`, `deleteSiteById`, `deleteSites`. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/local/SitesDao.kt:16
  • `SnapsDao` declares 39 abstract methods: `olderVersionIds`, `retentionBatch`, `observeStorageBytes`, `observeOlderVersionBytes`, `siteIdsWithOlderVersions`, `getAllSnapsForSiteId`, `getAllSnapsForSiteIdWithFlow`, `getContentTypesWithCount`, `getContentTypesCount`, `getContentTypesParams`, `getPrecedingSnap`, `getSnapById`, `getLastSnapForSiteId`, `getLastNSnapsForSiteId`, `getLastSnapsSize`, `getAllSnaps`, `deleteSnapById`, `deleteSnapsByIds`, `deleteAllSnapsForSite`, `observeSnapsTable`, `insertSnap`, `deleteTasks`, `countNumberOfChanges`, `countSitesWithChanges`, `countVersionsInHistory`, `getSnapsWithChanges`, `getLatestSnapsFromSitesWithChangesList`, `getSnapsWithChange`, `getSnapsWithChange2`, `countSnapsWithChange`, `getLastContentHash`, `getLastProcessedContentHash`, `hasContentWithHash`, `getUniqueContentSnaps`, `getAverageContentSize`, `getContentDuplicationStats`, `getAllMostRecentSnaps`, `getSnapshotCounts`, `getSnapsPagedSource`. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/local/SnapsDao.kt:38

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
M1 · Documentation (README)7.0 / 10Strong✓ Tool-verified

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

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

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation0.0 / 10Critical✓ Tool-verified

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

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

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
  • No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

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

P2 · Observability4.8 / 10Weak✓ Tool-verified

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

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

  • Only 1/4 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `iosApp`, `webDemo`, `website`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
  • Add a health-check endpoint (Spring Boot Actuator's /actuator/health, or a /health route) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:5
  • `sqliteWasmWorker/worker/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — sqliteWasmWorker/worker/package.json:5

What to do

  • Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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).
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.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

R1 · Type Safety0.0 / 10Critical✓ Tool-verified

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

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

  • 0 typed · 5 plain JS — the untyped files are sqliteWasmWorker/worker/worker.js, store-listing/capture.tour.mjs, store-listing/theme.js, webDemo/webpack.config.d/coop-coep-headers.js, webDemo/webpack.config.d/sqlite-wasm-worker.js.

What to do

  • Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
R10 · Code Duplication6.0 / 10Adequate✓ Tool-verified

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

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

  • sqliteWasmWorker/worker/worker.js:80 · sqliteWasmWorker/worker/worker.js:94 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — sqliteWasmWorker/worker/worker.js:80

What to do

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

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

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

  • run has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — store-listing/capture.tour.mjs:17
R3 · Large Files10.0 / 10Exemplary✓ Tool-verified

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

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

R6 · Tooling6.6 / 10Adequate✓ Tool-verified

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

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

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

What to do

  • Add a test runner (vitest / jest / playwright) as package.json scripts and run them in CI.
R8 · Dependency Hygiene8.0 / 10Strong✓ Tool-verified

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

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

  • Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json. — store-listing/capture.tour.mjs:11

What to do

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

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

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

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether suspend functions that make a cancellable request accept or pass on the coroutine's cancellation (adoption curve).

Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

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

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

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X3 · Exception handling5.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×22) — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/background/DesktopMonitoringManager.kt:39, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt:210, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/main/MainViewModel.kt:279, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×5) — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/background/DesktopMonitoringManager.kt:70, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:574, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:121, …
  • `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:453

What to do

  • Swallowed exception (caught, then discarded)
X5 · Nullable reference types9.9 / 10Exemplary✓ Tool-verified

Other · Code Health — Whether Kotlin's null safety is not undermined by not-null assertions — `String` cannot hold null and `String?` must be checked before use in every Kotlin module, and each `!!` is a run-time `NullPointerException` the author has told the compiler cannot happen.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

WCAG coverage — what static analysis assessed

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

DimensionWCAG 2.2 A/AA criteriaCoverage
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
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only

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

Reference — by lens

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

LensScoreRatingImpact
Code Health43.6Weak — gated by D2, R1, R2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture95.7ExemplarySolid.
Maturity59.4Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness43.0Weak — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security61.2Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility88.0StrongSolid.
Performance100.0ExemplaryStrongest area.
Unscored — 3 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 11 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

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

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
Not included — 63 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
  • AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
  • AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Kotlin code is a Spring, JSR-330 or CDI singleton bean. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the Android app did not build — `./gradlew :androidApp:assembleDebug` exited 1: false}) from 'https://api.foojay.io/disco/v3.0/ids/50dff0498c7a09126e3b7e7f2749f324/redirect', due to: Could not HEAD 'https://api.foojay.io/disco/v3.0/ids/50dff0498c7a09126e3b7e7f2749f324/redirect'.…; runtime evidence skipped (launch chosen because androidApp/build.gradle.kts applies the Android application plugin and gradlew builds it) This is a statement about this run, not a statement about your application: nothing here says the app is inaccessible, only that it was never run.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no data at rest for these controls to protect.
  • 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 — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~22434 lines of test source are present (.kt) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — the .kt suite was found but not re-run
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • 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.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .kt, .swift source were not judged.
  • D25 ADR Conformance — no ADRs to check
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 16 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no 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
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 126 value object(s); 4 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, JavaScript/TypeScript, Swift source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • R4 Test Coverage — the JS/TS workspace (5 production file(s)) has no JavaScript/TypeScript test, but it is 4.02% of this repository's production source and the other 95.98% carries 22,434 line(s) of test code this pass cannot read — an incidental frontend's reachability is not the repository's test posture, so it is not scored as one
  • R5 Dependency Freshness — uses a yarn lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • R7 Dead Code — Not measured — no application, tooling or test entry point was detected, so no file can be shown to be reachable or unreachable. Declare an entry (package.json main/module/exports, src/index.*, or an index.html script) to enable reachability.
  • 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.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — X24 reached only 4% of this repository's production lines — kotlin (33,942 lines), swift (58 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Kotlin was read, and it logs through none that an assembled message defeats: Android's `Log` and Timber, java.util.logging and log4j-api-kotlin take one finished message (as log4net does in C#), or it makes no call through a named logger at all. Calls made through SLF4J, log4j 2 or kotlin-logging (`LoggerFactory.getLogger`, `KotlinLogging.logger {}`) would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 21 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D28 · Secrets (history) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 232 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×27
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:91 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in AddEditConfirmComponentsKt.AddEditConfirmScreen at line 91. 1 of those changes was a fix/bug commit, and the other 29 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in ComparisonScreenKt.ComparisonScreen at line 152. 2 of those changes were fix/bug commits, and the other 23 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:152 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in HomeScreenKt.HomeScreen at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:329 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in SyncEngine.processSuccessResult at line 329. 2 of those changes were fix/bug commits, and the other 20 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt:307 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PageDetailScreenKt.DetailList at line 307. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:116 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in AppContentKt.ChangeDetectionApp at line 116. 1 of those changes was a fix/bug commit, and the other 21 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:418 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AddEditViewModel.performSave at line 418. 2 of those changes were fix/bug commits, and the other 22 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt:96 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in KitKt.PageAvatar at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt:105 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in WatchBrowserKt.WatchBrowser at line 105. 1 of those changes was a fix/bug commit, and the other 18 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt:91 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in AndroidPageCapture.captureLoaded at line 91. 1 of those changes was a fix/bug commit, and the other 21 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:89 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in VisualRegions.compare at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt:201 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ActivityScreenKt.ActivityFeed at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt:76 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DialogBackgroundSyncKt.BackgroundSyncDialogContent at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt:47 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in CheckFailure.from at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ImageComparisonView.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ImageComparisonView.kt:147 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ImageComparisonView.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ImageComparisonViewKt.ImageComparisonBody at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ImageComparisonView.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:334 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DiagnosticTraceKt.diagnosticCategory at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:179 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ChangePreviewViewsKt.PreviewBody at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonViewModel.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonViewModel.kt:261 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonViewModel.kt changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ComparisonViewModel.observeHistory at line 261. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonViewModel.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt:40 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ConnectedChoiceKt.ConnectedChoice at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:56 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ErrorHandler.classifyError at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt:26 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CapturePreviewPanelKt.CapturePreviewPanel at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/localBrowser/LocalBrowserScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/localBrowser/LocalBrowserScreen.kt:69 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/localBrowser/LocalBrowserScreen.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LocalBrowserScreenKt.LocalBrowserScreen at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/localBrowser/LocalBrowserScreen.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/AndroidDiagnosticStore.kt shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/AndroidDiagnosticStore.kt:260 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/AndroidDiagnosticStore.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AndroidDiagnosticStore.summary at line 260. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/AndroidDiagnosticStore.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorPresentation.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorPresentation.kt:9 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorPresentation.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ErrorPresentationKt.errorPresentation at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorPresentation.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/PageCaptureHealth.kt shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/PageCaptureHealth.kt:116 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/PageCaptureHealth.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in PageCaptureHealth.ssl at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 17:14:21 -03:00' --until='2026-11-16 17:14:21 -03:00' --full-history --no-merges -- shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/PageCaptureHealth.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 2 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×23
  • Swallowed exception (caught, then discarded) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/background/DesktopMonitoringManager.kt:39 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt:210 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/main/MainViewModel.kt:279 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:144 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:363 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/SavedPagePreview.kt:55 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/ChangeAlertDelivery.kt:30 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/ChangeAlertText.kt:27 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/CheckBatch.kt:18 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/local/DatabaseFactory.kt:48 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/preview/ChangePreview.kt:154 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.kt:55 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:298 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/background/TurboSession.kt:139 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:453 — `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/NotificationImagePreview.kt:34 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticsEntry.android.kt:76 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticsEntry.android.kt:108 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticsEntry.android.kt:158 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt:426 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupRow.android.kt:90 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) androidApp/src/main/kotlin/com/bernaferrari/changedetection/MainActivity.kt:145 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) androidApp/src/main/kotlin/com/bernaferrari/changedetection/MainActivity.kt:158 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D3 · God Classes · MethodTooLong · ×6
  • MethodTooLong: ComparisonScreenKt.ComparisonScreen shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152 — MethodTooLong — ComparisonScreen runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: HomeScreenKt.HomeScreen shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:152 — MethodTooLong — HomeScreen runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: WatchBrowserKt.WatchBrowser shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt:105 — MethodTooLong — WatchBrowser runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: PageDetailScreenKt.DetailList shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt:307 — MethodTooLong — DetailList runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: androidKt.BackupDialog shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupRow.android.kt:75 — MethodTooLong — BackupDialog runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: AddEditConfirmComponentsKt.PagePreviewCard shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:645 — MethodTooLong — PagePreviewCard runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D3 · God Classes · FileTooLong · ×5
  • FileTooLong: addedit/AddEditConfirmComponents.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt — FileTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: home/HomeScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt — FileTooLong — 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 over it, 1.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: detail/PageDetailScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt — FileTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: sync/SyncEngine.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt — FileTooLong — 516 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: SyncEngine (64-773). The bar is 500 significant lines; this is 16 over it, 1.03× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: comparison/ComparisonScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt — FileTooLong — 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
X3 · Exception handling · Swallowed exception (empty catch) · ×5
  • Swallowed exception (empty catch) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/background/DesktopMonitoringManager.kt:70 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:574 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:121 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:127 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:183 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:284 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:284-292 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:340-348 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:284` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/RenderedSelectionDocument.kt:30 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/RenderedSelectionDocument.kt:30-38 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/RenderedSelectionDocument.kt:48-56 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:77 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:77-85 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:118-126 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:77` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `source` to `BackupSource): RestorePreview = withContext(fileIoDispatcher` in one and `BackupSource` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D3 · God Classes · ClassTooLong · ×2
  • ClassTooLong: SyncEngine shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:64 — ClassTooLong — 467 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 67 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VisualChange shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:27 — ClassTooLong — 430 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 30 over it, 1.08× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: AppContent.kt ↔ ComparisonScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:1 — `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt` and `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `ed2fa774` Keep change previews responsive and polish navigation loading states; `c61bc8ab` Fix navigation and sharing behavior; `c58e32df` Unify expressive selectors and improve page navigation — run `git show` on any of them.
  • Change coupling: AppContent.kt ↔ SettingsScreen.kt shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:1 — `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt` and `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/SettingsScreen.kt` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `c61bc8ab` Fix navigation and sharing behavior; `c58e32df` Unify expressive selectors and improve page navigation; `3a7cd6c4` Settings: capture method and screenshot wait inline (custom 0–60 s), … (at that commit the files were still `composeApp/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt` and `composeApp/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/SettingsScreen.kt`) — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (1 corresponding lines) · ×2
  • Edited copy of a member (1 corresponding lines) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/DesktopPlatform.kt:93 — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/DesktopPlatform.kt:93-93 | shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/AndroidFileStorage.kt:13-15 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/error/TlsFailure.android.kt:3 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/error/TlsFailure.android.kt:3-3 | shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/error/TlsFailure.desktop.kt:3-3 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×2
  • Duplicated block (10 lines × 2) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/CryptoUtils.kt:9 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/CryptoUtils.kt:9-18 | shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/CryptoUtils.kt:9-18 — before extracting anything, compare `shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/CryptoUtils.kt` and `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/CryptoUtils.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (10 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/util/UnifiedDiffUtils.kt:140 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/util/UnifiedDiffUtils.kt:140-149 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/util/UnifiedDiffUtils.kt:155-164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×2
  • Duplicated block (8 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:202 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:202-209 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:384-391 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:202` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:378 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:378-385 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:419-426 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
AC3 · Page structure · Page without a main landmark · ×1
  • Page without a main landmark webDemo/src/wasmJsMain/resources/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D1 · Cyclomatic Complexity · AddEditConfirmComponentsKt.AddEditConfirmScreen (cyclomatic 67) · ×1
  • AddEditConfirmComponentsKt.AddEditConfirmScreen (cyclomatic 67) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:91 — AddEditConfirmComponentsKt.AddEditConfirmScreen has cyclomatic complexity 67 (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 · ComparisonScreenKt.ComparisonScreen (cyclomatic 65) · ×1
  • ComparisonScreenKt.ComparisonScreen (cyclomatic 65) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152 — ComparisonScreenKt.ComparisonScreen has cyclomatic complexity 65 (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 · HomeScreenKt.HomeScreen (cyclomatic 42) · ×1
  • HomeScreenKt.HomeScreen (cyclomatic 42) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:152 — HomeScreenKt.HomeScreen 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 · CheckFailure.from (cyclomatic 39) · ×1
  • CheckFailure.from (cyclomatic 39) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt:47 — CheckFailure.from has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · SyncEngine.processSuccessResult (cyclomatic 38) · ×1
  • SyncEngine.processSuccessResult (cyclomatic 38) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:329 — SyncEngine.processSuccessResult has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · VisualRegions.compare (cyclomatic 36) · ×1
  • VisualRegions.compare (cyclomatic 36) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:89 — VisualRegions.compare 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 · AddEditConfirmComponentsKt.PagePreviewCard (cyclomatic 31) · ×1
  • AddEditConfirmComponentsKt.PagePreviewCard (cyclomatic 31) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:645 — AddEditConfirmComponentsKt.PagePreviewCard has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · KitKt.PageAvatar (cyclomatic 31) · ×1
  • KitKt.PageAvatar (cyclomatic 31) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt:96 — KitKt.PageAvatar has cyclomatic complexity 31 (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 · TextRegionPickerKt.TextRegionPicker (cyclomatic 30) · ×1
  • TextRegionPickerKt.TextRegionPicker (cyclomatic 30) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/TextRegionPicker.kt:45 — TextRegionPickerKt.TextRegionPicker has cyclomatic complexity 30 (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 · ErrorPresentationKt.errorPresentation (cyclomatic 29) · ×1
  • ErrorPresentationKt.errorPresentation (cyclomatic 29) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorPresentation.kt:9 — ErrorPresentationKt.errorPresentation has cyclomatic complexity 29 (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 · PageDetailScreenKt.DetailList (cyclomatic 29) · ×1
  • PageDetailScreenKt.DetailList (cyclomatic 29) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt:307 — PageDetailScreenKt.DetailList 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 · AppContentKt.ChangeDetectionApp (cyclomatic 28) · ×1
  • AppContentKt.ChangeDetectionApp (cyclomatic 28) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:116 — AppContentKt.ChangeDetectionApp 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 · WatchBrowserKt.WatchBrowser (cyclomatic 27) · ×1
  • WatchBrowserKt.WatchBrowser (cyclomatic 27) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt:105 — WatchBrowserKt.WatchBrowser 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 · AddEditViewModel.performSave (cyclomatic 25) · ×1
  • AddEditViewModel.performSave (cyclomatic 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:418 — AddEditViewModel.performSave 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 · ActivityScreenKt.ActivityFeed (cyclomatic 25) · ×1
  • ActivityScreenKt.ActivityFeed (cyclomatic 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt:201 — ActivityScreenKt.ActivityFeed 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 · DialogBackgroundSyncKt.BackgroundSyncDialogContent (cyclomatic 25) · ×1
  • DialogBackgroundSyncKt.BackgroundSyncDialogContent (cyclomatic 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt:76 — DialogBackgroundSyncKt.BackgroundSyncDialogContent 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 · AddEditViewModel.requestPreviewFrom (cyclomatic 24) · ×1
  • AddEditViewModel.requestPreviewFrom (cyclomatic 24) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:131 — AddEditViewModel.requestPreviewFrom 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 · ErrorHandler.classifyError (cyclomatic 24) · ×1
  • ErrorHandler.classifyError (cyclomatic 24) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:56 — ErrorHandler.classifyError has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · LocalBrowserScreenKt.LocalBrowserScreen (cyclomatic 24) · ×1
  • LocalBrowserScreenKt.LocalBrowserScreen (cyclomatic 24) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/localBrowser/LocalBrowserScreen.kt:69 — LocalBrowserScreenKt.LocalBrowserScreen has cyclomatic complexity 24 (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 · androidKt.DiagnosticsDialog (cyclomatic 23) · ×1
  • androidKt.DiagnosticsDialog (cyclomatic 23) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticsEntry.android.kt:53 — androidKt.DiagnosticsDialog has cyclomatic complexity 23 (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 · VisualRegions.sameAfterShift (cyclomatic 23) · ×1
  • VisualRegions.sameAfterShift (cyclomatic 23) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:460 — VisualRegions.sameAfterShift 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 · HomeScreenKt.PageRow (cyclomatic 23) · ×1
  • HomeScreenKt.PageRow (cyclomatic 23) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:776 — HomeScreenKt.PageRow has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · AndroidPageCapture.captureLoaded (cyclomatic 22) · ×1
  • AndroidPageCapture.captureLoaded (cyclomatic 22) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt:91 — AndroidPageCapture.captureLoaded has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · PageCaptureHealth.ssl (cyclomatic 22) · ×1
  • PageCaptureHealth.ssl (cyclomatic 22) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/PageCaptureHealth.kt:116 — PageCaptureHealth.ssl has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · VisualRegions.align (cyclomatic 22) · ×1
  • VisualRegions.align (cyclomatic 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:231 — VisualRegions.align has cyclomatic complexity 22 (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 · KitKt.vivid (cyclomatic 22) · ×1
  • KitKt.vivid (cyclomatic 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt:276 — KitKt.vivid 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 · androidKt.BackupDialog (cyclomatic 21) · ×1
  • androidKt.BackupDialog (cyclomatic 21) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupRow.android.kt:75 — androidKt.BackupDialog has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · VisualRegions.changedBands (cyclomatic 21) · ×1
  • VisualRegions.changedBands (cyclomatic 21) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:386 — VisualRegions.changedBands 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 · SyncEngine.saveNewSnap (cyclomatic 21) · ×1
  • SyncEngine.saveNewSnap (cyclomatic 21) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:437 — SyncEngine.saveNewSnap 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 · CapturePreviewPanelKt.CapturePreviewPanel (cyclomatic 20) · ×1
  • CapturePreviewPanelKt.CapturePreviewPanel (cyclomatic 20) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt:26 — CapturePreviewPanelKt.CapturePreviewPanel has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · DiagnosticTraceKt.diagnosticCategory (cyclomatic 20) · ×1
  • DiagnosticTraceKt.diagnosticCategory (cyclomatic 20) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt:334 — DiagnosticTraceKt.diagnosticCategory has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · SyncEngine.verifiedBaseline (cyclomatic 20) · ×1
  • SyncEngine.verifiedBaseline (cyclomatic 20) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:268 — SyncEngine.verifiedBaseline 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 · HomeScreenKt.HomeTopBar (cyclomatic 20) · ×1
  • HomeScreenKt.HomeTopBar (cyclomatic 20) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:484 — HomeScreenKt.HomeTopBar 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 · ImageComparisonViewKt.ImageComparisonBody (cyclomatic 19) · ×1
  • ImageComparisonViewKt.ImageComparisonBody (cyclomatic 19) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ImageComparisonView.kt:147 — ImageComparisonViewKt.ImageComparisonBody 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 · ConnectedChoiceKt.ConnectedChoice (cyclomatic 19) · ×1
  • ConnectedChoiceKt.ConnectedChoice (cyclomatic 19) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt:40 — ConnectedChoiceKt.ConnectedChoice 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 · TurboSession.start (cyclomatic 18) · ×1
  • TurboSession.start (cyclomatic 18) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/background/TurboSession.kt:94 — TurboSession.start 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 · AmountsKt.parseAmount (cyclomatic 18) · ×1
  • AmountsKt.parseAmount (cyclomatic 18) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/Amounts.kt:24 — AmountsKt.parseAmount 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 · CaptureModeFieldKt.CompareChoice (cyclomatic 17) · ×1
  • CaptureModeFieldKt.CompareChoice (cyclomatic 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CaptureModeField.kt:36 — CaptureModeFieldKt.CompareChoice 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 · BackupService.import (cyclomatic 17) · ×1
  • BackupService.import (cyclomatic 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:96 — BackupService.import 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 · SnapshotImageDiff.equals (cyclomatic 17) · ×1
  • SnapshotImageDiff.equals (cyclomatic 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/SnapshotImageDiff.kt:64 — SnapshotImageDiff.equals 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 · ChangePreviewKt.clusterEdits (cyclomatic 17) · ×1
  • ChangePreviewKt.clusterEdits (cyclomatic 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/preview/ChangePreview.kt:405 — ChangePreviewKt.clusterEdits 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 · PageIconMotionKt.rememberPageIconMotion (cyclomatic 17) · ×1
  • PageIconMotionKt.rememberPageIconMotion (cyclomatic 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/PageIconMotion.kt:13 — PageIconMotionKt.rememberPageIconMotion 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 · ChangePreviewViewsKt.PreviewBody (cyclomatic 17) · ×1
  • ChangePreviewViewsKt.PreviewBody (cyclomatic 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:179 — ChangePreviewViewsKt.PreviewBody 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 · AndroidDiagnosticStore.summary (cyclomatic 16) · ×1
  • AndroidDiagnosticStore.summary (cyclomatic 16) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/AndroidDiagnosticStore.kt:260 — AndroidDiagnosticStore.summary has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ComparisonViewModel.observeHistory (cyclomatic 16) · ×1
  • ComparisonViewModel.observeHistory (cyclomatic 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonViewModel.kt:261 — ComparisonViewModel.observeHistory has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · DiffUtils.lcsDiff (cyclomatic 16) · ×1
  • DiffUtils.lcsDiff (cyclomatic 16) shared/src/commonMain/kotlin/com/bernaferrari/difflib/DiffUtils.kt:95 — DiffUtils.lcsDiff 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.
D2 · Cognitive Complexity · AddEditConfirmComponentsKt.AddEditConfirmScreen (cognitive 85) · ×1
  • AddEditConfirmComponentsKt.AddEditConfirmScreen (cognitive 85) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:91 — AddEditConfirmComponentsKt.AddEditConfirmScreen has cognitive complexity 85 (threshold 15). Drivers by points: if/else 54 (58 pts), boolean chains 24, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ComparisonScreenKt.ComparisonScreen (cognitive 83) · ×1
  • ComparisonScreenKt.ComparisonScreen (cognitive 83) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonScreen.kt:152 — ComparisonScreenKt.ComparisonScreen has cognitive complexity 83 (threshold 15). Drivers by points: if/else 39 (51 pts), boolean chains 23, match/switch 6 (9 pts) (nesting depth added 15). 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 · HomeScreenKt.HomeScreen (cognitive 59) · ×1
  • HomeScreenKt.HomeScreen (cognitive 59) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:152 — HomeScreenKt.HomeScreen has cognitive complexity 59 (threshold 15). Drivers by points: if/else 31 (43 pts), boolean chains 12, match/switch 4 (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 · VisualRegions.compare (cognitive 53) · ×1
  • VisualRegions.compare (cognitive 53) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:89 — VisualRegions.compare has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 15, loops 4 (6 pts) (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 · VisualRegions.sameAfterShift (cognitive 52) · ×1
  • VisualRegions.sameAfterShift (cognitive 52) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:460 — VisualRegions.sameAfterShift has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 8 (17 pts), boolean chains 2 (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 · TextRegionPickerKt.TextRegionPicker (cognitive 51) · ×1
  • TextRegionPickerKt.TextRegionPicker (cognitive 51) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/TextRegionPicker.kt:45 — TextRegionPickerKt.TextRegionPicker has cognitive complexity 51 (threshold 15). Drivers by points: if/else 33 (42 pts), boolean chains 6, error handling 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · SyncEngine.processSuccessResult (cognitive 51) · ×1
  • SyncEngine.processSuccessResult (cognitive 51) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:329 — SyncEngine.processSuccessResult has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 16, error handling 5 (7 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · KitKt.PageAvatar (cognitive 48) · ×1
  • KitKt.PageAvatar (cognitive 48) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt:96 — KitKt.PageAvatar has cognitive complexity 48 (threshold 15). Drivers by points: if/else 30 (37 pts), boolean chains 10, 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 · DialogBackgroundSyncKt.BackgroundSyncDialogContent (cognitive 45) · ×1
  • DialogBackgroundSyncKt.BackgroundSyncDialogContent (cognitive 45) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/DialogBackgroundSync.kt:76 — DialogBackgroundSyncKt.BackgroundSyncDialogContent has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 7, match/switch 1 (3 pts), error handling 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AddEditConfirmComponentsKt.PagePreviewCard (cognitive 42) · ×1
  • AddEditConfirmComponentsKt.PagePreviewCard (cognitive 42) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:645 — AddEditConfirmComponentsKt.PagePreviewCard has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AddEditViewModel.requestPreviewFrom (cognitive 39) · ×1
  • AddEditViewModel.requestPreviewFrom (cognitive 39) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:131 — AddEditViewModel.requestPreviewFrom has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (22 pts), error handling 6 (9 pts), match/switch 2 (7 pts), 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 · VisualRegions.changedBands (cognitive 39) · ×1
  • VisualRegions.changedBands (cognitive 39) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:386 — VisualRegions.changedBands has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 5 (9 pts), boolean chains 3 (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 · AppContentKt.ChangeDetectionApp (cognitive 37) · ×1
  • AppContentKt.ChangeDetectionApp (cognitive 37) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:116 — AppContentKt.ChangeDetectionApp has cognitive complexity 37 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 11 (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 · androidKt.DiagnosticsDialog (cognitive 35) · ×1
  • androidKt.DiagnosticsDialog (cognitive 35) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticsEntry.android.kt:53 — androidKt.DiagnosticsDialog has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (17 pts), error handling 6 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · PageDetailScreenKt.DetailList (cognitive 35) · ×1
  • PageDetailScreenKt.DetailList (cognitive 35) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/detail/PageDetailScreen.kt:307 — PageDetailScreenKt.DetailList has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (27 pts), boolean chains 5, match/switch 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · LocalBrowserScreenKt.LocalBrowserScreen (cognitive 34) · ×1
  • LocalBrowserScreenKt.LocalBrowserScreen (cognitive 34) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/localBrowser/LocalBrowserScreen.kt:69 — LocalBrowserScreenKt.LocalBrowserScreen has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 9, match/switch 3 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · WatchBrowserKt.WatchBrowser (cognitive 33) · ×1
  • WatchBrowserKt.WatchBrowser (cognitive 33) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/WatchBrowser.kt:105 — WatchBrowserKt.WatchBrowser has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 8, 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 · TurboSession.start (cognitive 31) · ×1
  • TurboSession.start (cognitive 31) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/background/TurboSession.kt:94 — TurboSession.start has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 5 (8 pts), boolean chains 4, 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 · KitKt.vivid (cognitive 31) · ×1
  • KitKt.vivid (cognitive 31) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt:276 — KitKt.vivid has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (30 pts), match/switch 1 (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 · SyncEngine.saveNewSnap (cognitive 30) · ×1
  • SyncEngine.saveNewSnap (cognitive 30) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:437 — SyncEngine.saveNewSnap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 8 (12 pts), 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 · AddEditViewModel.performSave (cognitive 29) · ×1
  • AddEditViewModel.performSave (cognitive 29) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditViewModel.kt:418 — AddEditViewModel.performSave has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 8, error handling 3 (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 · ChangePreviewKt.clusterEdits (cognitive 29) · ×1
  • ChangePreviewKt.clusterEdits (cognitive 29) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/preview/ChangePreview.kt:405 — ChangePreviewKt.clusterEdits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AmountsKt.parseAmount (cognitive 28) · ×1
  • AmountsKt.parseAmount (cognitive 28) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/Amounts.kt:24 — AmountsKt.parseAmount has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CheckFailure.from (cognitive 28) · ×1
  • CheckFailure.from (cognitive 28) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt:47 — CheckFailure.from has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (20 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · VisualRegions.align (cognitive 28) · ×1
  • VisualRegions.align (cognitive 28) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:231 — VisualRegions.align has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 5 (9 pts), boolean chains 7 (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 · ActivityScreenKt.ActivityFeed (cognitive 28) · ×1
  • ActivityScreenKt.ActivityFeed (cognitive 28) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt:201 — ActivityScreenKt.ActivityFeed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, match/switch 4 (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 · AndroidPageCapture.captureLoaded (cognitive 27) · ×1
  • AndroidPageCapture.captureLoaded (cognitive 27) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt:91 — AndroidPageCapture.captureLoaded has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · SelectableTextDocumentKt.selectableTextDocument (cognitive 27) · ×1
  • SelectableTextDocumentKt.selectableTextDocument (cognitive 27) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/SelectableTextDocument.kt:17 — SelectableTextDocumentKt.selectableTextDocument has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DiffUtils.lcsDiff (cognitive 27) · ×1
  • DiffUtils.lcsDiff (cognitive 27) shared/src/commonMain/kotlin/com/bernaferrari/difflib/DiffUtils.kt:95 — DiffUtils.lcsDiff has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AndroidPageCapture.awaitSelectedRegion (cognitive 26) · ×1
  • AndroidPageCapture.awaitSelectedRegion (cognitive 26) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt:266 — AndroidPageCapture.awaitSelectedRegion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, 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 · SyncEngine.verifiedBaseline (cognitive 26) · ×1
  • SyncEngine.verifiedBaseline (cognitive 26) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:268 — SyncEngine.verifiedBaseline has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, error handling 4, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VisualChangesViewKt.PageOverview (cognitive 26) · ×1
  • VisualChangesViewKt.PageOverview (cognitive 26) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/VisualChangesView.kt:141 — VisualChangesViewKt.PageOverview has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21 (23 pts), loops 2, 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, 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 · TypeKt.typographyOf (cognitive 26) · ×1
  • TypeKt.typographyOf (cognitive 26) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/theme/Type.kt:53 — TypeKt.typographyOf has cognitive complexity 26 (threshold 15). Drivers by points: if/else 26. 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 · HomeScreenKt.HomeTopBar (cognitive 25) · ×1
  • HomeScreenKt.HomeTopBar (cognitive 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:484 — HomeScreenKt.HomeTopBar has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ConnectedChoiceKt.ConnectedChoice (cognitive 25) · ×1
  • ConnectedChoiceKt.ConnectedChoice (cognitive 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt:40 — ConnectedChoiceKt.ConnectedChoice has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 6, match/switch 2 (3 pts) (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 · ActivityScreenKt.ActivityScreen (cognitive 25) · ×1
  • ActivityScreenKt.ActivityScreen (cognitive 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt:107 — ActivityScreenKt.ActivityScreen has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 1 (3 pts), 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 · TurboUiKt.TurboLiveScreen (cognitive 25) · ×1
  • TurboUiKt.TurboLiveScreen (cognitive 25) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/turbo/TurboUi.kt:381 — TurboUiKt.TurboLiveScreen has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ChangeReaderKt.readerBlocks (cognitive 24) · ×1
  • ChangeReaderKt.readerBlocks (cognitive 24) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ChangeReader.kt:107 — ChangeReaderKt.readerBlocks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, 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 · HomeScreenKt.PageRow (cognitive 24) · ×1
  • HomeScreenKt.PageRow (cognitive 24) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:776 — HomeScreenKt.PageRow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, boolean chains 4, match/switch 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 · IosPageCapture.awaitResources (cognitive 24) · ×1
  • IosPageCapture.awaitResources (cognitive 24) shared/src/iosMain/kotlin/com/bernaferrari/changedetection/browser/IosPageCapture.kt:206 — IosPageCapture.awaitResources has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 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 · TurboUiKt.TurboSetupSheet (cognitive 23) · ×1
  • TurboUiKt.TurboSetupSheet (cognitive 23) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/turbo/TurboUi.kt:246 — TurboUiKt.TurboSetupSheet has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 1, match/switch 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 · run (cognitive 23) · ×1
  • run (cognitive 23) store-listing/capture.tour.mjs:17 — run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 11). Of this number, 21 points are the body's own statements and 2 belong to 2 function items 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 · LegacyDatabaseImportKt.importLegacyDatabase (cognitive 22) · ×1
  • LegacyDatabaseImportKt.importLegacyDatabase (cognitive 22) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/repo/source/local/LegacyDatabaseImport.kt:11 — LegacyDatabaseImportKt.importLegacyDatabase has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · BackupService.import (cognitive 22) · ×1
  • BackupService.import (cognitive 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:96 — BackupService.import has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 3, error handling 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 · SyncEngine.processFetchResultUnlocked (cognitive 22) · ×1
  • SyncEngine.processFetchResultUnlocked (cognitive 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/SyncEngine.kt:210 — SyncEngine.processFetchResultUnlocked has cognitive complexity 22 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 7 (9 pts), boolean chains 1, 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 · HighlightViewKt.HighlightView (cognitive 22) · ×1
  • HighlightViewKt.HighlightView (cognitive 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/HighlightView.kt:55 — HighlightViewKt.HighlightView has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · TextDiffComparisonKt.SimpleDiffView (cognitive 22) · ×1
  • TextDiffComparisonKt.SimpleDiffView (cognitive 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/TextDiffComparison.kt:34 — TextDiffComparisonKt.SimpleDiffView has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ChangePreviewViewsKt.PreviewBody (cognitive 22) · ×1
  • ChangePreviewViewsKt.PreviewBody (cognitive 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:179 — ChangePreviewViewsKt.PreviewBody has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · NavigationSuiteKt.ChangeDetectionNavigationSuite (cognitive 22) · ×1
  • NavigationSuiteKt.ChangeDetectionNavigationSuite (cognitive 22) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/navigation/NavigationSuite.kt:61 — NavigationSuiteKt.ChangeDetectionNavigationSuite has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3 (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 · androidKt.BackupDialog (cognitive 21) · ×1
  • androidKt.BackupDialog (cognitive 21) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupRow.android.kt:75 — androidKt.BackupDialog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3, boolean chains 2, error handling 2 (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 · AndroidPageCapture.awaitResources (cognitive 21) · ×1
  • AndroidPageCapture.awaitResources (cognitive 21) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/AndroidPageCapture.kt:322 — AndroidPageCapture.awaitResources has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), 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 · PageCaptureHealth.ssl (cognitive 21) · ×1
  • PageCaptureHealth.ssl (cognitive 21) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/PageCaptureHealth.kt:116 — PageCaptureHealth.ssl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, match/switch 4 (5 pts) (nesting depth added 3). 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 · CapturePreviewerKt.previewFromCapture (cognitive 21) · ×1
  • CapturePreviewerKt.previewFromCapture (cognitive 21) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewer.kt:106 — CapturePreviewerKt.previewFromCapture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ImageComparisonViewKt.ImageComparisonBody (cognitive 21) · ×1
  • ImageComparisonViewKt.ImageComparisonBody (cognitive 21) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ImageComparisonView.kt:147 — ImageComparisonViewKt.ImageComparisonBody has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VisualChangesViewKt.CropLabelled (cognitive 21) · ×1
  • VisualChangesViewKt.CropLabelled (cognitive 21) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/VisualChangesView.kt:241 — VisualChangesViewKt.CropLabelled has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (21 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ComparisonViewModel.loadSnapContents (cognitive 20) · ×1
  • ComparisonViewModel.loadSnapContents (cognitive 20) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ComparisonViewModel.kt:337 — ComparisonViewModel.loadSnapContents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, error handling 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · UnifiedDiffUtils.insertOrig (cognitive 20) · ×1
  • UnifiedDiffUtils.insertOrig (cognitive 20) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/util/UnifiedDiffUtils.kt:241 — UnifiedDiffUtils.insertOrig has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TextChangeSectionKt.textChangeSections (cognitive 19) · ×1
  • TextChangeSectionKt.textChangeSections (cognitive 19) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/TextChangeSection.kt:6 — TextChangeSectionKt.textChangeSections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), 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 · ChangePreviewViewsKt.ChangeSpot (cognitive 19) · ×1
  • ChangePreviewViewsKt.ChangeSpot (cognitive 19) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:354 — ChangePreviewViewsKt.ChangeSpot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · RenderedSelectionDocumentKt.selectionDocumentWithWatchedAreas (cognitive 18) · ×1
  • RenderedSelectionDocumentKt.selectionDocumentWithWatchedAreas (cognitive 18) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/detection/RenderedSelectionDocument.kt:25 — RenderedSelectionDocumentKt.selectionDocumentWithWatchedAreas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 2 (4 pts) (nesting depth added 2). 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 · ErrorHandler.classifyError (cognitive 18) · ×1
  • ErrorHandler.classifyError (cognitive 18) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:56 — ErrorHandler.classifyError has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (nesting depth added 5). 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 · PageIconMotionKt.rememberPageIconMotion (cognitive 18) · ×1
  • PageIconMotionKt.rememberPageIconMotion (cognitive 18) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/PageIconMotion.kt:13 — PageIconMotionKt.rememberPageIconMotion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 4, match/switch 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 · BackupService.preview (cognitive 17) · ×1
  • BackupService.preview (cognitive 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/backup/BackupService.kt:65 — BackupService.preview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (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 · RgbaDiff.compare (cognitive 17) · ×1
  • RgbaDiff.compare (cognitive 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/RgbaDiff.kt:23 — RgbaDiff.compare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), 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.
D2 · Cognitive Complexity · SnapshotImageDiff.equals (cognitive 17) · ×1
  • SnapshotImageDiff.equals (cognitive 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/SnapshotImageDiff.kt:64 — SnapshotImageDiff.equals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 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 · ChangeReaderKt.readerItems (cognitive 17) · ×1
  • ChangeReaderKt.readerItems (cognitive 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/ChangeReader.kt:263 — ChangeReaderKt.readerItems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · DisplayDiffRowsKt.displayDiffRows (cognitive 17) · ×1
  • DisplayDiffRowsKt.displayDiffRows (cognitive 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/DisplayDiffRows.kt:6 — DisplayDiffRowsKt.displayDiffRows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), 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 · ScreenshotWaitChoiceKt.ScreenshotWaitChoice (cognitive 17) · ×1
  • ScreenshotWaitChoiceKt.ScreenshotWaitChoice (cognitive 17) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/ScreenshotWaitChoice.kt:28 — ScreenshotWaitChoiceKt.ScreenshotWaitChoice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · AndroidDiagnosticStore.report (cognitive 16) · ×1
  • AndroidDiagnosticStore.report (cognitive 16) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/diagnostics/AndroidDiagnosticStore.kt:322 — AndroidDiagnosticStore.report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 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 · CaptureModeFieldKt.CompareChoice (cognitive 16) · ×1
  • CaptureModeFieldKt.CompareChoice (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CaptureModeField.kt:36 — CaptureModeFieldKt.CompareChoice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 1, 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, 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 · TextRegionFieldsKt.TextRegionFields (cognitive 16) · ×1
  • TextRegionFieldsKt.TextRegionFields (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/TextRegionFields.kt:17 — TextRegionFieldsKt.TextRegionFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · VisualRegions.trimBlank (cognitive 16) · ×1
  • VisualRegions.trimBlank (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/image/VisualRegions.kt:555 — VisualRegions.trimBlank has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, loops 2, 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 · TextDiffComparisonKt.passageLines (cognitive 16) · ×1
  • TextDiffComparisonKt.passageLines (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/TextDiffComparison.kt:108 — TextDiffComparisonKt.passageLines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · VisualChangesViewKt.VisualChangesView (cognitive 16) · ×1
  • VisualChangesViewKt.VisualChangesView (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/comparison/VisualChangesView.kt:65 — VisualChangesViewKt.VisualChangesView has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (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 · ColorPickerComponentsKt.PaletteSwatch (cognitive 16) · ×1
  • ColorPickerComponentsKt.PaletteSwatch (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/ColorPickerComponents.kt:51 — ColorPickerComponentsKt.PaletteSwatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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 · HomeScreenKt.SelectionBar (cognitive 16) · ×1
  • HomeScreenKt.SelectionBar (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:616 — HomeScreenKt.SelectionBar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · HomeScreenKt.ChangeCard (cognitive 16) · ×1
  • HomeScreenKt.ChangeCard (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt:691 — HomeScreenKt.ChangeCard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 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 · SettingsScreenKt.SettingsScreen (cognitive 16) · ×1
  • SettingsScreenKt.SettingsScreen (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/SettingsScreen.kt:92 — SettingsScreenKt.SettingsScreen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), 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, 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 · DiffUtils.orderedAnchors (cognitive 16) · ×1
  • DiffUtils.orderedAnchors (cognitive 16) shared/src/commonMain/kotlin/com/bernaferrari/difflib/DiffUtils.kt:56 — DiffUtils.orderedAnchors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 2, boolean chains 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.
D3 · God Classes · FunctionTooLong · ×1
  • FunctionTooLong: page.Home website/app/page.tsx:28 — FunctionTooLong — Home runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Edited copy of a member (72 corresponding lines) · ×1
  • Edited copy of a member (72 corresponding lines) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/PlatformImageDiff.desktop.kt:18 — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/PlatformImageDiff.desktop.kt:18-98 | shared/src/wasmJsMain/kotlin/com/bernaferrari/changedetection/image/PlatformImageDiff.wasmJs.kt:13-84 — These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (59 corresponding lines) · ×1
  • Edited copy of a member (59 corresponding lines) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:143 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:143-203 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:224-282 — These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1
  • Edited copy of a member (13 corresponding lines) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/WatchCaptureViewport.android.kt:11 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/browser/WatchCaptureViewport.android.kt:11-23 | shared/src/iosMain/kotlin/com/bernaferrari/changedetection/browser/WatchCaptureViewport.ios.kt:13-30 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/AndroidFileStorage.kt:40 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/AndroidFileStorage.kt:40-53 | shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/DesktopPlatform.kt:76-90 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:482 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:482-504 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/main/MainViewModel.kt:394-412 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×1
  • Edited copy of a member (8 corresponding lines) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidChangeNotifier.kt:127 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidChangeNotifier.kt:127-140 | shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidFailureNotifier.kt:74-81 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:459 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ChangePreviewViews.kt:459-470 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/Kit.kt:447-457 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt:303 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/logs/ActivityScreen.kt:303-308 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/SettingsLoadState.kt:20-25 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×1
  • Edited copy of a member (9 corresponding lines) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupFiles.kt:62 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupFiles.kt:62-70 | shared/src/androidMain/kotlin/com/bernaferrari/changedetection/backup/BackupFiles.kt:72-83 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/storage/SnapshotFileCleanup.kt:68 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/storage/SnapshotFileCleanup.kt:68-79 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/sync/ChangeAlertOutbox.kt:79-90 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (39 lines × 2) · ×1
  • Duplicated block (39 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:155 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:155-193 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:225-263 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:224` calls `handleNetworkError`, `when` and `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/ErrorHandler.kt:153` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (34 lines × 3) · ×1
  • Duplicated block (34 lines × 3) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/DecodeArgb.desktop.kt:10 — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/DecodeArgb.desktop.kt:10-43 | shared/src/iosMain/kotlin/com/bernaferrari/changedetection/image/DecodeArgb.ios.kt:10-43 | shared/src/wasmJsMain/kotlin/com/bernaferrari/changedetection/image/DecodeArgb.wasmJs.kt:10-43 — before extracting anything, compare `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/DecodeArgb.desktop.kt` and `shared/src/iosMain/kotlin/com/bernaferrari/changedetection/image/DecodeArgb.ios.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×1
  • Duplicated block (13 lines × 2) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:752 — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:752-764 | shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt:47-59 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:752` 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 × 3) · ×1
  • Duplicated block (12 lines × 3) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.desktop.kt:14 — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.desktop.kt:14-25 | shared/src/iosMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.ios.kt:14-25 | shared/src/wasmJsMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.wasmJs.kt:14-25 — before extracting anything, compare `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.desktop.kt` and `shared/src/iosMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.ios.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/SynchronizedCache.kt:24 — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/SynchronizedCache.kt:24-37 | shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/SynchronizedCache.kt:24-37 — before extracting anything, compare `shared/src/androidMain/kotlin/com/bernaferrari/changedetection/util/SynchronizedCache.kt` and `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/util/SynchronizedCache.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/ui/theme/ChangeDetectionTheme.desktop.kt:23 — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/ui/theme/ChangeDetectionTheme.desktop.kt:23-43 | shared/src/iosMain/kotlin/com/bernaferrari/changedetection/ui/theme/ChangeDetectionTheme.ios.kt:23-43 — before extracting anything, compare `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/ui/theme/ChangeDetectionTheme.desktop.kt` and `shared/src/iosMain/kotlin/com/bernaferrari/changedetection/ui/theme/ChangeDetectionTheme.ios.kt` as WHOLE FILES: 94% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/ui/theme/ChangeDetectionTheme.desktop.kt:23` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.desktop.kt:27 — shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.desktop.kt:27-32 | shared/src/iosMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.ios.kt:27-32 | shared/src/wasmJsMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.wasmJs.kt:27-32 — before extracting anything, compare `shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.desktop.kt` and `shared/src/iosMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.ios.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) shared/src/iosMain/kotlin/com/bernaferrari/changedetection/util/IosFileStorage.kt:56 — shared/src/iosMain/kotlin/com/bernaferrari/changedetection/util/IosFileStorage.kt:56-61 | shared/src/iosMain/kotlin/com/bernaferrari/changedetection/util/SharedStringUtils.ios.kt:20-26 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D5 · Coupling · Off the main sequence · ×1
  • Off the main sequence: :sqliteWasmWorker — :sqliteWasmWorker: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 0 typed · 5 plain JS — the untyped files are sqliteWasmWorker/worker/worker.js, store-listing/capture.tour.mjs, store-listing/theme.js, webDemo/webpack.config.d/coop-coep-headers.js, webDemo/webpack.config.d/sqlite-wasm-worker.js.
R10 · Code Duplication · Duplicated block (13 lines × 2 locations) · ×1
  • Duplicated block (13 lines × 2 locations) sqliteWasmWorker/worker/worker.js:80 — sqliteWasmWorker/worker/worker.js:80 · sqliteWasmWorker/worker/worker.js:94 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R2 · Cyclomatic Complexity · Complex function run (cyclomatic 13, cognitive 21) · ×1
  • Complex function run (cyclomatic 13, cognitive 21) store-listing/capture.tour.mjs:17 — run has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R6 · Tooling · No test script · ×1
  • No test script — test ✗ · lint ✓ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
R8 · Dependency Hygiene · Unlisted import 'screenshot-studio' · ×1
  • Unlisted import 'screenshot-studio' store-listing/capture.tour.mjs:11 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
SC1 · Supply-chain hygiene · JavaScript dependencies are not locked · ×1
  • JavaScript dependencies are not locked sqliteWasmWorker/worker/package.json:5 — sqliteWasmWorker/worker/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
Minor — 28 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×11
  • Duplicated predicate shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:220 — `!it.site.isRead && it.snap != null && it.snapshotCount > 1` appears character-identically in 2 files — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/home/HomeScreen.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/androidMain/kotlin/com/bernaferrari/changedetection/image/BitmapSampling.kt:19 — `bounds.outWidth <= 0 || bounds.outHeight <= 0` appears character-identically in 2 files — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/image/BitmapSampling.kt, shared/src/androidMain/kotlin/com/bernaferrari/changedetection/image/ImageCrop.android.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:140 — `captureMode == CaptureMode.SCREENSHOT || captureMode == CaptureMode.DEFAULT` appears character-identically in 2 files — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/Site.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/androidMain/kotlin/com/bernaferrari/changedetection/error/TlsFailure.android.kt:3 — `error is javax.net.ssl.SSLException || error is java.security.cert.CertificateException || error is java.security.cert.CertPathValidatorExce…` appears character-identically in 2 files — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/error/TlsFailure.android.kt, shared/src/desktopMain/kotlin/com/bernaferrari/changedetection/error/TlsFailure.desktop.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate androidApp/src/main/kotlin/com/bernaferrari/changedetection/MainActivity.kt:128 — `it.length <= 8_192 && (it.startsWith("http://") || it.startsWith("https://"))` appears character-identically in 2 files — androidApp/src/main/kotlin/com/bernaferrari/changedetection/MainActivity.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/platform/SharedWebUrl.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/androidMain/kotlin/com/bernaferrari/changedetection/addedit/AndroidCapturePreviewer.kt:37 — `mode != CaptureMode.TEXT && mode.resolve(defaultMethod) == ComparisonMethod.HTML` appears character-identically in 2 files — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/addedit/AndroidCapturePreviewer.kt, shared/src/iosMain/kotlin/com/bernaferrari/changedetection/addedit/IosCapturePreviewer.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt:806 — `onSelectRegion != null && content.selectableDocument != null` appears character-identically in 2 files — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/AddEditConfirmComponents.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewPanel.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/SharedEmptyState.kt:78 — `primaryActionLabel != null && onPrimaryAction != null` appears character-identically in 2 files — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/SharedEmptyState.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/SignalEmptyState.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt:117 — `rowIndex == rows.lastIndex && index == 0` appears character-identically in 2 files — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/kit/ConnectedChoice.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/settings/ScreenshotWaitChoice.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/SharedEmptyState.kt:93 — `secondaryActionLabel != null && onSecondaryAction != null` appears character-identically in 2 files — shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/SharedEmptyState.kt, shared/src/commonMain/kotlin/com/bernaferrari/changedetection/ui/components/SignalEmptyState.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidCheckRunner.kt:39 — `site.captureMode != com.bernaferrari.changedetection.repo.CaptureMode.TEXT && site.captureMode.resolve(defaultMethod) == ComparisonMethod.HT…` appears character-identically in 2 files — shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidCheckRunner.kt, shared/src/iosMain/kotlin/com/bernaferrari/changedetection/sync/IosCheckRunner.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
AX6 · Interface segregation · Fat interface · ×3
  • Fat interface: SnapsDataSource (20 abstract methods) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/SnapsDataSource.kt:11 — `SnapsDataSource` declares 20 abstract methods: `observeStorageBytes`, `observeOlderVersionBytes`, `clearOlderVersions`, `deleteSiteWithSnaps`, `getContentTypeInfo`, `getMostRecentSnap`, `getAllMostRecentSnaps`, `getSnaps`, `observeSnapsTable`, `getSnapsFiltered`, `getAllSnapsForSite`, `getSnapById`, `getSnapContent`, `getLastNSnapsForSiteId`, `getSnapPair`, `deleteSnap`, `pruneSnaps`, `getSingleSnapPair`, `getLastContentHash`, `getLastProcessedContentHash`. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: SitesDao (21 abstract methods) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/local/SitesDao.kt:16 — `SitesDao` declares 21 abstract methods: `getSitesList`, `getDataWithChanges`, `observeWatchlist`, `getSiteById`, `getSiteByUrl`, `insertSite`, `updateSite`, `updateIconColor`, `updateIconShape`, `setMonitoringEnabled`, `setNotificationsEnabled`, `updateMonitoringOptions`, `updateIcon`, `deleteSnapshotRows`, `markSiteRead`, `undoSiteRead`, `updateCompleted`, `updateSyncMetadata`, `claimFailureAlert`, `deleteSiteById`, `deleteSites`. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: SnapsDao (39 abstract methods) shared/src/commonMain/kotlin/com/bernaferrari/changedetection/repo/source/local/SnapsDao.kt:38 — `SnapsDao` declares 39 abstract methods: `olderVersionIds`, `retentionBatch`, `observeStorageBytes`, `observeOlderVersionBytes`, `siteIdsWithOlderVersions`, `getAllSnapsForSiteId`, `getAllSnapsForSiteIdWithFlow`, `getContentTypesWithCount`, `getContentTypesCount`, `getContentTypesParams`, `getPrecedingSnap`, `getSnapById`, `getLastSnapForSiteId`, `getLastNSnapsForSiteId`, `getLastSnapsSize`, `getAllSnaps`, `deleteSnapById`, `deleteSnapsByIds`, `deleteAllSnapsForSite`, `observeSnapsTable`, `insertSnap`, `deleteTasks`, `countNumberOfChanges`, `countSitesWithChanges`, `countVersionsInHistory`, `getSnapsWithChanges`, `getLatestSnapsFromSitesWithChangesList`, `getSnapsWithChange`, `getSnapsWithChange2`, `countSnapsWithChange`, `getLastContentHash`, `getLastProcessedContentHash`, `hasContentWithHash`, `getUniqueContentSnaps`, `getAverageContentSize`, `getContentDuplicationStats`, `getAllMostRecentSnaps`, `getSnapshotCounts`, `getSnapsPagedSource`. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found shared/build.gradle.kts:208 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `shared/build.gradle.kts` makes this repository a deployable product (line 208).
D21 · Naming Consistency · `encodeURLParameter` spells `URL` where 55 names in the project spell it `Url` · ×1
  • `encodeURLParameter` spells `URL` where 55 names in the project spell it `Url` shared/src/iosMain/kotlin/com/bernaferrari/changedetection/platform/PlatformUtils.kt:64 — 55 of 56 names in project shared spell the token `Url` (55 of 56; unit: names in project shared containing `Url`). Peers: PlatformActions.openUrl (shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:65); AppContentKt.ChangeDetectionRootApp(initialUrl) (shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:76); AppContentKt.ChangeDetectionRootApp(onInitialUrlHandled) (shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:76); AppContentKt.ChangeDetectionApp(initialUrl) (shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:116); AppContentKt.ChangeDetectionApp(onInitialUrlHandled) (shared/src/commonMain/kotlin/com/bernaferrari/changedetection/AppContent.kt:116). Rename to `encodeUrlParameter`. [rule N6]
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion shared/build.gradle.kts:1 — `shared` (33745 LoC, 1016 module-visible types across 107 directories) overshoots its size bounds. 1 of 8 build unit(s) (Gradle, Xcode, npm) overshoot their size bounds, lowering Project Cohesion to 7.5/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation · No architecture diagram/doc · ×1
  • No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 1/4 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `iosApp`, `webDemo`, `website`.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:5 — No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation sqliteWasmWorker/worker/package.json:5 — `sqliteWasmWorker/worker/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
X7 · Silent fallback defaults · Silent fallback default in catch · ×1
  • Silent fallback default in catch shared/src/commonMain/kotlin/com/bernaferrari/changedetection/preview/ChangePreview.kt:205 — `htmlHeadings` swallows every exception into `emptySet()` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the KDoc, and the row stops firing.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-c2cfd90ae80740ee880343021ec0f6e0/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=519" --report-format json --report-path /tmp/watchdog-gitleaks-c2cfd90ae80740ee880343021ec0f6e0/history-1.json --exit-code 0 --source .6artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-c2cfd90ae80740ee880343021ec0f6e0/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude kotlin-js-store .18artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 16 file(s) — `shared/src/androidMain/kotlin/com/bernaferrari/changedetection/sync/AndroidScreenshotSyncer.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/CapturePreviewer.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/addedit/TextRegionPicker.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/diagnostics/DiagnosticTrace.kt`, `shared/src/commonMain/kotlin/com/bernaferrari/changedetection/error/CheckFailure.kt`, … (+11 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1e790-fed3-764f-b4c9-2b888e1419e3 · 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