Public report of ales-drnz/mpv_audio_kit, 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, 09:48 UTC · Survey ID cd_f31c5f68e17a4ec783bd870c7cf4e7f5

ales-drnz/mpv_audio_kit

Measured 17 November 2026, 09:47 UTC, at code version b53f23d

First survey, so nothing to compare with yet
CAI score 65.4out of 100 Strong
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: 41,805 lines of product code in 9 projects, tests not counted · Estimated rebuild effort: about 0.8 person-years · Weakest lens: Production Readiness, 44.8

Findings by how serious they are

5 critical 164 serious 11 minor

17 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, 09:47 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 ▸

53of 53 dimensions measured by tools.
175of 180 findings point to an exact file and line, so you can open each one in the code. The other 5 concern the repository as a whole, such as missing documentation.
53dimensions across 6 lenses, read from 41,805 lines of product code in 9 projects.
Chapters

Executive summary

ales-drnz/mpv_audio_kit meets our standard for a preview release, though we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 65.4 out of 100 and is rated Strong, and two of its five critical findings are security problems in the build pipeline.

Production Readiness, at 44.8, is the weakest lens and counts most in the score. The best first steps are adding a diagnostic log and adding automated security scanning, each worth about 10.3 points. Raising Production Readiness to 62 would lift the score to about 73.3.

One pipeline step puts outside input straight into a shell command, so an attacker can run commands in the build pipeline. One pipeline step runs a download nobody checks, and three sets of files in separate parts keep changing together, which points to hidden dependencies. Passing outside input through environment variables, checking the download against a checksum and making the hidden dependencies explicit would close these risks.

The product code is 41,805 lines, about €120,000 to rebuild.

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 44.8 · counts for 46%Security and Compliance 78.4 · counts for 25%Code Health 78.8 · counts for 14%Architecture 93.3 · counts for 8%Maturity 97.0 · counts for 4%Performance 100.0 · counts for 2%

If Production Readiness rose from 44.8 to 62, the lowest score rated Strong, the score would rise from 65.4 to about 73.3.

Code composition: what the lines of code are
Product code 43%Tests 57%
Rebuild cost: about €120,000 · Estimate
Cost to rebuild€39,000 to €190,000, for 643 to 2,040 hours of work, about 0.8 person-years for 1 to 2 engineers
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.9 at a score of 65. 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: 41,805 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
Write a diagnostic trail the user can hand back with a bug report: log through `package:logging` to a file in the app's support directory that a report can attach.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 10.3 points · Medium effort · Observability
2
Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — so a security regression fails the build instead of landing.
Raises the score by about 10.3 points · Medium effort · Security & performance tooling
3
Swallowed exception (caught, then discarded)
Raises the score by about 1.6 points · Medium effort · Exception handling

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 €120,000 to build again, about 0.8 person-years of work. Its weakest lens is Production Readiness, at 44.8 (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
Write a diagnostic trail the user can hand back with a bug report: log through `package:logging` to a file in the app's support directory that a report can attach. Of all the actions in this report, it raises the score most for the work it takes: about 10.3 points for medium effort. 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 188,563 lines over the last 90 days, which is about 764,728 lines a year. At that pace, the extra work comes to an estimated 38.2 to 254.9 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: 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.

25 modules, with 10 dependencies between them. Every module uses only modules listed above it, so there are no loops.

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 com.alesdrnz.mpv_audio_kit.ArtworkChannel2 com.alesdrnz.mpv_audio_kit.FileDescriptorChannel3 com.alesdrnz.mpv_audio_kit.MpvAudioKitPlugin4 com.alesdrnz.mpv_audio_kit.PassthroughChannel5 com.alesdrnz.mpv_audio_kit.media_session.ActivityMediaKeys6 com.alesdrnz.mpv_audio_kit.media_session.InterruptionLogic7 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager8 com.alesdrnz.mpv_audio_kit.media_session.MpvMediaSessionService9 com.alesdrnz.mpv_audio_kit.media_session.ScrubFreeze10 darwin~mpv_audio_kit~mpv_audio_kit11 repository12 repository.src13 scripts14 tool.codegen.lavfi_codegen.config15 tool.codegen.lavfi_codegen.parse16 tool.diagrams17 tool.diagrams.base18 tvos~mpv_audio_kit19 com.alesdrnz.mpv_audio_kit20 com.alesdrnz.mpv_audio_kit.media_session21 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.ConfigSnapshot22 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.MetadataSnapshot23 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.PlaybackSnapshot24 tool.codegen.lavfi_codegen25 com.alesdrnz.mpv_audio_kit.media_session.PublishedIntent
1 com.alesdrnz.mpv_audio_kit.ArtworkChannel
2 com.alesdrnz.mpv_audio_kit.FileDescriptorChannel
3 com.alesdrnz.mpv_audio_kit.MpvAudioKitPlugin
4 com.alesdrnz.mpv_audio_kit.PassthroughChannel
5 com.alesdrnz.mpv_audio_kit.media_session.ActivityMediaKeys
6 com.alesdrnz.mpv_audio_kit.media_session.InterruptionLogic
7 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager
8 com.alesdrnz.mpv_audio_kit.media_session.MpvMediaSessionService
9 com.alesdrnz.mpv_audio_kit.media_session.ScrubFreeze
10 darwin~mpv_audio_kit~mpv_audio_kit
11 repository
12 repository.src
13 scripts
14 tool.codegen.lavfi_codegen.config
15 tool.codegen.lavfi_codegen.parse
16 tool.diagrams
17 tool.diagrams.base
18 tvos~mpv_audio_kit
19 com.alesdrnz.mpv_audio_kit11
20 com.alesdrnz.mpv_audio_kit.media_session117
21 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.ConfigSnapshot1
22 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.MetadataSnapshot1
23 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.PlaybackSnapshot1
24 tool.codegen.lavfi_codegen6
25 com.alesdrnz.mpv_audio_kit.media_session.PublishedIntent1
Uses a module listed above itPart of a loopThe module itself
1 com.alesdrnz.mpv_audio_kit.ArtworkChannel2 com.alesdrnz.mpv_audio_kit.FileDescriptorChannel3 com.alesdrnz.mpv_audio_kit.MpvAudioKitPlugin4 com.alesdrnz.mpv_audio_kit.PassthroughChannel5 com.alesdrnz.mpv_audio_kit.media_session.ActivityMediaKeys6 com.alesdrnz.mpv_audio_kit.media_session.InterruptionLogic7 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager8 com.alesdrnz.mpv_audio_kit.media_session.MpvMediaSessionService9 com.alesdrnz.mpv_audio_kit.media_session.ScrubFreeze10 darwin~mpv_audio_kit~mpv_audio_kit11 repository12 repository.src13 scripts14 tool.codegen.lavfi_codegen.config15 tool.codegen.lavfi_codegen.parse16 tool.diagrams17 tool.diagrams.base18 tvos~mpv_audio_kit19 com.alesdrnz.mpv_audio_kit20 com.alesdrnz.mpv_audio_kit.media_session21 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.ConfigSnapshot22 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.MetadataSnapshot23 com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.PlaybackSnapshot24 tool.codegen.lavfi_codegen25 com.alesdrnz.mpv_audio_kit.media_session.PublishedIntentcom.alesdrnz.mpv_audio_kit.ArtworkChannel1com.alesdrnz.mpv_audio_kit.FileDescriptorChannel2com.alesdrnz.mpv_audio_kit.MpvAudioKitPlugin3com.alesdrnz.mpv_audio_kit.PassthroughChannel4com.alesdrnz.mpv_audio_kit.media_session.ActivityMediaKeys5com.alesdrnz.mpv_audio_kit.media_session.InterruptionLogic6com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager7com.alesdrnz.mpv_audio_kit.media_session.MpvMediaSessionService8com.alesdrnz.mpv_audio_kit.media_session.ScrubFreeze9darwin~mpv_audio_kit~mpv_audio_kit10repository11repository.src12scripts13tool.codegen.lavfi_codegen.config14tool.codegen.lavfi_codegen.parse15tool.diagrams16tool.diagrams.base17tvos~mpv_audio_kit18com.alesdrnz.mpv_audio_kit19com.alesdrnz.mpv_audio_kit.media_session20com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.ConfigSnapshot21com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.MetadataSnapshot22com.alesdrnz.mpv_audio_kit.media_session.MediaSessionManager.PlaybackSnapshot23tool.codegen.lavfi_codegen24com.alesdrnz.mpv_audio_kit.media_session.PublishedIntent251111711161

At a glance — Code Health · 78.8 · Strong ·

At a glance — Architecture · 93.3 · Exemplary ·

At a glance — Maturity · 97.0 · Exemplary ·

At a glance — Readiness · 44.8 · Adequate · gated by P2, P3 ·

At a glance — Security · 78.4 · Checked 4 of 10 ·

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 — Injection4High / Critical
A03:2025 — Software Supply Chain Failures3Medium

Roadmap

Top priorities: Write a diagnostic trail the user can hand back with a bug report: log through `package:logging` to a file in the app's support directory that a report can attach. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce; Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — so a security regression fails the build instead of landing; Swallowed exception (caught, then discarded).

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

Do thisHelpsEffortDimension
Write a diagnostic trail the user can hand back with a bug report: log through `package:logging` to a file in the app's support directory that a report can attach. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+10.3 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — so a security regression fails the build instead of landing.+10.3 ptsMediumSecurity & performance tooling
Swallowed exception (caught, then discarded)+1.6 ptsMediumException handling
Resolve the 3 Boundary-crossing change coupling finding(s) in Change Coupling — start with build.dart, player_state.dart, player_stream.dart.+0.3 ptsLowChange Coupling
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+0.5 ptsLowStatic Analysis (SAST)
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+0.5 ptsLowStatic Analysis (SAST)
Hide `repository.src` (`CoreCalls`, `MpvIsolateEvent`, `MpvPropertyEvent`, `MpvReplyEvent`, `MpvEventStartFile`, `MpvEventFileLoaded`, `MpvEventPlaybackRestart`, `MpvEventEndFile`, and 49 more) (Dart: a `_` name, or keep it under `lib/src/` unexported; Kotlin: `internal`; Swift: leave it `internal` (the default) instead of `public`): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.+0.9 ptsMediumLibrary API & versioning
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.+0.4 ptsLowSupply-chain Provenance & Signing

File quality

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

FileScoreBandWorst signal
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
hook/build.dart6.5MixedChange Coupling: Boundary-crossing change coupling: build.dart ↔ Package.swift
tool/codegen/lavfi_codegen/parse.py7.0Near-cleanCyclomatic Complexity: parse.parse_options_block (cyclomatic 52)
darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift7.0Near-cleanCyclomatic Complexity: MediaSessionPlugin.publishNowPlaying (cyclomatic 34)
tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift7.0Near-cleanCyclomatic Complexity: MediaSessionPlugin.publishNowPlaying (cyclomatic 34)
tool/codegen/lavfi_codegen/generate.py7.0Near-cleanCyclomatic Complexity: generate._emit_class_doc (cyclomatic 23)
REDACTED7.2Near-cleanStatic Analysis (SAST): High: REDACTED
tool/codegen/lavfi_codegen/generate_studio_catalog.py7.4Near-cleanCyclomatic Complexity: generate_studio_catalog._param_spec (cyclomatic 19)
lib/src/dsp/band_processor.dart7.4Near-cleanCognitive Complexity: BandProcessor.process (cognitive 21)
tool/diagrams/system.py7.4Near-cleanCognitive Complexity: system.timeline (cognitive 19)
tool/codegen/lavfi_codegen/config.py7.8Near-cleanCyclomatic Complexity: config.load_config (cyclomatic 26)
lib/src/internals/event_end_of_content.dart7.8Near-cleanCyclomatic Complexity: _EndOfContent.send (cyclomatic 17)
android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt7.8Near-cleanCyclomatic Complexity: MediaSessionManager.onMethodCall (cyclomatic 17)
lib/src/player/mixins/player_open_all.part.dart7.8Near-cleanCognitive Complexity: _OpenAllRun.run (cognitive 21)
lib/src/internals/entry_table.dart7.8Near-cleanCognitive Complexity: EntryTable.onPlaylist (cognitive 16)
REDACTED7.9Near-cleanStatic Analysis (SAST): Medium: REDACTED
lib/src/player/player_state.dart8.0Near-cleanChange Coupling: Boundary-crossing change coupling: player_state.dart ↔ default_reactives.dart
lib/src/player/player_stream.dart8.0Near-cleanChange Coupling: Boundary-crossing change coupling: player_stream.dart ↔ default_specs.dart
lib/src/models/media_session.dart8.5Near-cleanCyclomatic Complexity: MediaSession.== (cyclomatic 16)
lib/src/player/mixins/player_queue.part.dart8.5Near-cleanCognitive Complexity: _QueueModule.replace (cognitive 29)

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

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

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

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

Could not be resolved — 17

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 53 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 — 53 dimensions across the health lenses
D1D2D3D4D5D6D7D13D14D15D17D19D20D26D28D29D30D34D35D36D43D44AX10AX3AX4AX6AX8AX9GD1IC1M1M2M3M4P1P10P2P3P6PF3X1X12X16X17X18X21X25X27X28X29X3X30X5

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, 175 of 180 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 01a1e8e7-a38f-7367-a810-9c0dd46fb5a9.

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: this repository's production source spans .py, .dart, and our analyzer cannot run the .dart test suite(s) — so no coverage was collected for the repository as a whole. The Python half did build and run, and its own line coverage came back at 42.8% — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero.
  • 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 (.dart, .kt) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 3 Maven/Gradle manifest(s) were read, stating a version for 5 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
  • 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 Swift Package.swift/Package.resolved, but the licence verdict published here was taken over its pub package dependencies. Nothing was read about its SwiftPM 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 a Gradle build (build.gradle/build.gradle.kts), but the licence verdict published here was taken over its pub package 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.
  • 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 (4 contributor(s) across 1267 commit(s) sampled, automation and bot accounts excluded). One of them holds 100% of the history; the other 3 hold 0% 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.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D24 Comment Value — 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 the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • 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. `android/settings.gradle.kts` 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.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: a native UI project (test_app/pubspec.yaml). The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • C1 Data Protection — 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 personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — 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.
  • C3 Audit Trail — 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 audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
  • C4 Data Retention — not measured this run — 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 retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
  • C5 Data-Subject Rights — not measured this run — 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 data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • 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.
  • X2 Cancellation propagation — 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, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, 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.
  • 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 (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

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.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • 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.
  • 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.
  • 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.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • 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.9 / 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.9 / 10 · rule-coverage 100% · ceiling Prevented

22 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was parse.parse_options_block at 52.

MediaSessionPlugin.publishNowPlaying (cyclomatic 34) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548
MediaSessionPlugin.installCommandTargetsIfNeeded (cyclomatic 24) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824
MediaSessionPlugin.handle (cyclomatic 19) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162
MediaSessionPlugin.handleAudioSessionInterruption (cyclomatic 16) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425
parse.parse_options_block (cyclomatic 52)tool/codegen/lavfi_codegen/parse.py:663

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

What to do

  1. Bring the 3 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with parse.parse_options_block (cyclomatic 52), MediaSessionPlugin.publishNowPlaying (cyclomatic 34), MediaSessionPlugin.publishNowPlaying (cyclomatic 34). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cyclomatic Complexity from 6.9 to about 7.5/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.3 / 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.3 / 10 · rule-coverage 100% · ceiling Prevented

50 method(s) exceeded the cognitive complexity threshold of 15; the worst was parse.parse_options_block at 117.

MediaSessionPlugin.publishNowPlaying (cognitive 34) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548
MediaSessionPlugin.handle (cognitive 26) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162
MediaSessionPlugin.handleAudioSessionInterruption (cognitive 24) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425
MediaSessionPlugin.installCommandTargetsIfNeeded (cognitive 22) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824
parse.parse_options_block (cognitive 117)tool/codegen/lavfi_codegen/parse.py:663

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

What to do

  1. Bring the 1 body over 60 down to 60 or less in Cognitive Complexity — start with parse.parse_options_block (cognitive 117). — Refactoring it lifts Cognitive Complexity from 4.3 to about 5.5/10.

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

D3 · God Classes9.5 / 10Stronggated by 8 serious findings✓ 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 9.5 / 10 · rule-coverage 100% · ceiling Prevented

8 god class(es) detected.

TooManyMethods: PlayerApi · ×4lib/src/player/player_api.dart:31
ClassTooLong: MediaSessionPlugin · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:47
FileTooLong: mpv_audio_kit/MediaSessionPlugin.swift · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift

What to do

  1. Resolve the 4 TooManyMethods finding(s) in God Classes — start with MediaSessionPlugin.swift (2), player_api.dart, base.py. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 2 ClassTooLong finding(s) in God Classes — start with MediaSessionPlugin.swift (2). — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 FileTooLong finding(s) in God Classes — start with MediaSessionPlugin.swift (2). — 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 Duplication8.1 / 10Strong✓ 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 8.1 / 10 · rule-coverage 100% · ceiling Verified

33 duplicated block group(s) detected. 4.7 % of the production lines (1,972 of 41,805) are in a reported copy. A further 4 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) · ×3darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:782
Duplicated block (38 lines × 2) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:290
Duplicated block (26 lines × 2) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:263
Duplicated block (24 lines × 2) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:120
Duplicated block (17 lines × 2) · ×2darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:729

+ 23 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 MediaSessionPlugin.swift (3). — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 2 Duplicated block (38 lines × 2) finding(s) in Code Duplication — start with MediaSessionPlugin.swift (2). — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 Duplicated block (26 lines × 2) finding(s) in Code Duplication — start with MediaSessionPlugin.swift (2). — 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 · Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

9 production modules (Gradle+SwiftPM+pub), 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; 0 module(s) off the main sequence, with abstractness counted on 6 of the 9 (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).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.7 / 10Stronggated by 2 serious findings✓ 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 9.7 / 10 · rule-coverage 100% · ceiling Verified

2 of 78 classes have LCOM4 above 3.

Low cohesion: OpenedMpvLibrary (LCOM4 20) · ×2lib/src/ffi/mpv_library_opened.dart:14

What to do

  1. Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with mpv_library_opened.dart, pcm_native_io.dart. — One of this dimension's main actionable groups (2 warning-level).

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

D7 · Architectural Integrity6.0 / 10Adequate✓ Tool-verified

What it measures: Whether the code respects its intended layering / architecture rules.

Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.

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

No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).

Detailed fixes: d7_recommendation.md.

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 15 resolved pub package(s) use a banned license. Licences were read from pub.dev's analysis of each package's licence file. ★ This repository commits no pubspec.lock (Dart's guidance for a package), so the graph was closed here: the 6 package(s) its pubspec declares under dependencies, and transitively every package their published pubspecs declare, each at the newest release its constraint admits — the release a fresh `pub get` picks wherever constraints agree; where two disagree the first to reach the package was taken. dev_dependencies are not part of it. The packages the `flutter`, `flutter_web_plugins` SDK itself pins are the toolchain's and were not reached. ★ COVERAGE OF THIS VERDICT: it grades this repository's pub package dependencies and nothing else. The repository also declares a Swift Package.swift/Package.resolved and a Gradle build (build.gradle/build.gradle.kts), 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.9 / 10Stronggated by 23 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.9 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: hook/build.dart (42×23=966); darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift (15×34=510); tool/codegen/lavfi_codegen/generate.py (19×23=437) Repeated repair below the complexity floor: lib/src/player/mixins/player_dispatch.part.dart (33 of 60 changes were fixes); lib/src/internals/event_isolate.dart (31 of 47 changes were fixes); lib/src/media_session/media_session_controller.dart (26 of 39 changes were fixes)

Repeated repair: lib/src/player/mixins/player_dispatch.part.dart · ×17lib/src/player/mixins/player_dispatch.part.dart:62
Hotspot: hook/build.dart · ×6hook/build.dart:193

What to do

  1. Resolve the 17 Repeated repair finding(s) in Churn × Complexity Hotspots — start with player_dispatch.part.dart, event_isolate.dart, media_session_controller.dart. — One of this dimension's main actionable groups (17 warning-level).
  2. Resolve the 6 Hotspot finding(s) in Churn × Complexity Hotspots — start with build.dart, MediaSessionPlugin.swift, generate.py. — One of this dimension's main actionable groups (6 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 41805 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

2 of 2 documentation facets pass in full. 24 document(s) read across 10 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D20 · ADR Quality10.0 / 10Exemplary○ Nothing flagged

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

0 of 3 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question, a date that is no calendar day). How well each record argues its case is not measured.

✓ On the Gold path — maintain.

Detailed fixes: d20_recommendation.md.

D26 · Project Cohesion7.1 / 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.1 / 10 · rule-coverage 100% · ceiling Documented

1 of 7 build units (Gradle, SwiftPM, pub) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesionpubspec.yaml:1

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with pubspec.yaml. — 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.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)6.4 / 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 6.4 / 10 · rule-coverage 100% · ceiling Documented

4 finding(s): 0 critical, 2 high, 2 medium, 0 low. semgrep hit a parse error in 5 file(s) — `scripts/check_android_relocs.sh` (line 42, lines 75–145), `scripts/ci/check_trailers.sh` (line 54), `scripts/ci/verify_red.sh` (line 49), `scripts/publish.sh` (lines 105–106), `scripts/update_libmpv.sh` (line 56) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED

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. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

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 176 of the 253 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change Coupling9.8 / 10Adequategated by 3 critical findings✓ Tool-verified

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

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

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

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

Strongest change-coupling: build.dart↔Package.swift 86%; player_state.dart↔default_reactives.dart 55%; player_stream.dart↔default_specs.dart 50%

Boundary-crossing change coupling: build.dart ↔ Package.swift · ×3hook/build.dart:1

What to do

  1. Resolve the 3 Boundary-crossing change coupling finding(s) in Change Coupling — start with build.dart, player_state.dart, player_stream.dart. — One of this dimension's main actionable groups (3 issue-level).

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

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

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

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

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

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

REDACTED
REDACTED
REDACTED

What to do

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

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

  • `MpvLibrary` declares 20 abstract methods: `mpvCreate`, `mpvInitialize`, `mpvTerminateDestroy`, `mpvWakeup`, `mpvSetOptionString`, `mpvSetPropertyString`, `mpvGetPropertyString`, `mpvGetProperty`, `mpvSetPropertyAsync`, `mpvGetPropertyAsync`, `mpvCommandAsync`, `mpvCommandString`, `mpvWaitEvent`, `mpvObserveProperty`, `mpvFree`, `mpvFreeNodeContents`, `mpvErrorString`, `mpvRequestLogMessages`, `mpvHookAdd`, `mpvHookContinue`. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it 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. — lib/src/ffi/mpv_library.dart:18
  • `PlayerApi` declares 88 abstract methods: `configuration`, `state`, `stream`, `dispose`, `open`, `openAll`, `openPlaylistFile`, `openPcmStream`, `play`, `pause`, `stop`, `seek`, `seekToPercent`, `revertSeek`, `setChapter`, `setChapters`, `setAbLoopA`, `setAbLoopB`, `setAbLoopCount`, `writeResumeConfig`, `deleteResumeConfig`, `add`, `remove`, `next`, `previous`, `nextPlaylist`, `previousPlaylist`, `jump`, `move`, `replace`, `insert`, `clearPlaylist`, `setLoop`, `setShuffle`, `setPrefetchPlaylist`, `setVolume`, `setRate`, `setPitch`, `setMute`, `setAudioDevice`, and 48 more. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it 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. — lib/src/player/player_api.dart:31

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

Other · Code Health — Unreviewed-generation residue in this repository's Dart: methods whose whole body still throws UnimplementedError or a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

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

IC1 · Incompleteness & stubs10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Dart: methods that only throw UnimplementedError or a "not implemented" exception, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

M1 · Documentation (README)9.1 / 10Exemplary✓ 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.

M2 · Architecture documentation10.0 / 10Exemplary✓ 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.

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

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

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

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

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

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

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

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

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

P10 · Library API & versioning8.9 / 10Exemplary✓ Tool-verified

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

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

  • 57 public types in `repository.src` are marked as implementation by their own namespace, folder or name: `CoreCalls` (lib/src/internals/core_calls.dart:51, `internals`), `MpvIsolateEvent` (lib/src/internals/core_events.dart:12, `internals`), `MpvPropertyEvent` (lib/src/internals/core_events.dart:17, `internals`), `MpvReplyEvent` (lib/src/internals/core_events.dart:20, `internals`), `MpvEventStartFile` (lib/src/internals/core_events.dart:23, `internals`), `MpvEventFileLoaded` (lib/src/internals/core_events.dart:33, `internals`), `MpvEventPlaybackRestart` (lib/src/internals/core_events.dart:113, `internals`), `MpvEventEndFile` (lib/src/internals/core_events.dart:129, `internals`), and 49 more. While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers. — lib/src/internals/core_calls.dart:51

What to do

  • Hide `repository.src` (`CoreCalls`, `MpvIsolateEvent`, `MpvPropertyEvent`, `MpvReplyEvent`, `MpvEventStartFile`, `MpvEventFileLoaded`, `MpvEventPlaybackRestart`, `MpvEventEndFile`, and 49 more) (Dart: a `_` name, or keep it under `lib/src/` unexported; Kotlin: `internal`; Swift: leave it `internal` (the default) instead of `public`): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
P2 · Observability0.0 / 10Critical✓ 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.

  • No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.

What to do

  • Write a diagnostic trail the user can hand back with a bug report: log through `package:logging` to a file in the app's support directory that a report can attach. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
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 the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 6 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. — .github/workflows/ci.yml:6
  • `android/build.gradle.kts` 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`. — android/build.gradle.kts:74

What to do

  • Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — 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.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

PF3 · Async & latency 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.

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.

X17 · Uncapped recursion over a caller-supplied document3.5 / 10Weak✓ Tool-verified

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

  • `materializeBytes` is public and takes `Object ? value` from its caller, and it calls itself at line 125 (`materializeBytes`) with a piece of `value` (and at line 130) — and nowhere in `materializeBytes` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `materializeBytes` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/src/internals/native_memory.dart:125

What to do

  • Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
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.

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` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a `for … in` loop leaves the `List`, `Map` or `Set` it is walking alone — Dart's collection iterators check that the collection has not changed since the loop began, so a body that adds to or removes from the very collection the loop is walking (or the map whose `keys`, `values` or `entries` it walks) makes the next step throw `ConcurrentModificationError` and the remaining elements are never seen. 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.

  • `except 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. — tool/codegen/lavfi_codegen/generate.py:720
  • 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. (×9) — lib/src/web/mpv_audio_kit_web.dart:316, lib/src/web/mpv_audio_kit_web.dart:331, lib/src/player/mixins/player_teardown.part.dart:49, …
  • `catch (_)` 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. (×7) — lib/src/media_session/artwork_download_io.dart:71, lib/src/media_session/artwork_download_io.dart:131, lib/src/media_session/artwork_download_io.dart:177, …

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types9.5 / 10Exemplary✓ Tool-verified

Other · Code Health — Whether Dart's sound null safety is on and is not undermined by null assertions — a package whose `environment: sdk:` lower bound is 2.12 or above is null safe, so `String` cannot hold null and `String?` must be checked before use, and each postfix `!` is a run-time `Null check operator used on a null value` the author has told the analyzer cannot happen.

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

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 Health78.8StrongSolid.
Architecture93.3ExemplarySolid.
Maturity97.0ExemplarySolid.
Readiness44.8Adequate — gated by P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security78.4Checked 4 of 10Solid.
Performance100.0ExemplaryStrongest area.
Unscored — 2 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.

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • X10 Duplicated predicate — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 5 control(s) we could not find positive evidence for

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

  • C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 58 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 web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's Dart imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Kotlin imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Swift imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • 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 function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. 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. Dart isolates share no mutable memory, so no two requests write one object at the same instant.
  • 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
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • D10 Test Quality — ~56266 lines of test source are present (.dart, .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 — no .dart test runner
  • D12 Dependency Hygiene — Not scored — 3 Maven/Gradle manifest(s) were read, stating a version for 5 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
  • 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.
  • D21 Naming Consistency — N/A — too few peers to establish a naming convention (10485 declarations, no unit with a dominant convention).
  • D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed Swift surface was not measured.
  • 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 — this repository's production source is .dart, .kt, .py, .swift, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — None of 3 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.dart), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • 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) — 1 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.
  • D8 Code Coverage — Coverage not measured — polyglot repository, one half has no runner
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (11 value object(s))
  • 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
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
  • 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
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Dart, JVM, Python, 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 data present for 8 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for classes extending benchmark_harness's `BenchmarkBase`, `AsyncBenchmarkBase` or `PerfBenchmarkBase` (directly or through a base of your own), `benchmark(…)` calls under the pub `benchmark` package, Flutter's `benchmarkWidgets`, `watchPerformance` or `traceAction` in a test importing flutter_test, integration_test or flutter_driver, or benchmark_harness, benchmark or web_benchmarks in a pubspec.yaml, 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.
  • 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
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X20 Mistyped argument guard — 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 11% of this repository's production lines — dart (32,170 lines), cpp (2,510 lines), swift (2,308 lines), kotlin (2,262 lines), c (642 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
  • 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 Dart was read, and it logs through none: package:logging, package:logger, talker and dart:developer take one finished message and no template arguments or fields (as log4net does in C#), so an interpolated message there loses nothing the API could have kept. Sentry's structured logs (`Sentry.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.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 5 finding(s)
D35 · Change Coupling · Boundary-crossing change coupling · ×3
  • Boundary-crossing change coupling: build.dart ↔ Package.swift hook/build.dart:1 — `hook/build.dart` (context hook) and `tvos/Package.swift` (context tvos) sit in DIFFERENT parts of the tree yet change together 86% of the time (12 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `cf555047` chore(libmpv): pin the published libmpv-r26, of Build 43921534261; `afe348c6` chore(libmpv): pin libmpv-r26 of Build 43843399097; `f755a62a` chore(libmpv): pin libmpv-r26 of Build 43737297278 — run `git show` on any of them.
  • Boundary-crossing change coupling: player_state.dart ↔ default_reactives.dart lib/src/player/player_state.dart:1 — `lib/src/player/player_state.dart` (context player) and `lib/src/reactive/default_reactives.dart` (context reactive) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `14e6c2db` docs: what the system volume, the media role and the output state reach; `fe2a6814` fix: audioDriver starts empty, as mpv reports the automatic choice; `37d8209c` fix: A-B loop points apply to the current file only — run `git show` on any of them.
  • Boundary-crossing change coupling: player_stream.dart ↔ default_specs.dart lib/src/player/player_stream.dart:1 — `lib/src/player/player_stream.dart` (context player) and `lib/src/reactive/default_specs.dart` (context reactive) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `ca22a6fb` feat(state): the hint over an estimated duration, and the same file k…; `e2734f06` docs: comments that still described the eof-reached hook, JSON and ol…; `b706e1dc` feat!: synchronous Dart-side setters, exact values in state, one emis… — run `git show` on any of them.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 164 finding(s)
D15 · Churn × Complexity Hotspots · Repeated repair · ×17
  • Repeated repair: lib/src/player/mixins/player_dispatch.part.dart lib/src/player/mixins/player_dispatch.part.dart:62 — lib/src/player/mixins/player_dispatch.part.dart changed 60 times in last 90 days and 33 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is _DispatchModule._dispatchEvent at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(player): the Media cache drops the entries that left the playlist and the URLs of earlier loads”; “fix(player): a core that shuts down by itself closes the session, and sendRawCommand refuses quit”; “fix(state): a new file clears the analysis, and the hint follows the index”; “fix: openAll hides the old entry it keeps in mpv after its jump”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/player/mixins/player_dispatch.part.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/internals/event_isolate.dart lib/src/internals/event_isolate.dart:69 — lib/src/internals/event_isolate.dart changed 47 times in last 90 days and 31 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is MpvEventIsolate.start at line 69), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(event-isolate): the writes mpv refuses at bring-up are reported on internalLog”; “fix(player): a core left alone by a late event isolate is destroyed once the isolate exits”; “fix: a pause in the last buffer keeps the rest, and play() plays it”; “fix: a byte array of SIZE_MAX bytes fails the decode again, on internalLog”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/internals/event_isolate.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/media_session/media_session_controller.dart lib/src/media_session/media_session_controller.dart:393 — lib/src/media_session/media_session_controller.dart changed 39 times in last 90 days and 26 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is MediaSessionController._downloadedArtwork at line 393), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(session): the drive path rule follows the host under flutter test too”; “fix(session): xesam:url of a POSIX path that starts like a drive is published”; “fix(session): xesam:url of a file whose name is not UTF-8 names that file”; “fix(session): xesam:url does not decode an escape inside a malformed one”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/media_session/media_session_controller.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/player/mixins/player_playback.part.dart lib/src/player/mixins/player_playback.part.dart:9 — lib/src/player/mixins/player_playback.part.dart changed 38 times in last 90 days and 22 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is _PlaybackModule.play at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(player): setChapter(-1) shows null, setAudioSpdif and openAll copy what they are given”; “fix(player): the reads inside a call no longer refuse a player disposed meanwhile”; “fix(docs): no reference to a deprecated flat field, and the 0.7.0 entry says the constructor change”; “fix(docs): the references to a group's field name its class”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/player/mixins/player_playback.part.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/player/mixins/player_hooks.part.dart lib/src/player/mixins/player_hooks.part.dart:227 — lib/src/player/mixins/player_hooks.part.dart changed 32 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is _HooksModule._routeHookEvent at line 227), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(player): a registerHook made while the same hook registers waits for mpv, and a failed one can be retried”; “fix(player): the reads inside a call no longer refuse a player disposed meanwhile”; “fix(player): the Media cache drops the entries that left the playlist and the URLs of earlier loads”; “fix!: a libmpv of another release than the pin fails bring-up”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/player/mixins/player_hooks.part.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/media_session/media_session_channel.dart lib/src/media_session/media_session_channel.dart:65 — lib/src/media_session/media_session_channel.dart changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is MediaSessionMetadataSnapshot.== at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(session): supportedPlaybackRates crosses the channel as a plain list”; “fix(session): the play state no longer waits for the metadata push”; “fix(session): the session is a true no-op on a platform without a plugin”; “fix(docs): no reference to a deprecated flat field, and the 0.7.0 entry says the constructor change”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/media_session/media_session_channel.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/internals/event_logic.dart lib/src/internals/event_logic.dart:135 — lib/src/internals/event_logic.dart changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is EventLogic.property at line 135), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(events): a property reported unavailable after the restart is read again”; “fix: a pause in the last buffer keeps the rest, and play() plays it”; “fix!: a libmpv of another release than the pin fails bring-up”; “fix: FILE_LOADED goes out before the reads kept for END_FILE”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/internals/event_logic.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: lib/src/types/sealed/media_session_artwork.dart lib/src/types/sealed/media_session_artwork.dart:79 — lib/src/types/sealed/media_session_artwork.dart changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is MediaSessionArtworkCustom.== at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(models): toString hides the query values of a URL, in extras and artwork too”; “fix: covers from Android providers on a queue of their own, checked as images”; “fix: a content:// cover shows on Android again, read by the ContentResolver”; “fix: covers reach the plugins as bytes only, file:// read in Dart everywhere”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/types/sealed/media_session_artwork.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MpvControllerPlayer.kt android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MpvControllerPlayer.kt:55 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MpvControllerPlayer.kt changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is MpvControllerPlayer.getState at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: Android disarms the resume of a call on a stop from a controller too”; “fix: Android keeps a pause made during a call, and a play then waits for the call to end”; “fix: Android keeps the media service in the foreground through a call”; “fix: covers reach the plugins as bytes only, file:// read in Dart everywhere”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MpvControllerPlayer.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.
  • Repeated repair: lib/src/internals/event_properties.dart lib/src/internals/event_properties.dart:191 — lib/src/internals/event_properties.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is _PropertyForwarder._forwardValue at line 191), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(events): a property reported unavailable after the restart is read again”; “fix: END_FILE carries the duration and position of the entry that ended (kit-core-2)”; “fix: a park read while an unpause was in effect is read again”; “fix: the park position is not undone by a time-pos change mpv sampled before it”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/internals/event_properties.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/MpvAudioKitPlugin.kt android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/MpvAudioKitPlugin.kt:51 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/MpvAudioKitPlugin.kt changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is MpvAudioKitPlugin.onAttachedToEngine at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(android): the media keys of a remote reach the player on Android 7 and 8”; “fix: covers from Android providers on a queue of their own, checked as images”; “fix: the Android media session belongs to the engine that enabled it”; “fix: openFileDescriptor runs off the main thread”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/MpvAudioKitPlugin.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.
  • Repeated repair: lib/src/internals/entry_table.dart lib/src/internals/entry_table.dart:164 — lib/src/internals/entry_table.dart changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is EntryTable.onPlaylist at line 164), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(player): a loadfile reply remaps the playlist a FILE_LOADED read”; “fix: openAll hides the old entry it keeps in mpv after its jump”; “fix!: a libmpv of another release than the pin fails bring-up”; “fix: the source resolver runs on on_prefetch, while the current entry plays (F9)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/internals/entry_table.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/AudioFocusController.kt android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/AudioFocusController.kt:219 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/AudioFocusController.kt changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is AndroidFocusPort.listenNoisy at line 219), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: a pause or a stop of the app during a call disarms the resume on Android”; “fix: Android keeps a pause made during a call, and a play then waits for the call to end”; “fix: Android keeps the media service in the foreground through a call”; “fix: the focus resume is armed only when the player was playing”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/AudioFocusController.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.
  • Repeated repair: lib/src/internals/event_sequencer.dart lib/src/internals/event_sequencer.dart:87 — lib/src/internals/event_sequencer.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is EventSequencer._pumpLoop at line 87), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: the web pump runs idle after every event, as the native one (kit-web-6)”; “fix: a park read while an unpause was in effect is read again”; “fix: a wakeup of the web module never runs in the middle of its calls”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/internals/event_sequencer.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: tool/codegen/lavfi_codegen/required_params.py tool/codegen/lavfi_codegen/required_params.py:186 — tool/codegen/lavfi_codegen/required_params.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is required_params.apply_not_live at line 186), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: an adelay delays change rebuilds the stage”; “fix: alimiter, agate and the shifters rebuild for options they read at setup”; “fix(codegen): Min and Max constants the filter accepts”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- tool/codegen/lavfi_codegen/required_params.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/InterruptionLogic.kt android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/InterruptionLogic.kt:51 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/InterruptionLogic.kt changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is InterruptionLogic.onFocusChange at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: Android disarms the resume of a call on a stop from a controller too”; “fix: Android keeps a pause made during a call, and a play then waits for the call to end”; “fix: the focus resume is armed only when the player was playing”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/InterruptionLogic.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.
  • Repeated repair: android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionMappers.kt android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionMappers.kt:54 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionMappers.kt changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is MediaSessionMappers.buildCommands at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: covers from Android providers on a queue of their own, checked as images”; “fix: covers reach the plugins as bytes only, file:// read in Dart everywhere”; “fix(android): next and previous from media keys and the notification”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionMappers.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.
X3 · Exception handling · Swallowed exception (empty catch) · ×9
  • Swallowed exception (empty catch) lib/src/web/mpv_audio_kit_web.dart:316 — 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) lib/src/web/mpv_audio_kit_web.dart:331 — 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) lib/src/player/mixins/player_teardown.part.dart:49 — 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) lib/src/player/mixins/player_teardown.part.dart:113 — 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) lib/src/backend/native_backend.dart:221 — 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) lib/src/backend/web/web_registry.dart:118 — 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) lib/src/backend/web/web_registry.dart:123 — 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) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt:488 — 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) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt:511 — 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×8
  • Swallowed exception (caught, then discarded) tool/codegen/lavfi_codegen/generate.py:720 — `except 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) lib/src/media_session/artwork_download_io.dart:71 — `catch (_)` 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) lib/src/media_session/artwork_download_io.dart:131 — `catch (_)` 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) lib/src/media_session/artwork_download_io.dart:177 — `catch (_)` 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) lib/src/media_session/artwork_download_web.dart:94 — `catch (_)` 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) lib/src/media_session/artwork_sources.dart:47 — `catch (_)` 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) lib/src/backend/web/mpv_module.dart:418 — `catch (_)` 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) lib/src/backend/web/web_registry.dart:98 — `catch (_)` 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×6
  • Hotspot: hook/build.dart hook/build.dart:193 — hook/build.dart changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _Target.of at line 193. 5 of those changes were fix/bug commits, and the other 37 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 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- hook/build.dart`: 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: darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in MediaSessionPlugin.publishNowPlaying at line 548. 5 of those changes were fix/bug commits, and the other 10 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 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift`: 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: tool/codegen/lavfi_codegen/generate.py tool/codegen/lavfi_codegen/generate.py:774 — tool/codegen/lavfi_codegen/generate.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in generate._emit_class_doc at line 774. 5 of those changes were fix/bug commits, and the other 14 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- tool/codegen/lavfi_codegen/generate.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt:225 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MediaSessionManager.onMethodCall at line 225. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.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: lib/src/internals/event_end_of_content.dart lib/src/internals/event_end_of_content.dart:40 — lib/src/internals/event_end_of_content.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _EndOfContent.send at line 40. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- lib/src/internals/event_end_of_content.dart`: 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: tool/codegen/lavfi_codegen/config.py tool/codegen/lavfi_codegen/config.py:164 — tool/codegen/lavfi_codegen/config.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in config.load_config at line 164. 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 20:16:54 +01:00' --until='2026-11-16 20:16:54 +01:00' --full-history --no-merges -- tool/codegen/lavfi_codegen/config.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D3 · God Classes · TooManyMethods · ×4
  • TooManyMethods: PlayerApi lib/src/player/player_api.dart:31 — TooManyMethods — 88 methods. The bar is 30 methods; this is 58 over it, 2.93× 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.
  • TooManyMethods: MediaSessionPlugin darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:47 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 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.
  • TooManyMethods: MediaSessionPlugin tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:47 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 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.
  • TooManyMethods: D tool/diagrams/base.py:82 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× 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.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:782 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:782-790 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:782-790 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:536 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:536-544 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:536-544 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1123 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1123-1131 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1123-1131 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D1 · Cyclomatic Complexity · MediaSessionPlugin.publishNowPlaying (cyclomatic 34) · ×2
  • MediaSessionPlugin.publishNowPlaying (cyclomatic 34) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548 — MediaSessionPlugin.publishNowPlaying has cyclomatic complexity 34 (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.
  • MediaSessionPlugin.publishNowPlaying (cyclomatic 34) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548 — MediaSessionPlugin.publishNowPlaying has cyclomatic complexity 34 (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 · MediaSessionPlugin.installCommandTargetsIfNeeded (cyclomatic 24) · ×2
  • MediaSessionPlugin.installCommandTargetsIfNeeded (cyclomatic 24) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824 — MediaSessionPlugin.installCommandTargetsIfNeeded 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.
  • MediaSessionPlugin.installCommandTargetsIfNeeded (cyclomatic 24) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824 — MediaSessionPlugin.installCommandTargetsIfNeeded 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 · MediaSessionPlugin.handle (cyclomatic 19) · ×2
  • MediaSessionPlugin.handle (cyclomatic 19) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162 — MediaSessionPlugin.handle 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.
  • MediaSessionPlugin.handle (cyclomatic 19) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162 — MediaSessionPlugin.handle 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 · MediaSessionPlugin.handleAudioSessionInterruption (cyclomatic 16) · ×2
  • MediaSessionPlugin.handleAudioSessionInterruption (cyclomatic 16) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425 — MediaSessionPlugin.handleAudioSessionInterruption 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.
  • MediaSessionPlugin.handleAudioSessionInterruption (cyclomatic 16) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425 — MediaSessionPlugin.handleAudioSessionInterruption 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 · MediaSessionPlugin.publishNowPlaying (cognitive 34) · ×2
  • MediaSessionPlugin.publishNowPlaying (cognitive 34) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548 — MediaSessionPlugin.publishNowPlaying has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 15, if/else 14 (15 pts), ternaries 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.
  • MediaSessionPlugin.publishNowPlaying (cognitive 34) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548 — MediaSessionPlugin.publishNowPlaying has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 15, if/else 14 (15 pts), ternaries 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 · MediaSessionPlugin.handle (cognitive 26) · ×2
  • MediaSessionPlugin.handle (cognitive 26) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162 — MediaSessionPlugin.handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, 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.
  • MediaSessionPlugin.handle (cognitive 26) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162 — MediaSessionPlugin.handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, 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 · MediaSessionPlugin.handleAudioSessionInterruption (cognitive 24) · ×2
  • MediaSessionPlugin.handleAudioSessionInterruption (cognitive 24) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425 — MediaSessionPlugin.handleAudioSessionInterruption has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • MediaSessionPlugin.handleAudioSessionInterruption (cognitive 24) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425 — MediaSessionPlugin.handleAudioSessionInterruption has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MediaSessionPlugin.installCommandTargetsIfNeeded (cognitive 22) · ×2
  • MediaSessionPlugin.installCommandTargetsIfNeeded (cognitive 22) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824 — MediaSessionPlugin.installCommandTargetsIfNeeded has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • MediaSessionPlugin.installCommandTargetsIfNeeded (cognitive 22) tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824 — MediaSessionPlugin.installCommandTargetsIfNeeded has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D3 · God Classes · ClassTooLong · ×2
  • ClassTooLong: MediaSessionPlugin darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:47 — ClassTooLong — 645 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 245 over it, 1.61× 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: MediaSessionPlugin tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:47 — ClassTooLong — 645 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 245 over it, 1.61× 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.
D3 · God Classes · FileTooLong · ×2
  • FileTooLong: mpv_audio_kit/MediaSessionPlugin.swift darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift — FileTooLong — 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MediaSessionPlugin (47-1159). The bar is 500 significant lines; this is 157 over it, 1.31× 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: mpv_audio_kit/MediaSessionPlugin.swift tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift — FileTooLong — 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MediaSessionPlugin (47-1159). The bar is 500 significant lines; this is 157 over it, 1.31× 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.
D4 · Code Duplication · Duplicated block (38 lines × 2) · ×2
  • Duplicated block (38 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:290 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:290-327 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:290-327 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (38 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:341 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:341-378 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:341-378 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×2
  • Duplicated block (26 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:263 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:263-288 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:263-288 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (26 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:750 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:750-775 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:750-775 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×2
  • Duplicated block (24 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:120 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:120-143 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:120-143 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (24 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:792 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:792-815 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:792-815 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:729 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:729-745 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:729-745 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (17 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1056 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1056-1072 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1056-1072 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:681 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:681-696 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:681-696 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (16 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:965 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:965-980 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:965-980 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×2
  • Duplicated block (10 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:483 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:483-492 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:483-492 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:496 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:496-505 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:496-505 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1048 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1048-1054 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1048-1054 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1152 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1152-1158 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1152-1158 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D6 · Cohesion (LCOM4) · Low cohesion · ×2
  • Low cohesion: OpenedMpvLibrary (LCOM4 20) lib/src/ffi/mpv_library_opened.dart:14 — OpenedMpvLibrary's methods fall into 20 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 20 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: _LookupPcmNative (LCOM4 7) lib/src/pcm/pcm_native_io.dart:68 — _LookupPcmNative's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D1 · Cyclomatic Complexity · parse.parse_options_block (cyclomatic 52) · ×1
  • parse.parse_options_block (cyclomatic 52) tool/codegen/lavfi_codegen/parse.py:663 — parse.parse_options_block has cyclomatic complexity 52 (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 · config.load_config (cyclomatic 26) · ×1
  • config.load_config (cyclomatic 26) tool/codegen/lavfi_codegen/config.py:164 — config.load_config has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _Target.of (cyclomatic 23) · ×1
  • _Target.of (cyclomatic 23) hook/build.dart:193 — _Target.of has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · generate._emit_class_doc (cyclomatic 23) · ×1
  • generate._emit_class_doc (cyclomatic 23) tool/codegen/lavfi_codegen/generate.py:774 — generate._emit_class_doc has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · parse._parse_flag_bits (cyclomatic 20) · ×1
  • parse._parse_flag_bits (cyclomatic 20) tool/codegen/lavfi_codegen/parse.py:580 — parse._parse_flag_bits 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 · generate_studio_catalog._param_spec (cyclomatic 19) · ×1
  • generate_studio_catalog._param_spec (cyclomatic 19) tool/codegen/lavfi_codegen/generate_studio_catalog.py:164 — generate_studio_catalog._param_spec 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 · parse.find_filter_options_pairs (cyclomatic 19) · ×1
  • parse.find_filter_options_pairs (cyclomatic 19) tool/codegen/lavfi_codegen/parse.py:906 — parse.find_filter_options_pairs 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 · generate.run (cyclomatic 18) · ×1
  • generate.run (cyclomatic 18) tool/codegen/lavfi_codegen/generate.py:1522 — generate.run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · _EndOfContent.send (cyclomatic 17) · ×1
  • _EndOfContent.send (cyclomatic 17) lib/src/internals/event_end_of_content.dart:40 — _EndOfContent.send 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 · MediaSessionManager.onMethodCall (cyclomatic 17) · ×1
  • MediaSessionManager.onMethodCall (cyclomatic 17) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt:225 — MediaSessionManager.onMethodCall 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 · MediaSession.== (cyclomatic 16) · ×1
  • MediaSession.== (cyclomatic 16) lib/src/models/media_session.dart:225 — MediaSession.== 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 · parse._resolve_symbol (cyclomatic 16) · ×1
  • parse._resolve_symbol (cyclomatic 16) tool/codegen/lavfi_codegen/parse.py:339 — parse._resolve_symbol has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · parse.parse_filters_texi (cyclomatic 16) · ×1
  • parse.parse_filters_texi (cyclomatic 16) tool/codegen/lavfi_codegen/parse.py:1103 — parse.parse_filters_texi has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · parse.assemble_schema (cyclomatic 16) · ×1
  • parse.assemble_schema (cyclomatic 16) tool/codegen/lavfi_codegen/parse.py:1200 — parse.assemble_schema 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 · parse.parse_options_block (cognitive 117) · ×1
  • parse.parse_options_block (cognitive 117) tool/codegen/lavfi_codegen/parse.py:663 — parse.parse_options_block has cognitive complexity 117 (threshold 15). Drivers by points: if/else 33 (89 pts), boolean chains 13, loops 4 (8 pts), error handling 1 (5 pts), ternaries 1 (2 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · generate._emit_class_doc (cognitive 44) · ×1
  • generate._emit_class_doc (cognitive 44) tool/codegen/lavfi_codegen/generate.py:774 — generate._emit_class_doc has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 3 (9 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parse.parse_filters_texi (cognitive 42) · ×1
  • parse.parse_filters_texi (cognitive 42) tool/codegen/lavfi_codegen/parse.py:1103 — parse.parse_filters_texi has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 7 (16 pts), ternaries 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · parse.assemble_schema (cognitive 36) · ×1
  • parse.assemble_schema (cognitive 36) tool/codegen/lavfi_codegen/parse.py:1200 — parse.assemble_schema has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · config.load_config (cognitive 32) · ×1
  • config.load_config (cognitive 32) tool/codegen/lavfi_codegen/config.py:164 — config.load_config has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 12, 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 · parse._parse_flag_bits (cognitive 31) · ×1
  • parse._parse_flag_bits (cognitive 31) tool/codegen/lavfi_codegen/parse.py:580 — parse._parse_flag_bits has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (5 pts), boolean chains 4 (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. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · generate._emit_bound_asserts (cognitive 30) · ×1
  • generate._emit_bound_asserts (cognitive 30) tool/codegen/lavfi_codegen/generate.py:986 — generate._emit_bound_asserts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), error handling 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _QueueModule.replace (cognitive 29) · ×1
  • _QueueModule.replace (cognitive 29) lib/src/player/mixins/player_queue.part.dart:144 — _QueueModule.replace has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (26 pts), ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parse.find_filter_options_pairs (cognitive 28) · ×1
  • parse.find_filter_options_pairs (cognitive 28) tool/codegen/lavfi_codegen/parse.py:906 — parse.find_filter_options_pairs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 9 (13 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · generate_studio_catalog._param_spec (cognitive 27) · ×1
  • generate_studio_catalog._param_spec (cognitive 27) tool/codegen/lavfi_codegen/generate_studio_catalog.py:164 — generate_studio_catalog._param_spec has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generate.run (cognitive 26) · ×1
  • generate.run (cognitive 26) tool/codegen/lavfi_codegen/generate.py:1522 — generate.run has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 4 (9 pts), error handling 3 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _PcmCutModule._cutPcm (cognitive 24) · ×1
  • _PcmCutModule._cutPcm (cognitive 24) lib/src/player/mixins/player_pcm_cut.part.dart:27 — _PcmCutModule._cutPcm has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _RawModule.sendRawCommand (cognitive 22) · ×1
  • _RawModule.sendRawCommand (cognitive 22) lib/src/player/mixins/player_raw.part.dart:167 — _RawModule.sendRawCommand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), boolean chains 3, ternaries 1 (2 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 · _SourceResolverDriver.run (cognitive 22) · ×1
  • _SourceResolverDriver.run (cognitive 22) lib/src/player/source_resolver_driver.part.dart:50 — _SourceResolverDriver.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BandProcessor.process (cognitive 21) · ×1
  • BandProcessor.process (cognitive 21) lib/src/dsp/band_processor.dart:149 — BandProcessor.process has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 3, ternaries 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 · _OpenAllRun.run (cognitive 21) · ×1
  • _OpenAllRun.run (cognitive 21) lib/src/player/mixins/player_open_all.part.dart:26 — _OpenAllRun.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _PlaybackModule.play (cognitive 20) · ×1
  • _PlaybackModule.play (cognitive 20) lib/src/player/mixins/player_playback.part.dart:9 — _PlaybackModule.play has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MediaSessionManager.onMethodCall (cognitive 20) · ×1
  • MediaSessionManager.onMethodCall (cognitive 20) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionManager.kt:225 — MediaSessionManager.onMethodCall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parse._resolve_symbol (cognitive 20) · ×1
  • parse._resolve_symbol (cognitive 20) tool/codegen/lavfi_codegen/parse.py:339 — parse._resolve_symbol has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · parse.run (cognitive 20) · ×1
  • parse.run (cognitive 20) tool/codegen/lavfi_codegen/parse.py:1298 — parse.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 3 (6 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · BandProcessor._newFramesNear (cognitive 19) · ×1
  • BandProcessor._newFramesNear (cognitive 19) lib/src/dsp/band_processor.dart:281 — BandProcessor._newFramesNear has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventSequencer._pumpLoop (cognitive 19) · ×1
  • EventSequencer._pumpLoop (cognitive 19) lib/src/internals/event_sequencer.dart:87 — EventSequencer._pumpLoop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 1 (2 pts), boolean chains 1, 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 · system.timeline (cognitive 19) · ×1
  • system.timeline (cognitive 19) tool/diagrams/system.py:281 — system.timeline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (5 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 · BandProcessor._runFftOnRing (cognitive 18) · ×1
  • BandProcessor._runFftOnRing (cognitive 18) lib/src/dsp/band_processor.dart:332 — BandProcessor._runFftOnRing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _OpenModule._replaceContent (cognitive 18) · ×1
  • _OpenModule._replaceContent (cognitive 18) lib/src/player/mixins/player_open.part.dart:41 — _OpenModule._replaceContent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FileDescriptorChannel.onMethodCall (cognitive 18) · ×1
  • FileDescriptorChannel.onMethodCall (cognitive 18) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/FileDescriptorChannel.kt:43 — FileDescriptorChannel.onMethodCall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (6 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · MediaSessionMappers.buildMediaButtonPreferences (cognitive 18) · ×1
  • MediaSessionMappers.buildMediaButtonPreferences (cognitive 18) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MediaSessionMappers.kt:108 — MediaSessionMappers.buildMediaButtonPreferences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts), 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 · generate._emit_wire_parts (cognitive 18) · ×1
  • generate._emit_wire_parts (cognitive 18) tool/codegen/lavfi_codegen/generate.py:1049 — generate._emit_wire_parts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), 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 · _EndOfContent.send (cognitive 17) · ×1
  • _EndOfContent.send (cognitive 17) lib/src/internals/event_end_of_content.dart:40 — _EndOfContent.send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5 (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 · OrphanHandleTracker.ensureInitialized (cognitive 17) · ×1
  • OrphanHandleTracker.ensureInitialized (cognitive 17) lib/src/internals/orphan_handle_tracker.dart:114 — OrphanHandleTracker.ensureInitialized has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 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 · _OpenAllRun._append (cognitive 17) · ×1
  • _OpenAllRun._append (cognitive 17) lib/src/player/mixins/player_open_all.part.dart:265 — _OpenAllRun._append has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generate._emit_runtime_diff (cognitive 17) · ×1
  • generate._emit_runtime_diff (cognitive 17) tool/codegen/lavfi_codegen/generate.py:1205 — generate._emit_runtime_diff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EntryTable.onPlaylist (cognitive 16) · ×1
  • EntryTable.onPlaylist (cognitive 16) lib/src/internals/entry_table.dart:164 — EntryTable.onPlaylist has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EntryTable._confirm (cognitive 16) · ×1
  • EntryTable._confirm (cognitive 16) lib/src/internals/entry_table.dart:332 — EntryTable._confirm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 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 · EventLogic.property (cognitive 16) · ×1
  • EventLogic.property (cognitive 16) lib/src/internals/event_logic.dart:135 — EventLogic.property has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MediaSessionController._downloadedArtwork (cognitive 16) · ×1
  • MediaSessionController._downloadedArtwork (cognitive 16) lib/src/media_session/media_session_controller.dart:393 — MediaSessionController._downloadedArtwork has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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 · PcmSource.addStream (cognitive 16) · ×1
  • PcmSource.addStream (cognitive 16) lib/src/pcm/pcm_source.dart:274 — PcmSource.addStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · _MediaSessionModule.setMediaSession (cognitive 16) · ×1
  • _MediaSessionModule.setMediaSession (cognitive 16) lib/src/player/mixins/player_media_session.part.dart:50 — _MediaSessionModule.setMediaSession has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 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 · MpvControllerPlayer.getState (cognitive 16) · ×1
  • MpvControllerPlayer.getState (cognitive 16) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/media_session/MpvControllerPlayer.kt:55 — MpvControllerPlayer.getState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, 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 · generate._emit_param_constants (cognitive 16) · ×1
  • generate._emit_param_constants (cognitive 16) tool/codegen/lavfi_codegen/generate.py:685 — generate._emit_param_constants has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generate_studio_catalog.run (cognitive 16) · ×1
  • generate_studio_catalog.run (cognitive 16) tool/codegen/lavfi_codegen/generate_studio_catalog.py:420 — generate_studio_catalog.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), 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 · parse._index_enum_members (cognitive 16) · ×1
  • parse._index_enum_members (cognitive 16) tool/codegen/lavfi_codegen/parse.py:416 — parse._index_enum_members has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 1 (4 pts), loops 2 (3 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. This file is where this pass's cognitive complexity CONCENTRATES: tool/codegen/lavfi_codegen/parse.py holds 8 of the 50 methods over the threshold — including the worst — and 190 of the 469 points over it (41%), 3.1× the next-largest file (tool/codegen/lavfi_codegen/generate.py at 61). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) tool/diagrams/system.py:200 — tool/diagrams/system.py:200-212 | tool/diagrams/system.py:229-239 — 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 copies of one member (3 members, 15+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 15+ corresponding lines) lib/src/internals/native_reader.dart:52 — lib/src/internals/native_reader.dart:52-66 | lib/src/internals/native_reader.dart:68-82 | lib/src/internals/native_reader.dart:84-98 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) lib/src/player/mixins/player_properties.part.dart:191 — lib/src/player/mixins/player_properties.part.dart:191-202 | lib/src/player/mixins/player_properties.part.dart:204-216 — 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 · Edited copy of a member (2 corresponding lines) · ×1
  • Edited copy of a member (2 corresponding lines) tool/codegen/lavfi_codegen/generate.py:103 — tool/codegen/lavfi_codegen/generate.py:103-104 | tool/codegen/lavfi_codegen/parse.py:1188-1189 — These two members are one piece of code written twice and then edited apart: 2 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 (104 lines × 2) · ×1
  • Duplicated block (104 lines × 2) lib/src/ffi/mpv_library_bundled.dart:31 — lib/src/ffi/mpv_library_bundled.dart:31-134 | lib/src/ffi/mpv_library_opened.dart:185-288 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/ArtworkChannel.kt:33 — android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/ArtworkChannel.kt:33-37 | android/src/main/kotlin/com/alesdrnz/mpv_audio_kit/FileDescriptorChannel.kt:32-36 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) tool/diagrams/system.py:200 — tool/diagrams/system.py:200-204 | tool/diagrams/system.py:216-220 | tool/diagrams/system.py:229-233 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (138 lines × 2) · ×1
  • Duplicated block (138 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824-961 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:824-961 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (126 lines × 2) · ×1
  • Duplicated block (126 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548-673 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:548-673 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (88 lines × 2) · ×1
  • Duplicated block (88 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162-249 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:162-249 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (54 lines × 2) · ×1
  • Duplicated block (54 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425-478 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:425-478 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (39 lines × 2) · ×1
  • Duplicated block (39 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1008 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1008-1046 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1008-1046 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:700 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:700-727 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:700-727 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (34 lines × 2) · ×1
  • Duplicated block (34 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1088 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1088-1121 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1088-1121 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:986 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:986-1006 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:986-1006 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×1
  • Duplicated block (20 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:511 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:511-530 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:511-530 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1
  • Duplicated block (15 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:403 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:403-417 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:403-417 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1077 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1077-1084 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:1077-1084 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:251 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:251-256 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:251-256 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×1
  • Duplicated block (13 lines × 2) darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:383 — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:383-395 | tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift:383-395 — before extracting anything, compare `darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift` and `tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift` as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 893 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
P12 · CI test-gate honesty · Coverage collected but not gated · ×1
  • Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×1
  • Recursive walk over a caller-supplied document has no depth cap lib/src/internals/native_memory.dart:125 — `materializeBytes` is public and takes `Object ? value` from its caller, and it calls itself at line 125 (`materializeBytes`) with a piece of `value` (and at line 130) — and nowhere in `materializeBytes` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `materializeBytes` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Minor — 11 finding(s)
AX6 · Interface segregation · Fat interface · ×2
  • Fat interface: MpvLibrary (20 abstract methods) lib/src/ffi/mpv_library.dart:18 — `MpvLibrary` declares 20 abstract methods: `mpvCreate`, `mpvInitialize`, `mpvTerminateDestroy`, `mpvWakeup`, `mpvSetOptionString`, `mpvSetPropertyString`, `mpvGetPropertyString`, `mpvGetProperty`, `mpvSetPropertyAsync`, `mpvGetPropertyAsync`, `mpvCommandAsync`, `mpvCommandString`, `mpvWaitEvent`, `mpvObserveProperty`, `mpvFree`, `mpvFreeNodeContents`, `mpvErrorString`, `mpvRequestLogMessages`, `mpvHookAdd`, `mpvHookContinue`. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it 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: PlayerApi (88 abstract methods) lib/src/player/player_api.dart:31 — `PlayerApi` declares 88 abstract methods: `configuration`, `state`, `stream`, `dispose`, `open`, `openAll`, `openPlaylistFile`, `openPcmStream`, `play`, `pause`, `stop`, `seek`, `seekToPercent`, `revertSeek`, `setChapter`, `setChapters`, `setAbLoopA`, `setAbLoopB`, `setAbLoopCount`, `writeResumeConfig`, `deleteResumeConfig`, `add`, `remove`, `next`, `previous`, `nextPlaylist`, `previousPlaylist`, `jump`, `move`, `replace`, `insert`, `clearPlaylist`, `setLoop`, `setShuffle`, `setPrefetchPlaylist`, `setVolume`, `setRate`, `setPitch`, `setMute`, `setAudioDevice`, and 48 more. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it 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.
X10 · Duplicated predicate · Duplicated predicate · ×2
  • Duplicated predicate darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:576 — `!seekable && (durationMs == nil || durationMs! <= 0)` appears character-identically in 2 files — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift, tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift. 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 darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift:688 — `rate == 0.0 && lastPublishedPlaybackState == .paused` appears character-identically in 2 files — darwin/mpv_audio_kit/Sources/mpv_audio_kit/MediaSessionPlugin.swift, tvos/Sources/mpv_audio_kit/MediaSessionPlugin.swift. 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.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion pubspec.yaml:1 — `(repository root)` (34921 LoC, 407 module-visible types across 22 directories) overshoots its size bounds. 1 of 7 build unit(s) (Gradle, SwiftPM, pub) overshoot their size bounds, lowering Project Cohesion to 7.1/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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
P10 · Library API & versioning · Implementation type on the public API · ×1
  • Implementation type on the public API lib/src/internals/core_calls.dart:51 — 57 public types in `repository.src` are marked as implementation by their own namespace, folder or name: `CoreCalls` (lib/src/internals/core_calls.dart:51, `internals`), `MpvIsolateEvent` (lib/src/internals/core_events.dart:12, `internals`), `MpvPropertyEvent` (lib/src/internals/core_events.dart:17, `internals`), `MpvReplyEvent` (lib/src/internals/core_events.dart:20, `internals`), `MpvEventStartFile` (lib/src/internals/core_events.dart:23, `internals`), `MpvEventFileLoaded` (lib/src/internals/core_events.dart:33, `internals`), `MpvEventPlaybackRestart` (lib/src/internals/core_events.dart:113, `internals`), `MpvEventEndFile` (lib/src/internals/core_events.dart:129, `internals`), and 49 more. While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST .github/workflows/ci.yml:6 — No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 6 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 android/build.gradle.kts:74 — `android/build.gradle.kts` 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`.

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-b469fefa73fd4fcd94ea854e5254b382/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-b469fefa73fd4fcd94ea854e5254b382/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=288" --report-format json --report-path /tmp/watchdog-gitleaks-b469fefa73fd4fcd94ea854e5254b382/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.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-b469fefa73fd4fcd94ea854e5254b382/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 lib/src/generated --exclude test/generated --exclude tool/codegen/tests/golden .4artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.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 1 file(s) — `android/settings.gradle.kts` — 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 Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1e8e7-a38f-7367-a810-9c0dd46fb5a9 · 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