Public report of StopBanning/toaster, 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, 13:28 UTC · Survey ID cd_8ab01364a01a43498a21117a431390e6

StopBanning/toaster

Measured 17 November 2026, 13:27 UTC, at code version 1a5a0e5

First survey, so nothing to compare with yet
CAI score 40.4out of 100 Weak
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: 59,234 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Production Readiness, 30.5

Findings by how serious they are

17 critical 1036 serious 58 minor

9 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, 13:27 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 ▸

70of 70 dimensions measured by tools.
1096of 1111 findings point to an exact file and line, so you can open each one in the code. The other 15 concern the repository as a whole, such as missing documentation.
70dimensions across 7 lenses, read from 59,234 lines of product code in 1 project.
Chapters

Executive summary

StopBanning/toaster falls short of our standard for a preview release because 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 40.4 out of 100 and is rated Weak, and 15 of its 17 critical findings are security problems.

Production Readiness, at 30.5, is the weakest lens and counts most in the score. The best first step for the work it takes is replacing each deprecated dependency, worth about 2.5 points. Adopting a logging library would lift Production Readiness itself, worth about 4.9 points. Raising Production Readiness to 62 would lift the score to about 48.6.

Seven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Three places in the code run text as code, which an attacker could use, and two known security holes in the packages the code depends on can be used by attackers. Pinning each tool to an exact version, replacing text run as code with direct calls and updating the vulnerable packages would close these risks. Fixing the weaknesses the scanner points to would fix the two security weaknesses in the code, and correcting the flagged pipeline settings would deal with the weakness in the build pipeline's configuration. The two form fields without a label need a label.

The product code is 59,234 lines, about €64,000 to rebuild.

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

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

If Production Readiness rose from 30.5 to 62, the lowest score rated Strong, the score would rise from 40.4 to about 48.6.

Code composition: what the lines of code are
Product code 78%Tests 22%
Rebuild cost: about €64,000 · Estimate
Cost to rebuild€21,000 to €110,000, for 356 to 1,128 hours of work, about 0.4 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 40. 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: 59,234 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 1 Deprecated finding(s) in Dependency Hygiene — start with REDACTED.
Raises the score by about 2.5 points · Low effort · Dependency Hygiene
2
Adopt pino (or winston) and log at meaningful points in the services you run.
Raises the score by about 4.9 points · Medium effort · Observability
3
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Raises the score by about 4.9 points · Medium effort · Security & performance tooling

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 €64,000 to build again, about 0.4 person-years of work. Its weakest lens is Production Readiness, at 30.5 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Deprecated finding(s) in Dependency Hygiene. Of all the actions in this report, it raises the score most for the work it takes: about 2.5 points for low effort, because it clears the 1 Dependency Hygiene findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.9 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 5% to 12% on every change. The history of the code shows how much it changes: about 84,155 lines over the last 90 days, which is about 341,295 lines a year. At that pace, the extra work comes to an estimated 44 to 263.7 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.

At a glance — Code Health · 41.0 · Weak · gated by D1, D2, R1, R3 ·

At a glance — Architecture · 97.6 · Exemplary ·

At a glance — Maturity · 56.5 · Adequate · gated by D15, M2 ·

At a glance — Readiness · 30.5 · Weak · gated by R6, P2, P3, P7 ·

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

At a glance — Accessibility · 49.0 · Adequate · gated by AC1, AC6 ·

At a glance — Performance · 60.0 · Adequate ·

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

Roadmap

Top priorities: Adopt pino (or winston) and log at meaningful points in the services you run; Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing; Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.

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

Do thisHelpsEffortDimension
Resolve the 1 Deprecated finding(s) in Dependency Hygiene — start with REDACTED.+2.5 ptsLowDependency Hygiene
Adopt pino (or winston) and log at meaningful points in the services you run.+4.9 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.+4.9 ptsMediumSecurity & performance tooling
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.+3.0 ptsMediumType Safety
Bound every outbound call: pass `signal: AbortSignal.timeout(ms)` to `fetch`, set `timeout` on the axios instance (`axios.create({ timeout })`), and add retries with back-off (`axios-retry`, `p-retry`) and a breaker (`opossum`, `cockatiel`) around dependencies that fail.+2.4 ptsMediumOutbound HTTP resilience
Bring the 162 bodies over 30 down to 30 or less in Cognitive Complexity — start with engine.createEngine (cognitive 1354), createScenery.draw (cognitive 280), createEngine::newBar (cognitive 259).+2.1 ptsHighCognitive Complexity
Add eslint and type checking (adopt TypeScript, or type-check the existing JavaScript with `checkJs`) as REDACTED scripts and run them in CI.+2.1 ptsMediumTooling
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with REDACTED.+1.0 ptsLowADR Quality

File quality

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

FileScoreBandWorst signal
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.1MixedDependency Vulnerabilities: High CVE: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.2MixedDependency Vulnerabilities: High CVE: REDACTED
renderer/scenery.js6.3MixedCyclomatic Complexity: createScenery.draw (cyclomatic 229)
REDACTED6.9MixedStatic Analysis (SAST): Medium: REDACTED
renderer/engine.js7.0Near-cleanCyclomatic Complexity: engine.createEngine (cyclomatic 1228)
renderer/portal.js7.0Near-cleanCyclomatic Complexity: createPortal.draw (cyclomatic 147)
renderer/worlds.js7.0Near-cleanCyclomatic Complexity: worlds.createWorlds (cyclomatic 110)
renderer/noodles.js7.0Near-cleanCyclomatic Complexity: Dancer.dance (cyclomatic 86)
renderer/app.js7.0Near-cleanCyclomatic Complexity: app.drawFrame (cyclomatic 73)
renderer/library-panel.js7.0Near-cleanCyclomatic Complexity: library-panel.createLibraryPanel.onKey (cyclomatic 61)
renderer/visuals.js7.0Near-cleanCyclomatic Complexity: visuals.createField.draw (cyclomatic 60)
helpers/spotify.cjs7.0Near-cleanCyclomatic Complexity: createWebApi.list (cyclomatic 60)
renderer/codegen.js7.0Near-cleanCyclomatic Complexity: codegen.riffNotes (cyclomatic 51)
renderer/player.js7.0Near-cleanCyclomatic Complexity: player.createPlayerBar.update (cyclomatic 51)
renderer/game.js7.0Near-cleanCyclomatic Complexity: game.createGame.draw (cyclomatic 47)
renderer/tape.js7.0Near-cleanCyclomatic Complexity: tape.createTape (cyclomatic 47)
renderer/orb.js7.0Near-cleanCyclomatic Complexity: createOrb (cyclomatic 44)

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

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

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

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

Could not be resolved — 9

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 70 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 — 70 dimensions across the health lenses
D1D2D3D4D6D10D12D13D14D15D17D19D20D24D27D28D29D30D34D35D36D43D44AC1AC2AC3AC4AC5AC6AX10AX3AX4AX9GD1IC1M1M2M3M4P1P2P3P4P6P7PF3R1R10R11R2R3R4R5R6R7R8R9S1X1X12X13X16X2X21X24X25X28X29X3X30

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, 1096 of 1111 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 01a1e9b0-9937-732c-b9df-3e686c1f224d.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py, .mjs). The coverage collector drives the JavaScript/TypeScript half of this repository's ecosystem, but no collector of ours measures its .py test suite(s), so no coverage figure covers the repository. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
  • D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 1,001 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 1 test source file(s) (.py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • 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 (.py, .mjs) and the reliability runner does support this ecosystem — it drives jest, vitest, mocha and egg-bin — but no REDACTED in this repository has a `scripts.test`, and none declares a runner the analyzer could start on its own, so it could not tell how this suite is run. Not scored — this is a gap in the analyzer's reading of how the suite is run, not a missing .py/.mjs runner and not a verdict that this repository runs no tests.
  • 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 (3 contributor(s) across 67 commit(s) sampled, automation and bot accounts excluded). One of them holds 93% of the history; the other 2 hold 3.5% 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.
  • D21 Naming 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published REDACTED's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D26 Project Cohesion — 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. `(repository root)` (57650 LoC, 216 module-visible types across 9 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
  • AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The dev server could not reach the network from our sandbox (a registry or API request was refused). This is a limit of our sandbox, not of your repository. (rule: network). The renderer reported: the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): the dev server could not reach the network from our sandbox (a registry or API request was refused). This is a limit of our sandbox, not of your repository. Last output: "at Object.<anonymous> (<repo>/node_modules/electron/index.js:52:18) / at Module._compile (node:internal/modules/cjs/loader:1562:14) / at Object..js (node:internal/modules/cjs/loader:1699:10) / at Module.load (node:internal/modules/cjs/loader:1313:32) / at Function._load (node:internal/modules/cjs/loader:1123:12) / at TracingChannel.traceSync (node:diagnostics_channel:322:14) / at wrapModuleLoad (node:internal/modules/cjs/loader:217:24) / at Module.require (node:internal/modules/cjs/loader:1335:12) / at require (node:internal/modules/helpers:136:16) / Node.js v22.13.0" No runtime evidence was gathered.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (dev). the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): the dev server could not reach the network from our sandbox (a registry or API request was refused). This is a limit of our sandbox, not of your repository. Last output: "at Object.<anonymous> (<repo>/node_modules/electron/index.js:52:18) / at Module._compile (node:internal/modules/cjs/loader:1562:14) / at Object..js (node:internal/modules/cjs/loader:1699:10) / at Module.load (node:internal/modules/cjs/loader:1313:32) / at Function._load (node:internal/modules/cjs/loader:1123:12) / at TracingChannel.traceSync (node:diagnostics_channel:322:14) / at wrapModuleLoad (node:internal/modules/cjs/loader:217:24) / at Module.require (node:internal/modules/cjs/loader:1335:12) / at require (node:internal/modules/helpers:136:16) / Node.js v22.13.0" No runtime evidence was gathered.
  • M3 Folder & project structure — 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. Whether the tests sit apart from production code is not visible here, because the suite is not in a form this pass reads. The test-separation credit is granted rather than withheld: this is a gap in the analyzer's language coverage, not a finding about the repository's tests. You can widen what we reach: keep the test surface somewhere a reader can find it without opening a binary — an exported/checked-in test source tree beside the production code makes the suite reviewable, diffable and discoverable by tooling.
  • 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.
  • R10 Code Duplication — 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. 62 further occurrence(s) are not listed individually; the score already reflects all 102.
  • R2 Cyclomatic Complexity — 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. 317 further occurrence(s) are not listed individually; the score already reflects all 357.
  • X26 Unsynchronised callback handoff — 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.
  • X3 Exception handling — 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. 56 further occurrence(s) are not listed individually; the score already reflects all 96.
  • X5 Nullable reference types — 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 MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's Swift is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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.
  • 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.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 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.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • 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.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity2.0 / 10Critical✓ 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 2.0 / 10 · rule-coverage 100% · ceiling Prevented

418 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was engine.createEngine at 1228. A further 3 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being tracking.createTracker.open at 17 — they are counted neither in the figure above nor in this dimension's score.

createEngine::newBar (cyclomatic 130) · ×23renderer/engine.js:1917
createWorlds::draw (cyclomatic 87) · ×3renderer/worlds.js:1716
engine.createEngine (cyclomatic 1228)renderer/engine.js:546
createScenery.draw (cyclomatic 229)renderer/scenery.js:6912
scenery.createScenery.draw (cyclomatic 219)renderer/scenery.js:6912

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

What to do

  1. Bring the 24 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with engine.createEngine (cyclomatic 1228), createScenery.draw (cyclomatic 229), scenery.createScenery.draw (cyclomatic 219). — 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 24 together lifts Cyclomatic Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ 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 2.0 / 10 · rule-coverage 100% · ceiling Prevented

492 method(s) exceeded the cognitive complexity threshold of 15; the worst was engine.createEngine at 1354.

createEngine::newBar (cognitive 259) · ×26renderer/engine.js:1917
createWorlds::draw (cognitive 108) · ×4renderer/worlds.js:1716
engine.createEngine (cognitive 1354)renderer/engine.js:546
createScenery.draw (cognitive 280)renderer/scenery.js:6912
scenery.createScenery.draw (cognitive 252)renderer/scenery.js:6912

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

What to do

  1. Bring the 162 bodies over 30 down to 30 or less in Cognitive Complexity — start with engine.createEngine (cognitive 1354), createScenery.draw (cognitive 280), createEngine::newBar (cognitive 259). — 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 162 together lifts Cognitive Complexity from 2.0 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

D3 · God Classes7.4 / 10Strong✓ Tool-verified

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

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

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

34 over-large unit(s) detected — types, modules or files that carry too much.

FunctionTooLong: engine.createEngine · ×19renderer/engine.js:546
FileTooLong: renderer/app.js · ×14renderer/app.js
MethodTooLong: Dancer.dancerenderer/noodles.js:750

What to do

  1. Resolve the 19 FunctionTooLong finding(s) in God Classes — start with game.js (2), engine.js, worlds.js. — One of this dimension's main actionable groups (19 warning-level).
  2. Resolve the 14 FileTooLong finding(s) in God Classes — start with app.js, engine.js, worlds.js. — One of this dimension's main actionable groups (14 warning-level).
  3. Resolve the 1 MethodTooLong finding(s) in God Classes — start with noodles.js. — One of this dimension's main actionable groups (1 warning-level).

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

D4 · Code Duplication9.8 / 10Stronggated by 28 serious findings✓ Tool-verified

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

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

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

9 duplicated block group(s) detected. 0.6 % of the production lines (358 of 59,234) are in a reported copy. A further 19 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 27 of the 28 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population. Measured on part of this repository only: .js (71% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.

Edited copy of a member (16 corresponding lines) · ×2helpers/mac/faces.swift:85
Edited copy of a member (9 corresponding lines) · ×2tools/handheld/clear.py:136
Edited copy of a member (3 corresponding lines) · ×2tools/handheld/clear.py:527
Edited copies of one member (3 members, 3+ corresponding lines) · ×2tools/handheld/concepts/cart.py:113
Duplicated block (6 lines × 3) · ×2tools/handheld/clear.py:108

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

What to do

  1. Resolve the 2 Edited copy of a member (16 corresponding lines) finding(s) in Code Duplication — start with faces.swift, clear.py. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 2 Edited copy of a member (9 corresponding lines) finding(s) in Code Duplication — start with clear.py, cc.py. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 Edited copy of a member (3 corresponding lines) finding(s) in Code Duplication — start with clear.py, metal.py. — 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.

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

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

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

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

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

0 of 8 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

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

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

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

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

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

Skipped (documented): (unnamed test) · ×3tools/spaghetti-sim.test.mjs:39

✓ On the Gold path — maintain.

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

D12 · Dependency Hygiene9.5 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

1 outdated direct production npm dependency(ies) of 3 graded, 0 pinning defect(s), across 1 REDACTED (1 of them the product) and 1 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 1 direct dependency(ies) — production, development or optional — are marked DEPRECATED by their publisher (the registry's per-version mark, or the lockfile's copy of it when the registry could not be asked); deprecated transitive packages are listed but not charged. Whether any is UNMAINTAINED is not graded — the registry publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, and the frontend dependency lens (R8) answers it in this same run. Known CVEs in this dependency graph are D30's question, read from the manifest there.

Deprecated: mp4-muxerREDACTED:23
Outdated (npm): @mediapipe/tasks-vision

What to do

  1. Resolve the 1 Deprecated finding(s) in Dependency Hygiene — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

Maturity: 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 22 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 22 package(s) this repository's committed lockfile installs for a consumer — its 3 production, optional and peer dependency(ies), across 1 product REDACTED manifest(s), and everything those install in turn. Its 2 `devDependencies` declaration(s), and every package only they reach, are excluded: a consumer installs none of them. ★ Each licence is the one the registry publishes for the package's CURRENT release rather than for the pinned version, which is the same caveat the Hex and RubyGems arms carry. Third-party code that ships WITHOUT a manifest entry was read too: 1 component(s) whose licence travels in the tree (vendored or copied-in directories, licence comments preserved in committed bundles, compiled wasm modules) and 0 bundled package(s) named only by a bundle's module path, graded on the registry; 0 use a banned licence. This repository publishes itself under MIT, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots3.1 / 10Weak✓ 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 3.1 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: renderer/engine.js (20×1228=24560); renderer/app.js (43×73=3139); main.js (24×112=2688)

Hotspot: renderer/engine.js · ×27renderer/engine.js:546

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

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

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

No architecture decision records were found.

No ADRs foundREDACTED:11

What to do

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

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

D24 · Comment Value9.9 9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

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

6 of 4162 judged comments only repeat the code they sit on (0.1 %). 48 comment(s) in another language or script were not judged.

redundant comment · ×6renderer/scenery.js:1189

✓ On the Gold path — maintain.

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

D27 · Navigability10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)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)2.6 / 10Weak✓ 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 2.6 / 10 · rule-coverage 100% · ceiling Documented

21 finding(s): 0 critical, 13 high, 5 medium, 3 low. 7 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 12 file(s) — `main.js`, `renderer/app.js`, `renderer/engine.js`, `renderer/gameskins.js`, `renderer/library-panel.js`, … (+7 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 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
REDACTED

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

What to do

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

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

D30 · Dependency Vulnerabilities8.4 / 10Adequategated by 2 critical findings✓ Tool-verified

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

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

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

REDACTED
REDACTED

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change Coupling9.9 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

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

Strongest change-coupling: news.js↔scenery.js 100%

Change coupling: news.js ↔ scenery.jsrenderer/news.js:1

What to do

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

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

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

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives3.9 / 10Weak✓ Tool-verified

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

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

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

  • A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×20) — renderer/card.js:34, renderer/fx.js:63, renderer/fx.js:81, …

What to do

  • Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
AC2 · Forms & labels7.1 / 10Strong✓ Tool-verified

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

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

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

  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×2) — renderer/index.html:179, renderer/index.html:180

What to do

  • Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
AC3 · Page structure6.6 / 10Strong✓ Tool-verified

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

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

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

  • A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). (×5) — prototype/now-coding.html:211, prototype/studio.html:165, prototype/studio.html:177, …

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
AC4 · Keyboard semantics10.0 / 10Exemplary○ Nothing flagged

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

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

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

AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

AC6 · Visual & motion safety1.0 / 10Critical✓ Tool-verified

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

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

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

  • `body.glitch #code` moves (`animation: glitch .34s steps(2) 1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — prototype/now-coding.html:62, renderer/style.css:290
  • `#bsod` sets color: #fff on background-color: #0078d7 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×2) — prototype/now-coding.html:107, renderer/style.css:843
  • `#toast` moves (`transition: opacity .25s, transform .25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — prototype/studio.html:74
  • `#stage .cm-editor.cm-focused` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — prototype/studio.html:39
  • `.xp` sets color: #000 on background-color: #0831d9 — 2.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — renderer/style.css:706
  • `.y2k-shatter .bsod-shard` sets color: #fff on background-color: #0078d7 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — renderer/style.css:848
  • `.xp button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — renderer/style.css:742
  • `#library .lib-q` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — renderer/style.css:1065
  • `#library .lib-list` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — renderer/style.css:1102
  • `#library .lib-address` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — renderer/style.css:1124
  • `#library .lib-cover.real` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — renderer/style.css:1167
  • `#library .lib-cover.lib-spot` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — renderer/style.css:1170
  • `#tube .t-roll` moves (`animation: tube-roll 7.3s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:97
  • `#tube.static .t-static` moves (`animation: tube-static .34s ease-out 1, tube-snow .06s steps(1) 6`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:105
  • `#tube.power-on .t-power` moves (`animation: tube-power-on .62s ease-out forwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:130
  • `#tube.power-off .t-power` moves (`animation: tube-power-off .5s ease-in forwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:131
  • `body.tube-on.jolt > :not(#tube):not(dialog)` moves (`animation: tube-jolt .36s steps(1) 1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:150
  • `header > #b-star` moves (`transition: opacity .5s var(--ease-fade), transform .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:431
  • `#desk-front .balloon` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:696
  • `.xp` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:709
  • `.crt` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:816
  • `.mini-bsod` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/style.css:832
  • `s.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/stars.js:82
  • `star.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — renderer/stars.js:87

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

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

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

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 JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX 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 JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, 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)6.7 / 10Strong✓ Tool-verified

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

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

What to do

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

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

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

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure8.0 / 10Strong✓ 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.

  • Most of the production code is in directories of its own, but 3 application file(s) sit at the repository root beside the build and tooling files (`main.js`, `preload.js`, `update.js`).
M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

P2 · 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 call was found in the 123 JavaScript/TypeScript, Swift production file(s) this check read across 2 module(s). Each was searched for its ecosystem's logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Swift: os.Logger/os_log/NSLog, swift-log, CocoaLumberjack, SwiftyBeaver, XCGLogger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.

What to do

  • Adopt pino (or winston) and log at meaningful points in the services you run.
  • Add a health-check endpoint (@godaddy/terminus or a /health route) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
  • `REDACTED` 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`. — REDACTED:17

What to do

  • Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

  • The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

What to do

  • Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

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

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

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

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
P7 · Outbound HTTP resilience3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.

Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.

  • `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — helpers/spotify.cjs:100

What to do

  • Bound every outbound call: pass `signal: AbortSignal.timeout(ms)` to `fetch`, set `timeout` on the axios instance (`axios.create({ timeout })`), and add retries with back-off (`axios-retry`, `p-retry`) and a breaker (`opossum`, `cockatiel`) around dependencies that fail.
PF3 · Async & latency hygiene6.0 / 10Adequate✓ 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.

  • `fs.openSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — helpers/take-render.cjs:101
  • `fs.writeSync` in `listen("take:write")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — helpers/take-render.cjs:109
  • `fs.fsyncSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — helpers/take-render.cjs:182
  • `fs.closeSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — helpers/take-render.cjs:182, helpers/take-render.cjs:195
  • `fs.renameSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — helpers/take-render.cjs:183
  • `fs.rmSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — helpers/take-render.cjs:196
  • `fs.existsSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — helpers/take-render.cjs:199
  • `execFileSync` in `callback to createServer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:30
  • `fs.writeFileSync` in `shot` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — REDACTED:104, tools/player-bar-check.mjs:61
  • `fs.readdirSync` in `fixtureCovers` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:192
  • `spawnSync` in `spotifyReady` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — REDACTED:204, REDACTED:205
  • `fs.existsSync` in `step("spotify, your own library: the guide (four steps) and the field for a Client ID; a bad ID in words; the sign-in (PKCE) against the fake; the lists with their covers; the page never has a token")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:769
  • `fs.readFileSync` in `step("spotify, your own library: the guide (four steps) and the field for a Client ID; a bad ID in words; the sign-in (PKCE) against the fake; the lists with their covers; the page never has a token")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:769
  • `fs.existsSync` in `step("spotify, what goes wrong is said as main says it: no Premium, no open player, a slow-down, a token that lapsed early (one fresh try), a connection that is gone (the field comes back, and signing in again works)")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:891
  • `fs.existsSync` in `step("spotify, a list that goes on: a "more" row after the first 50, Enter on it adds the rest; disconnecting asks twice, and forgets")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — REDACTED:956, REDACTED:960
  • `fs.realpathSync` in `step("main refuses what is not an audio file inside the folder, whatever the page asks")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:1169
  • `fs.existsSync` in `step("spotify after a restart: the pasted links are back, named; main kept the sign-in (no new one is asked for) and the lists load, through a refresh of the kept token")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:1438

What to do

  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety0.0 / 10Critical✓ Tool-verified

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

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

  • 0 typed · 323 plain JS — the untyped files are helpers/issue-url.cjs, helpers/library-worker.cjs, helpers/library.cjs, helpers/mac-update.cjs, helpers/player.cjs, helpers/radio.cjs (+317 more).

What to do

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

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

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

  • 6 of the duplicated blocks reported below have copies in at least two of the sibling directories helpers, renderer, tools under the repository root. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — renderer/take-replay.js:27
  • renderer/backrooms.js:80 · renderer/earth.js:89 — the two spans are one implementation copied and then locally edited — 1322 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/backrooms.js:80
  • renderer/dotcam.js:153 · renderer/voxcam.js:144 — the two spans are one implementation copied and then locally edited — 442 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/dotcam.js:153
  • renderer/take-replay.js:27 · tools/clock-harness-page.js:77 — the two spans are one implementation copied and then locally edited — 392 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/take-replay.js:27
  • renderer/scenery.js:6712 · renderer/wait.js:19 — the two spans are one implementation copied and then locally edited — 309 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/scenery.js:6712
  • renderer/audio-tags.js:190 · renderer/embedded-cover.js:78 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/audio-tags.js:190
  • renderer/portal.js:606 · renderer/portal.js:656 — the two spans are one implementation copied and then locally edited — 214 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/portal.js:606
  • renderer/melody.js:83 · renderer/melody.js:106 — the two spans are one implementation copied and then locally edited — 282 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/melody.js:83
  • tools/clock-harness-page.js:15 · tools/take-replay-check.cjs:20 — the two spans are one implementation copied and then locally edited — 859 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — tools/clock-harness-page.js:15
  • REDACTED:71 · tools/player-bar-check.mjs:32 — the two spans are one implementation copied and then locally edited — 323 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:71
  • main.js:376 · main.js:414 — the two spans are one implementation copied and then locally edited — 92 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — main.js:376
  • renderer/lens.js:349 · renderer/portal.js:519 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/lens.js:349
  • renderer/lens.js:389 · renderer/portal.js:564 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/lens.js:389
  • renderer/lens.js:458 · renderer/portal.js:840 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/lens.js:458
  • renderer/glass.js:166 · renderer/orb.js:492 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/glass.js:166
  • helpers/player.cjs:118 · helpers/player.cjs:145 — the two spans are one implementation copied and then locally edited — 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — helpers/player.cjs:118
  • renderer/glitchorb.js:89 · renderer/lens.js:349 · renderer/portal.js:519 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/glitchorb.js:89
  • tools/detbench/harmony.mjs:71 · tools/exportbench.mjs:239 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — tools/detbench/harmony.mjs:71
  • renderer/audio-tags.js:65 · renderer/embedded-cover.js:25 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/audio-tags.js:65
  • renderer/chrome.js:203 · renderer/spaghetti.js:567 · renderer/worlds.js:1237 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/chrome.js:203
  • renderer/engine.js:3129 · renderer/engine.js:3151 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/engine.js:3129
  • renderer/game.js:261 · renderer/game.js:690 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — renderer/game.js:261
  • renderer/random.js:16 · tools/clock-harness-page.js:18 — the two spans are one implementation copied and then locally edited — 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/random.js:16
  • renderer/scenery.js:6554 · renderer/spectro.js:125 — the two spans are one implementation copied and then locally edited — 94 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/scenery.js:6554
  • helpers/spotify.cjs:433 · renderer/library.js:132 — the two spans are one implementation copied and then locally edited — 121 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — helpers/spotify.cjs:433
  • renderer/codeview.js:40 · renderer/codeview.js:66 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/codeview.js:40
  • renderer/fx.js:257 · renderer/y2k.js:242 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/fx.js:257
  • renderer/glass.js:401 · renderer/lens.js:458 · renderer/portal.js:840 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — renderer/glass.js:401
  • renderer/library-panel.js:208 · renderer/library-panel.js:608 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — renderer/library-panel.js:208
  • renderer/rings.js:42 · renderer/rings.js:131 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/rings.js:42
  • renderer/scenery.js:6721 · renderer/visuals.js:122 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/scenery.js:6721
  • renderer/voice.js:53 · renderer/voice.js:65 — the two spans are one implementation copied and then locally edited — 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/voice.js:53
  • tools/cdp.mjs:15 · tools/dynamic-theme-check.mjs:36 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — tools/cdp.mjs:15
  • tools/shader-render.js:171 · tools/shader-render.js:322 — the two spans are one implementation copied and then locally edited — 107 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — tools/shader-render.js:171
  • renderer/chrome.js:269 · renderer/chrome.js:276 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — renderer/chrome.js:269
  • renderer/demo.js:15 · tools/checks.js:112 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — renderer/demo.js:15
  • renderer/dotcam.js:115 · REDACTED:619 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — renderer/dotcam.js:115
  • renderer/engine.js:1368 · renderer/engine.js:1385 — the two spans are one implementation copied and then locally edited — 151 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/engine.js:1368
  • renderer/gameskins.js:182 · renderer/gameskins.js:280 — the two spans are one implementation copied and then locally edited — 102 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/gameskins.js:182
  • renderer/random.js:18 · tools/checks.js:95 — the two spans are one implementation copied and then locally edited — 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — renderer/random.js:18

What to do

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

React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).

Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.

  • renderer/take-encode.js:12 reaches into another package with a relative path (../node_modules/mp4-muxer/build/mp4-muxer.mjs) — import the package by name instead. — renderer/take-encode.js:12
  • renderer/track-worker.js:10 reaches into another package with a relative path (../node_modules/@mediapipe/tasks-vision/vision_bundle.mjs) — import the package by name instead. — renderer/track-worker.js:10

What to do

  • Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
R2 · Cyclomatic Complexity5.0 / 10Adequate✓ Tool-verified

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

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

  • draw has cyclomatic complexity 221 and cognitive complexity 267; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/scenery.js:6912
  • draw has cyclomatic complexity 141 and cognitive complexity 184; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/portal.js:838
  • newBar has cyclomatic complexity 130 and cognitive complexity 259; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/engine.js:1917
  • (anonymous) has cyclomatic complexity 93 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/spotify-fake.mjs:79
  • tempoUpdate has cyclomatic complexity 91 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/engine.js:2488
  • draw has cyclomatic complexity 90 and cognitive complexity 126; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/lens.js:457
  • draw has cyclomatic complexity 87 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/worlds.js:1716
  • dance has cyclomatic complexity 82 and cognitive complexity 103; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/noodles.js:750
  • (anonymous) has cyclomatic complexity 72 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/scenery.js:6771
  • scoreExportRun has cyclomatic complexity 72 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/exportbench.mjs:300
  • updatePhase has cyclomatic complexity 72 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/engine.js:2998
  • drawFrame has cyclomatic complexity 71 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/app.js:2459
  • scoreHarmony has cyclomatic complexity 69 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/detbench/harmony.mjs:82
  • pixFor has cyclomatic complexity 64 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/scenery.js:5485
  • drawBoat has cyclomatic complexity 61 and cognitive complexity 125; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/scenery.js:5715
  • frame has cyclomatic complexity 61 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/engine.js:775
  • swimSharks has cyclomatic complexity 57 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/scenery.js:6079
  • pathLine1 has cyclomatic complexity 55 and cognitive complexity 135; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/melody.js:64
  • list has cyclomatic complexity 54 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — helpers/spotify.cjs:285
  • draw has cyclomatic complexity 53 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/visuals.js:249
  • fluxUpdate has cyclomatic complexity 53 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/engine.js:2892
  • scoreSong has cyclomatic complexity 50 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/detbench/score.mjs:133
  • riffNotes has cyclomatic complexity 49 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/codegen.js:112
  • (anonymous) has cyclomatic complexity 49 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1
  • draw has cyclomatic complexity 49 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/card.js:251
  • onKey has cyclomatic complexity 49 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/library-panel.js:1320
  • update has cyclomatic complexity 48 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/noodles.js:450
  • update has cyclomatic complexity 47 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/player.js:243
  • step has cyclomatic complexity 46 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/dominoes.js:154
  • onmessage has cyclomatic complexity 46 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/stems-worker.js:29
  • draw has cyclomatic complexity 46 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/voxcam.js:148
  • render has cyclomatic complexity 46 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — helpers/take-render.cjs:61
  • swimFish has cyclomatic complexity 45 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/scenery.js:5991
  • (anonymous) has cyclomatic complexity 44 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/checks.js:395
  • model has cyclomatic complexity 42 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/game.js:246
  • buildLines has cyclomatic complexity 42 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/codegen.js:302
  • harmonyBar has cyclomatic complexity 42 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/engine.js:2146
  • advance has cyclomatic complexity 41 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/spaghetti.js:167
  • draw has cyclomatic complexity 40 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — renderer/storm.js:212
  • firstUseLoad has cyclomatic complexity 39 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/first-use-host.cjs:14
R3 · Large Files3.9 / 10Weak✓ Tool-verified

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

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

  • renderer/scenery.js has 7222 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/scenery.js:1
  • renderer/app.js has 3341 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/app.js:1
  • renderer/engine.js has 3208 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/engine.js:1
  • renderer/worlds.js has 1855 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/worlds.js:1
  • REDACTED has 1633 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • renderer/library-panel.js has 1406 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/library-panel.js:1
  • renderer/portal.js has 1108 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/portal.js:1
  • tools/checks.js has 1031 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/checks.js:1
  • main.js has 987 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — main.js:1
  • renderer/visuals.js has 986 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/visuals.js:1
  • renderer/gameskins.js has 979 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/gameskins.js:1
  • renderer/noodles.js has 915 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/noodles.js:1
  • renderer/spaghetti-kitchen.js has 888 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/spaghetti-kitchen.js:1
  • renderer/game.js has 865 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/game.js:1
  • REDACTED has 840 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • renderer/spaghetti.js has 783 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/spaghetti.js:1
  • renderer/orb.js has 747 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/orb.js:1
  • renderer/lens.js has 629 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/lens.js:1
  • tools/exportbench.mjs has 550 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/exportbench.mjs:1
  • renderer/worldlooks.js has 530 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/worldlooks.js:1
  • helpers/spotify.cjs has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — helpers/spotify.cjs:1
  • renderer/tape.js has 475 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/tape.js:1
  • renderer/library.js has 463 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/library.js:1
  • renderer/codeview.js has 459 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/codeview.js:1
  • renderer/chrome.js has 455 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/chrome.js:1
  • renderer/rebuild.js has 454 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/rebuild.js:1
  • renderer/player.js has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/player.js:1
  • renderer/glass.js has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/glass.js:1
  • renderer/cuts.js has 418 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/cuts.js:1
  • renderer/y2k.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — renderer/y2k.js:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage9.8 / 10Exemplary✓ Tool-verified

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

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

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×3) — helpers/library-worker.cjs:1, helpers/take-encoder-preload.cjs:1, renderer/boot.js:1

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness9.7 / 10Exemplary✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

R6 · Tooling3.4 / 10Weak✓ Tool-verified

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

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

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

What to do

  • Add eslint and type checking (adopt TypeScript, or type-check the existing JavaScript with `checkJs`) as REDACTED scripts and run them in CI.
R7 · Dead Code9.6 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

  • 323 file(s) (~73409 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: renderer/track-worker.js imports '../node_modules/@mediapipe/tasks-vision/vision_bundle.mjs', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here.
  • Nothing imports this binding — it is safe to review for removal. (×6) — REDACTED:25, renderer/random.js:52, renderer/random.js:53, …
  • This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. (×2) — tools/exportbench.mjs:24, REDACTED:157

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

R9 · Circular Imports10.0 / 10Exemplary✓ Tool-verified

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

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

S1 · Web-Security Posture6.0 / 10Adequate✓ Tool-verified

Other · Security — Read from this repository's JavaScript/TypeScript source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Of the server controls, two are read where the source shows them: every session or sign-in cookie the code sets is read for HttpOnly, Secure and SameSite at the line that sets it (a raw `Set-Cookie` header, Express, Fastify, Hono, Koa, Next.js, `cookie.serialize`, express-session and cookie-session), and every Node listener for HTTPS enforcement. HSTS, security response headers and input validation are NOT assessed for JavaScript/TypeScript: each is scored as an absence, an absence is only reportable over the production HTTP server, and in this ecosystem the file that opens the port is build output or a framework launcher rather than a file in the source tree. Their absence here is not a finding about this repository.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.

  • MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×2) — helpers/library.cjs:116, renderer/library-source.js:109
  • `https://unpkg.com/@strudel/repl@1.3.0` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. — prototype/studio.html:19

What to do

  • Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 2 sites, not one: `helpers/library.cjs:116` (createHash("sha1")), `renderer/library-source.js:109` (subtle.digest("SHA-1")). Each is a separate decision — fixing only the line this row cites leaves the others in place.
  • Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
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.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. 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 `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. 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.

X2 · Cancellation propagation5.5 / 10Adequate✓ Tool-verified

Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).

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

  • Only 2/8 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `loadLooks` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — renderer/app.js:1283
  • `hear` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — renderer/ear.js:60
  • `onmessage` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — renderer/stems-worker.js:29
  • `openExternal` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — helpers/spotify-fake.cjs:26
  • `tokenRequest` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — helpers/spotify.cjs:99
  • `send` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — helpers/spotify.cjs:272

What to do

  • Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
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.

X24 · Document value interpolated into markup unescaped6.7 / 10Adequate✓ Tool-verified

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

  • `text` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — helpers/spotify.cjs:53
  • `status` is text this program did not author, and it is written into the text of an element through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/app.js:1874
  • `chord?'chord '+chord.name:'listening for chords...'` is text this program did not author, and it is written into the text of an element through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/app.js:1899
  • `body` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/fx.js:70
  • `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. (×2) — renderer/library-panel.js:252, renderer/y2k.js:174
  • `left` is text this program did not author, and it is written into the text of an element through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/library-panel.js:279
  • `on?'▶':here?'❚❚':half()?'':two(row.index+1)` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/library-panel.js:295
  • `SPOTIFY_ICON` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/player.js:144
  • `icon` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/y2k.js:91
  • `innerWidth` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — renderer/y2k.js:194

What to do

  • Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
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.

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 handling4.6 / 10Weak✓ 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.

  • 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. (×24) — main.js:68, main.js:184, main.js:369, …
  • `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. (×14) — main.js:679, main.js:779, main.js:827, …
  • `.then(…, () => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. (×2) — renderer/app.js:3348, renderer/backrooms.js:113

What to do

  • Swallowed exception (empty catch)
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.

WCAG coverage — what static analysis assessed

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

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

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

Reference — by lens

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

LensScoreRatingImpact
Code Health41.0Weak — gated by D1, D2, R1, R3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture97.6ExemplaryStrongest area.
Maturity56.5Adequate — gated by D15, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness30.5Weak — gated by R6, P2, P3, P7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security61.2Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility49.0Adequate — gated by AC1, AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance60.0AdequateAcceptable, with room to improve.
Unscored — 3 check(s) recorded observations but carry no score

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

  • 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 — 23 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

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

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 54 check(s) not relevant to this codebase

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

  • AX1 Captive dependencies — Not applicable: this repository's JavaScript 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 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. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — no interface, protocol or abstract type declares an operation an implementer must write
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): the dev server could not reach the network from our sandbox (a registry or API request was refused). This is a limit of our sandbox, not of your repository. Last output: "at Object.<anonymous> (<repo>/node_modules/electron/index.js:52:18) / at Module._compile (node:internal/modules/cjs/loader:1562:14) / at Object..js (node:internal/modules/cjs/loader:1699:10) / at Module.load (node:internal/modules/cjs/loader:1313:32) / at Function._load (node:internal/modules/cjs/loader:1123:12) / at TracingChannel.traceSync (node:diagnostics_channel:322:14) / at wrapModuleLoad (node:internal/modules/cjs/loader:217:24) / at Module.require (node:internal/modules/cjs/loader:1335:12) / at require (node:internal/modules/helpers:136:16) / Node.js v22.13.0" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no data at rest for these controls to protect. If it does persist personal data (through a hosted backend configured outside this repository, for instance), the controls belong to wherever that data is stored.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository stands up no server (no Express, Fastify, Koa, Hono, NestJS or similar app, no Next.js/SvelteKit/Nuxt server route, no edge function), creates no Supabase tables and talks to no hosted backend. Access control is therefore N/A here — a browser application or library is authorized by the server it calls, not by itself; a client-side route guard hides a page and authorizes nothing. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound. If it does (through a hosted backend configured outside this repository, for instance), the limit belongs wherever that data is stored.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over. If it does (through a hosted backend configured outside this repository, for instance), the rights are served wherever that data is stored.
  • D11 Test Reliability — Test reliability not included — no test command the analyzer could start
  • 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 — Naming consistency does not read html yet; not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. 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) — 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.
  • 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.
  • D5 Coupling — Not applicable — this npm build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured — no coverage collector for the .py test suite
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a REDACTED, 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.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • 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
  • X26 Unsynchronised callback handoff — X26 reached only 6% of this repository's production lines — javascript (55,655 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X27 Collection changed while being enumerated — Not applicable: this check looks for a loop whose body adds to or removes from the very collection the loop is walking, invalidating the enumerator it holds, and in this repository's languages that cannot happen. JavaScript and TypeScript have no iterator that a change can invalidate: an `Array` is walked by index against its live length, and a `Map` or `Set` by the ECMAScript specification's live entry list, so a body that adds to, removes from or empties what it walks raises nothing — every loop form (`for…of`, `for…in`, `forEach`, `map`, `filter`, `reduce`, `entries()`) on every built-in collection (`Array`, `Map`, `Set`, plain objects, `URLSearchParams`, `Headers`, `FormData`) runs to completion. Such a loop can still skip an element or never end, which is a different defect and not the one this check asks about. Swift's `Array`, `Dictionary` and `Set` are values: `for x in items` walks the copy taken when the loop starts, so a body that adds to or removes from `items` changes a different value, nothing is invalidated, and every original element is still visited. This repository's Swift names no Foundation mutable collection (`NSMutableArray` and kin), the one kind a Swift loop can walk by reference. Not a gap in the analyzer and not a finding about your code.
  • 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 Swift was read, and it logs through none: `print` and `NSLog` take one finished line, and os's `Logger` keeps each interpolated value as its own argument, so an assembled message there loses nothing the API could have kept (as with log4net in C#). Calls through swift-log (`import Logging`) and `os_log` calls would be judged.
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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 — 17 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <input> without a programmatic label · ×2
  • <input> without a programmatic label renderer/index.html:179 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label renderer/index.html:180 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 1036 finding(s)
X3 · Exception handling · Swallowed exception (empty catch) · ×40
  • Swallowed exception (empty catch) main.js:68 — 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) main.js:184 — 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) main.js:369 — 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) main.js:393 — 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) main.js:679 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) main.js:703 — 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) main.js:779 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) main.js:811 — 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) main.js:827 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) main.js:841 — 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) main.js:871 — 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) update.js:142 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) update.js:204 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) update.js:237 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) update.js:240 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) renderer/app.js:257 — 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) renderer/app.js:341 — 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) renderer/app.js:345 — 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) renderer/app.js:439 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) renderer/app.js:551 — 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) renderer/app.js:668 — 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) renderer/app.js:748 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) renderer/app.js:1067 — 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) renderer/app.js:2078 — 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) renderer/app.js:2119 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • + 15 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×27
  • Hotspot: renderer/engine.js renderer/engine.js:546 — renderer/engine.js changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 1228 in engine.createEngine at line 546. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/engine.js`: 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: renderer/app.js renderer/app.js:2459 — renderer/app.js changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in app.drawFrame at line 2459. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/app.js`: 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: main.js main.js:527 — main.js changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in main.setUpIpc at line 527. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- main.js`: 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: renderer/worlds.js renderer/worlds.js:1185 — renderer/worlds.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 239 in worlds.createWorlds at line 1185. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/worlds.js`: 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: renderer/visuals.js renderer/visuals.js:249 — renderer/visuals.js changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in visuals.createField.draw at line 249. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/visuals.js`: 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: renderer/portal.js renderer/portal.js:838 — renderer/portal.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in portal.createPortal.draw at line 838. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/portal.js`: 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: renderer/library-panel.js renderer/library-panel.js:1320 — renderer/library-panel.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in library-panel.createLibraryPanel.onKey at line 1320. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/library-panel.js`: 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: helpers/spotify.cjs helpers/spotify.cjs:285 — helpers/spotify.cjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in spotify.createWebApi.list at line 285. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- helpers/spotify.cjs`: 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: tools/spotify-fake.mjs tools/spotify-fake.mjs:76 — tools/spotify-fake.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in spotify-fake.startFakeSpotify.server at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- tools/spotify-fake.mjs`: 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: renderer/tape.js renderer/tape.js:20 — renderer/tape.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in tape.createTape at line 20. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/tape.js`: 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: renderer/codegen.js renderer/codegen.js:302 — renderer/codegen.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in codegen.buildLines at line 302. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/codegen.js`: 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: REDACTED REDACTED:1 — REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in page.default at line 1. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- REDACTED`: 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: renderer/codeview.js renderer/codeview.js:185 — renderer/codeview.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in codeview.createCodeView.plan at line 185. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/codeview.js`: 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: renderer/player.js renderer/player.js:243 — renderer/player.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in player.createPlayerBar.update at line 243. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/player.js`: 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: tools/exportbench.mjs tools/exportbench.mjs:300 — tools/exportbench.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in exportbench.scoreExportRun at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- tools/exportbench.mjs`: 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: renderer/library.js renderer/library.js:315 — renderer/library.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in library.coverGlyphs at line 315. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/library.js`: 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: renderer/game.js renderer/game.js:806 — renderer/game.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in game.createGame.draw at line 806. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/game.js`: 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: renderer/spectro.js renderer/spectro.js:344 — renderer/spectro.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in spectro.createSpectro.draw at line 344. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/spectro.js`: 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: renderer/gameboot.js renderer/gameboot.js:84 — renderer/gameboot.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in gameboot.paint at line 84. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/gameboot.js`: 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: renderer/dotcam.js renderer/dotcam.js:159 — renderer/dotcam.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in dotcam.createDotCam.draw at line 159. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/dotcam.js`: 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: renderer/orb.js renderer/orb.js:678 — renderer/orb.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in orb.createOrb.draw at line 678. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/orb.js`: 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: renderer/voxcam.js renderer/voxcam.js:148 — renderer/voxcam.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in voxcam.createVoxCam.draw at line 148. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/voxcam.js`: 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: update.js update.js:67 — update.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in update.check at line 67. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- update.js`: 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: renderer/glass.js renderer/glass.js:272 — renderer/glass.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in glass.createGlass.drawCode at line 272. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/glass.js`: 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: renderer/gameskins.js renderer/gameskins.js:317 — renderer/gameskins.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gameskins.osTop at line 317. 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 21:19:03 -05:00' --until='2026-11-16 21:19:03 -05:00' --full-history --no-merges -- renderer/gameskins.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 2 more in this group — see findings.md.
D2 · Cognitive Complexity · createEngine · ×26
  • createEngine::newBar (cognitive 259) renderer/engine.js:1917 — createEngine::newBar has cognitive complexity 259 (threshold 15). Drivers by points: if/else 39 (110 pts), ternaries 18 (56 pts), loops 17 (50 pts), boolean chains 43 (nesting depth added 142). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::tempoUpdate (cognitive 98) renderer/engine.js:2488 — createEngine::tempoUpdate has cognitive complexity 98 (threshold 15). Drivers by points: boolean chains 36, if/else 25 (34 pts), ternaries 12 (27 pts), other 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::updatePhase (cognitive 96) renderer/engine.js:2998 — createEngine::updatePhase has cognitive complexity 96 (threshold 15). Drivers by points: if/else 25 (44 pts), boolean chains 22, ternaries 11 (19 pts), loops 8 (10 pts), other 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::frame (cognitive 75) renderer/engine.js:775 — createEngine::frame has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (30 pts), loops 13 (17 pts), boolean chains 15, ternaries 6 (10 pts), other 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::fluxUpdate (cognitive 54) renderer/engine.js:2892 — createEngine::fluxUpdate has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 12, loops 3 (5 pts), ternaries 4 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::harmonyBar (cognitive 49) renderer/engine.js:2146 — createEngine::harmonyBar has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 8 (10 pts), boolean chains 8, loops 5 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::estimateTempo (cognitive 48) renderer/engine.js:2361 — createEngine::estimateTempo has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 8 (11 pts), boolean chains 10, ternaries 8 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::lead (cognitive 46) renderer/engine.js:1356 — createEngine::lead has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 14, loops 4 (5 pts), ternaries 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::fluxTempo (cognitive 44) renderer/engine.js:2795 — createEngine::fluxTempo has cognitive complexity 44 (threshold 15). Drivers by points: loops 14 (20 pts), if/else 7 (11 pts), boolean chains 6, ternaries 5 (6 pts), other 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • createEngine::pitch (cognitive 41) renderer/engine.js:1409 — createEngine::pitch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 9 (12 pts), boolean chains 7, ternaries 3 (5 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.
  • createEngine::sameLearned (cognitive 40) renderer/engine.js:3208 — createEngine::sameLearned has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 10, loops 4 (5 pts), other 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::place (cognitive 37) renderer/engine.js:948 — createEngine::place has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 8, loops 2 (6 pts), ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::hhFinish (cognitive 37) renderer/engine.js:1318 — createEngine::hhFinish has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (7 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::keyBar (cognitive 32) renderer/engine.js:2258 — createEngine::keyBar has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 9 (10 pts), boolean chains 9, loops 2, other 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • createEngine::newBeat (cognitive 29) renderer/engine.js:1597 — createEngine::newBeat has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (9 pts), boolean chains 5, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::clock (cognitive 28) renderer/engine.js:1535 — createEngine::clock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 12 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
  • createEngine::lowDecide (cognitive 27) renderer/engine.js:1007 — createEngine::lowDecide has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, ternaries 2 (6 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.
  • createEngine::pumpCheck (cognitive 27) renderer/engine.js:2325 — createEngine::pumpCheck has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, loops 2 (3 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.
  • createEngine::estimateTempo::fit (cognitive 27) renderer/engine.js:2387 — createEngine::estimateTempo::fit has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 3 (6 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • createEngine::halfTime (cognitive 25) renderer/engine.js:1735 — createEngine::halfTime has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (8 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::lockTo (cognitive 21) renderer/engine.js:2716 — createEngine::lockTo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::sectionBeat (cognitive 20) renderer/engine.js:1640 — createEngine::sectionBeat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • createEngine::wobbleCheck (cognitive 18) renderer/engine.js:1869 — createEngine::wobbleCheck has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (5 pts), boolean chains 4, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createEngine::hit (cognitive 17) renderer/engine.js:1267 — createEngine::hit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 1 (2 pts), ternaries 1 (2 pts) (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.
  • createEngine::listenOpening (cognitive 17) renderer/engine.js:2101 — createEngine::listenOpening has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 2 (3 pts) (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.
  • + 1 more in this group — see findings.md.
D1 · Cyclomatic Complexity · createEngine · ×23
  • createEngine::newBar (cyclomatic 130) renderer/engine.js:1917 — createEngine::newBar has cyclomatic complexity 130 (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.
  • createEngine::tempoUpdate (cyclomatic 91) renderer/engine.js:2488 — createEngine::tempoUpdate has cyclomatic complexity 91 (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.
  • createEngine::updatePhase (cyclomatic 72) renderer/engine.js:2998 — createEngine::updatePhase has cyclomatic complexity 72 (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.
  • createEngine::frame (cyclomatic 61) renderer/engine.js:775 — createEngine::frame has cyclomatic complexity 61 (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.
  • createEngine::fluxUpdate (cyclomatic 53) renderer/engine.js:2892 — createEngine::fluxUpdate has cyclomatic complexity 53 (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.
  • createEngine::harmonyBar (cyclomatic 42) renderer/engine.js:2146 — createEngine::harmonyBar has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::estimateTempo (cyclomatic 37) renderer/engine.js:2361 — createEngine::estimateTempo has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::lead (cyclomatic 36) renderer/engine.js:1356 — createEngine::lead has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::fluxTempo (cyclomatic 34) renderer/engine.js:2795 — createEngine::fluxTempo has cyclomatic complexity 34 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • createEngine::pitch (cyclomatic 33) renderer/engine.js:1409 — createEngine::pitch has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::sameLearned (cyclomatic 32) renderer/engine.js:3208 — createEngine::sameLearned has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::lowDecide (cyclomatic 30) renderer/engine.js:1007 — createEngine::lowDecide has cyclomatic complexity 30 (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.
  • createEngine::keyBar (cyclomatic 29) renderer/engine.js:2258 — createEngine::keyBar has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • createEngine::place (cyclomatic 28) renderer/engine.js:948 — createEngine::place has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::clock (cyclomatic 27) renderer/engine.js:1535 — createEngine::clock has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • createEngine::newBeat (cyclomatic 22) renderer/engine.js:1597 — createEngine::newBeat has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::hhFinish (cyclomatic 21) renderer/engine.js:1318 — createEngine::hhFinish has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • createEngine::halfTime (cyclomatic 20) renderer/engine.js:1735 — createEngine::halfTime 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.
  • createEngine::pumpCheck (cyclomatic 20) renderer/engine.js:2325 — createEngine::pumpCheck 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.
  • createEngine::wobbleCheck (cyclomatic 19) renderer/engine.js:1869 — createEngine::wobbleCheck 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.
  • createEngine::kickFrame (cyclomatic 16) renderer/engine.js:1213 — createEngine::kickFrame has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • createEngine::sectionBeat (cyclomatic 16) renderer/engine.js:1640 — createEngine::sectionBeat 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.
  • createEngine::lockTo (cyclomatic 16) renderer/engine.js:2716 — createEngine::lockTo 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.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×21
  • Sync-over-async blocking helpers/take-render.cjs:101 — `fs.openSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:109 — `fs.writeSync` in `listen("take:write")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:182 — `fs.fsyncSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:182 — `fs.closeSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:183 — `fs.renameSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:195 — `fs.closeSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:196 — `fs.rmSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking helpers/take-render.cjs:199 — `fs.existsSync` in `render` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:30 — `execFileSync` in `callback to createServer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:104 — `fs.writeFileSync` in `shot` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:192 — `fs.readdirSync` in `fixtureCovers` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:204 — `spawnSync` in `spotifyReady` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:205 — `spawnSync` in `spotifyReady` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:769 — `fs.existsSync` in `step("spotify, your own library: the guide (four steps) and the field for a Client ID; a bad ID in words; the sign-in (PKCE) against the fake; the lists with their covers; the page never has a token")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:769 — `fs.readFileSync` in `step("spotify, your own library: the guide (four steps) and the field for a Client ID; a bad ID in words; the sign-in (PKCE) against the fake; the lists with their covers; the page never has a token")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:891 — `fs.existsSync` in `step("spotify, what goes wrong is said as main says it: no Premium, no open player, a slow-down, a token that lapsed early (one fresh try), a connection that is gone (the field comes back, and signing in again works)")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:956 — `fs.existsSync` in `step("spotify, a list that goes on: a "more" row after the first 50, Enter on it adds the rest; disconnecting asks twice, and forgets")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:960 — `fs.existsSync` in `step("spotify, a list that goes on: a "more" row after the first 50, Enter on it adds the rest; disconnecting asks twice, and forgets")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:1169 — `fs.realpathSync` in `step("main refuses what is not an audio file inside the folder, whatever the page asks")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:1438 — `fs.existsSync` in `step("spotify after a restart: the pasted links are back, named; main kept the sign-in (no new one is asked for) and the lists load, through a refresh of the kept token")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking tools/player-bar-check.mjs:61 — `fs.writeFileSync` in `shot` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
AC1 · Text alternatives · <canvas> without a text alternative · ×20
  • <canvas> without a text alternative renderer/card.js:34 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/fx.js:63 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/fx.js:81 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/game.js:413 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/gameboot.js:223 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/gamescreen.js:10 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/gameskins.js:934 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/glass.js:105 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/glass.js:112 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:11 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:25 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:30 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:71 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:72 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:73 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/index.html:74 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/library-panel.js:126 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/share-card.js:28 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/storm.js:16 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative renderer/worlds.js:1230 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
D3 · God Classes · FunctionTooLong · ×19
  • FunctionTooLong: engine.createEngine renderer/engine.js:546 — FunctionTooLong — createEngine runs 1748 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1648 over it, 17.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: worlds.createWorlds renderer/worlds.js:1185 — FunctionTooLong — createWorlds runs 574 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 474 over it, 5.74× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: game.createGame renderer/game.js:224 — FunctionTooLong — createGame runs 518 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 418 over it, 5.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: codeview.createCodeView renderer/codeview.js:92 — FunctionTooLong — createCodeView runs 280 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 180 over it, 2.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: post.createPost REDACTED:541 — FunctionTooLong — createPost runs 261 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 161 over it, 2.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: portal.createPortal.draw renderer/portal.js:838 — FunctionTooLong — createPortal.draw runs 226 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 126 over it, 2.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: spectro.createSpectro renderer/spectro.js:119 — FunctionTooLong — createSpectro runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: y2k.createY2k renderer/y2k.js:169 — FunctionTooLong — createY2k runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: storm.createStorm renderer/storm.js:44 — FunctionTooLong — createStorm runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: voxcam.createVoxCam renderer/voxcam.js:56 — FunctionTooLong — createVoxCam runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: dominoes.createDominoes renderer/dominoes.js:43 — FunctionTooLong — createDominoes runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: lens.createLens.draw renderer/lens.js:457 — FunctionTooLong — createLens.draw runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: segcam.createSegcam renderer/segcam.js:69 — FunctionTooLong — createSegcam runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: fx.createTakeover renderer/fx.js:196 — FunctionTooLong — createTakeover runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: game.createGame.drawTop renderer/game.js:551 — FunctionTooLong — createGame.drawTop runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: take-render.createTakeRender.render helpers/take-render.cjs:61 — FunctionTooLong — createTakeRender.render runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: clips.createClips renderer/clips.js:14 — FunctionTooLong — createClips runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: warp.createWarp renderer/warp.js:50 — FunctionTooLong — createWarp runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: wait.createWait renderer/wait.js:11 — FunctionTooLong — createWait runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×15
  • Animation without a prefers-reduced-motion guard prototype/now-coding.html:62 — `body.glitch #code` moves (`animation: glitch .34s steps(2) 1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard prototype/studio.html:74 — `#toast` moves (`transition: opacity .25s, transform .25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:97 — `#tube .t-roll` moves (`animation: tube-roll 7.3s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:105 — `#tube.static .t-static` moves (`animation: tube-static .34s ease-out 1, tube-snow .06s steps(1) 6`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:130 — `#tube.power-on .t-power` moves (`animation: tube-power-on .62s ease-out forwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:131 — `#tube.power-off .t-power` moves (`animation: tube-power-off .5s ease-in forwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:150 — `body.tube-on.jolt > :not(#tube):not(dialog)` moves (`animation: tube-jolt .36s steps(1) 1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:290 — `body.glitch #code` moves (`animation: glitch .34s steps(2) 1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:431 — `header > #b-star` moves (`transition: opacity .5s var(--ease-fade), transform .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:696 — `#desk-front .balloon` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:709 — `.xp` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:816 — `.crt` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/style.css:832 — `.mini-bsod` moves (`animation: pop .45s var(--spring)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/stars.js:82 — `s.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard renderer/stars.js:87 — `star.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
D3 · God Classes · FileTooLong · ×14
  • FileTooLong: renderer/app.js renderer/app.js — FileTooLong — 2484 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1984 over it, 4.97× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: renderer/engine.js renderer/engine.js — FileTooLong — 2100 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 83% of them inside a single declaration: createEngine (546-3302). The bar is 500 significant lines; this is 1600 over it, 4.20× 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: renderer/worlds.js renderer/worlds.js — FileTooLong — 1503 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 61% of them inside a single declaration: KEPT (13-1170). The bar is 500 significant lines; this is 1003 over it, 3.01× 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: renderer/library-panel.js renderer/library-panel.js — FileTooLong — 1123 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 623 over it, 2.25× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: prototype/now-coding.html prototype/now-coding.html — FileTooLong — 983 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 483 over it, 1.97× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: renderer/portal.js renderer/portal.js — FileTooLong — 807 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 87% of them inside a single declaration: VERT (198-1139). The bar is 500 significant lines; this is 307 over it, 1.61× 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: renderer/gameskins.js renderer/gameskins.js — FileTooLong — 772 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 272 over it, 1.54× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: renderer/visuals.js renderer/visuals.js — FileTooLong — 706 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 206 over it, 1.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: ./main.js main.js — FileTooLong — 692 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 192 over it, 1.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 over it, 1.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: renderer/game.js renderer/game.js — FileTooLong — 664 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 78% of them inside a single declaration: createGame (224-890). The bar is 500 significant lines; this is 164 over it, 1.33× 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: renderer/noodles.js renderer/noodles.js — FileTooLong — 606 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 106 over it, 1.21× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: renderer/spaghetti.js renderer/spaghetti.js — FileTooLong — 591 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: FULL (370-825). The bar is 500 significant lines; this is 91 over it, 1.18× 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: renderer/orb.js renderer/orb.js — FileTooLong — 521 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 21 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×11
  • Untrusted text written into markup unescaped helpers/spotify.cjs:53 — `text` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/app.js:1874 — `status` is text this program did not author, and it is written into the text of an element through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/app.js:1899 — `chord?'chord '+chord.name:'listening for chords...'` is text this program did not author, and it is written into the text of an element through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/fx.js:70 — `body` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/library-panel.js:252 — `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/library-panel.js:279 — `left` is text this program did not author, and it is written into the text of an element through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/library-panel.js:295 — `on?'▶':here?'❚❚':half()?'':two(row.index+1)` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/player.js:144 — `SPOTIFY_ICON` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/y2k.js:91 — `icon` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/y2k.js:174 — `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped renderer/y2k.js:194 — `innerWidth` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×7
  • Focus outline removed in CSS without a :focus replacement prototype/studio.html:39 — `#stage .cm-editor.cm-focused` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement renderer/style.css:742 — `.xp button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement renderer/style.css:1065 — `#library .lib-q` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement renderer/style.css:1102 — `#library .lib-list` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement renderer/style.css:1124 — `#library .lib-address` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement renderer/style.css:1167 — `#library .lib-cover.real` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement renderer/style.css:1170 — `#library .lib-cover.lib-spot` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
R10 · Code Duplication · Duplicated block (8 lines × 2 locations) · ×6
  • Duplicated block (8 lines × 2 locations) renderer/codeview.js:40 — renderer/codeview.js:40 · renderer/codeview.js:66 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (8 lines × 2 locations) renderer/fx.js:257 — renderer/fx.js:257 · renderer/y2k.js:242 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (8 lines × 2 locations) renderer/library-panel.js:208 — renderer/library-panel.js:208 · renderer/library-panel.js:608 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2 locations) renderer/rings.js:42 — renderer/rings.js:42 · renderer/rings.js:131 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (8 lines × 2 locations) renderer/scenery.js:6721 — renderer/scenery.js:6721 · renderer/visuals.js:122 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (8 lines × 2 locations) tools/cdp.mjs:15 — tools/cdp.mjs:15 · tools/dynamic-theme-check.mjs:36 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
X2 · Cancellation propagation · Async function without AbortSignal · ×6
  • Async function without AbortSignal: loadLooks renderer/app.js:1283 — `loadLooks` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: hear renderer/ear.js:60 — `hear` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: onmessage renderer/stems-worker.js:29 — `onmessage` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: openExternal helpers/spotify-fake.cjs:26 — `openExternal` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: tokenRequest helpers/spotify.cjs:99 — `tokenRequest` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: send helpers/spotify.cjs:272 — `send` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
AC3 · Page structure · Data table has no header cells · ×5
  • Data table has no header cells prototype/now-coding.html:211 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells prototype/studio.html:165 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells prototype/studio.html:177 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells prototype/studio.html:188 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells prototype/studio.html:195 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
D2 · Cognitive Complexity · createWorlds · ×4
  • createWorlds::draw (cognitive 108) renderer/worlds.js:1716 — createWorlds::draw has cognitive complexity 108 (threshold 15). Drivers by points: if/else 30 (43 pts), boolean chains 33, ternaries 19 (24 pts), error handling 2 (4 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createWorlds::paintWords (cognitive 33) renderer/worlds.js:1580 — createWorlds::paintWords has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts), other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createWorlds::lookProg (cognitive 17) renderer/worlds.js:1348 — createWorlds::lookProg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (4 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • createWorlds::shot (cognitive 17) renderer/worlds.js:1508 — createWorlds::shot has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), ternaries 4 (5 pts), other 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.4 · ×3
  • Low contrast colour pair in CSS (4.4:1) prototype/now-coding.html:107 — `#bsod` sets color: #fff on background-color: #0078d7 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.4:1) renderer/style.css:843 — `#bsod` sets color: #fff on background-color: #0078d7 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.4:1) renderer/style.css:848 — `.y2k-shatter .bsod-shard` sets color: #fff on background-color: #0078d7 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · createWorlds · ×3
  • createWorlds::draw (cyclomatic 87) renderer/worlds.js:1716 — createWorlds::draw has cyclomatic complexity 87 (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.
  • createWorlds::paintWords (cyclomatic 23) renderer/worlds.js:1580 — createWorlds::paintWords 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.
  • createWorlds::shot (cyclomatic 18) renderer/worlds.js:1508 — createWorlds::shot has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
R10 · Code Duplication · Duplicated block with local edits (17 matched lines × 2 locations) · ×3
  • Duplicated block with local edits (17 matched lines × 2 locations) renderer/melody.js:83 — renderer/melody.js:83 · renderer/melody.js:106 — the two spans are one implementation copied and then locally edited — 282 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (17 matched lines × 2 locations) tools/clock-harness-page.js:15 — tools/clock-harness-page.js:15 · tools/take-replay-check.cjs:20 — the two spans are one implementation copied and then locally edited — 859 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (17 matched lines × 2 locations) REDACTED:71 — REDACTED:71 · tools/player-bar-check.mjs:32 — the two spans are one implementation copied and then locally edited — 323 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×3
  • Duplicated block (9 lines × 2 locations) renderer/audio-tags.js:65 — renderer/audio-tags.js:65 · renderer/embedded-cover.js:25 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (9 lines × 2 locations) renderer/engine.js:3129 — renderer/engine.js:3129 · renderer/engine.js:3151 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (9 lines × 2 locations) renderer/game.js:261 — renderer/game.js:261 · renderer/game.js:690 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block with local edits (8 matched lines × 2 locations) · ×3
  • Duplicated block with local edits (8 matched lines × 2 locations) helpers/spotify.cjs:433 — helpers/spotify.cjs:433 · renderer/library.js:132 — the two spans are one implementation copied and then locally edited — 121 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (8 matched lines × 2 locations) renderer/voice.js:53 — renderer/voice.js:53 · renderer/voice.js:65 — the two spans are one implementation copied and then locally edited — 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (8 matched lines × 2 locations) tools/shader-render.js:171 — tools/shader-render.js:171 · tools/shader-render.js:322 — the two spans are one implementation copied and then locally edited — 107 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (7 lines × 2 locations) · ×3
  • Duplicated block (7 lines × 2 locations) renderer/chrome.js:269 — renderer/chrome.js:269 · renderer/chrome.js:276 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (7 lines × 2 locations) renderer/demo.js:15 — renderer/demo.js:15 · tools/checks.js:112 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (7 lines × 2 locations) renderer/dotcam.js:115 — renderer/dotcam.js:115 · REDACTED:619 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block with local edits (7 matched lines × 2 locations) · ×3
  • Duplicated block with local edits (7 matched lines × 2 locations) renderer/engine.js:1368 — renderer/engine.js:1368 · renderer/engine.js:1385 — the two spans are one implementation copied and then locally edited — 151 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (7 matched lines × 2 locations) renderer/gameskins.js:182 — renderer/gameskins.js:182 · renderer/gameskins.js:280 — the two spans are one implementation copied and then locally edited — 102 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (7 matched lines × 2 locations) renderer/random.js:18 — renderer/random.js:18 · tools/checks.js:95 — the two spans are one implementation copied and then locally edited — 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R4 · Test Coverage · No test reaches this file · ×3
  • No test reaches this file helpers/library-worker.cjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file helpers/take-encoder-preload.cjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file renderer/boot.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×2
  • Edited copy of a member (16 corresponding lines) helpers/mac/faces.swift:85 — helpers/mac/faces.swift:85-100 | helpers/mac/nowplaying.swift:126-146 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) tools/handheld/clear.py:106 — tools/handheld/clear.py:106-122 | tools/handheld/concepts/cc.py:98-113 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×2
  • Edited copy of a member (9 corresponding lines) tools/handheld/clear.py:136 — tools/handheld/clear.py:136-144 | tools/handheld/model.py:121-130 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) tools/handheld/concepts/cc.py:327 — tools/handheld/concepts/cc.py:327-344 | tools/handheld/concepts/flip.py:66-74 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (3 corresponding lines) · ×2
  • Edited copy of a member (3 corresponding lines) tools/handheld/clear.py:527 — tools/handheld/clear.py:527-529 | tools/handheld/model.py:429-432 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) tools/handheld/concepts/metal.py:136 — tools/handheld/concepts/metal.py:136-138 | tools/handheld/model.py:218-221 — These two members are one piece of code written twice and then edited apart: 3 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, 3+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 3+ corresponding lines) tools/handheld/concepts/cart.py:113 — tools/handheld/concepts/cart.py:113-115 | tools/handheld/concepts/metal.py:198-200 | tools/handheld/concepts/wide.py:192-194 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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.
  • Edited copies of one member (3 members, 3+ corresponding lines) tools/handheld/clear.py:91 — tools/handheld/clear.py:91-93 | tools/handheld/concepts/cc.py:75-77 | tools/handheld/model.py:78-80 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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 · Duplicated block (6 lines × 3) · ×2
  • Duplicated block (6 lines × 3) tools/handheld/clear.py:108 — tools/handheld/clear.py:108-113 | tools/handheld/concepts/cc.py:100-105 | tools/handheld/model.py:95-100 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (6 lines × 3) tools/handheld/concepts/tex_wide.py:29 — tools/handheld/concepts/tex_wide.py:29-34 | tools/handheld/concepts/textures.py:35-40 | tools/handheld/concepts/textures.py:100-105 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×2
  • Duplicated block (5 lines × 3) tools/handheld/clear.py:60 — tools/handheld/clear.py:60-64 | tools/handheld/concepts/cc.py:35-39 | tools/handheld/model.py:49-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (5 lines × 3) tools/handheld/concepts/stickers2.py:15 — tools/handheld/concepts/stickers2.py:15-19 | tools/handheld/concepts/tex_wide.py:14-18 | tools/handheld/concepts/textures.py:17-21 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2
  • Duplicated block (6 lines × 2) tools/handheld/clear.py:117 — tools/handheld/clear.py:117-122 | tools/handheld/concepts/cc.py:108-113 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (6 lines × 2) tools/handheld/clear.py:136 — tools/handheld/clear.py:136-141 | tools/handheld/model.py:122-127 — 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) · ×2
  • Duplicated block (5 lines × 2) tools/handheld/clear.py:395 — tools/handheld/clear.py:395-399 | tools/handheld/model.py:307-311 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) tools/handheld/concepts/stickers2.py:293 — tools/handheld/concepts/stickers2.py:293-297 | tools/handheld/concepts/textures.py:106-110 — 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.
R10 · Code Duplication · Duplicated block (13 lines × 2 locations) · ×2
  • Duplicated block (13 lines × 2 locations) renderer/lens.js:349 — renderer/lens.js:349 · renderer/portal.js:519 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (13 lines × 2 locations) renderer/lens.js:389 — renderer/lens.js:389 · renderer/portal.js:564 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block with local edits (9 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (9 matched lines × 2 locations) renderer/random.js:16 — renderer/random.js:16 · tools/clock-harness-page.js:18 — the two spans are one implementation copied and then locally edited — 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (9 matched lines × 2 locations) renderer/scenery.js:6554 — renderer/scenery.js:6554 · renderer/spectro.js:125 — the two spans are one implementation copied and then locally edited — 94 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R11 · Import Boundaries · Boundary violation [package · ×2
  • Boundary violation [package:relative-cross-package] renderer/take-encode.js:12 — renderer/take-encode.js:12 reaches into another package with a relative path (../node_modules/mp4-muxer/build/mp4-muxer.mjs) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] renderer/track-worker.js:10 — renderer/track-worker.js:10 reaches into another package with a relative path (../node_modules/@mediapipe/tasks-vision/vision_bundle.mjs) — import the package by name instead.
S1 · Web-Security Posture · Weak hash algorithm · ×2
  • Weak hash algorithm helpers/library.cjs:116 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm renderer/library-source.js:109 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.5 · ×1
  • Low contrast colour pair in CSS (2.5:1) renderer/style.css:706 — `.xp` sets color: #000 on background-color: #0831d9 — 2.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · engine.createEngine (cyclomatic 1228) · ×1
  • engine.createEngine (cyclomatic 1228) renderer/engine.js:546 — engine.createEngine has cyclomatic complexity 1228 (threshold 15). Of this number, 1131 points are the body's own statements and 97 belong to 44 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createScenery.draw (cyclomatic 229) · ×1
  • createScenery.draw (cyclomatic 229) renderer/scenery.js:6912 — createScenery.draw has cyclomatic complexity 229 (threshold 15). Of this number, 221 points are the body's own statements and 8 belong to 12 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.createScenery.draw (cyclomatic 219) · ×1
  • scenery.createScenery.draw (cyclomatic 219) renderer/scenery.js:6912 — scenery.createScenery.draw has cyclomatic complexity 219 (threshold 15). Of this number, 212 points are the body's own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createPortal.draw (cyclomatic 147) · ×1
  • createPortal.draw (cyclomatic 147) renderer/portal.js:838 — createPortal.draw has cyclomatic complexity 147 (threshold 15). Of this number, 141 points are the body's own statements and 6 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · portal.createPortal.draw (cyclomatic 146) · ×1
  • portal.createPortal.draw (cyclomatic 146) renderer/portal.js:838 — portal.createPortal.draw has cyclomatic complexity 146 (threshold 15). Of this number, 140 points are the body's own statements and 6 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · setUpIpc (cyclomatic 117) · ×1
  • setUpIpc (cyclomatic 117) main.js:527 — setUpIpc has cyclomatic complexity 117 (threshold 15). Most of this is not in the body itself: 3 of the 117 points are its own statements and the rest belongs to 103 function items inside it that branch (a function literal at line 598, a function literal at line 624, a function literal at line 684, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · worlds.createWorlds (cyclomatic 110) · ×1
  • worlds.createWorlds (cyclomatic 110) renderer/worlds.js:1185 — worlds.createWorlds has cyclomatic complexity 110 (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 · lens.createLens.draw (cyclomatic 99) · ×1
  • lens.createLens.draw (cyclomatic 99) renderer/lens.js:457 — lens.createLens.draw has cyclomatic complexity 99 (threshold 15). Of this number, 90 points are the body's own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createLens.draw (cyclomatic 99) · ×1
  • createLens.draw (cyclomatic 99) renderer/lens.js:457 — createLens.draw has cyclomatic complexity 99 (threshold 15). Of this number, 90 points are the body's own statements and 9 belong to 21 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dancer.dance (cyclomatic 86) · ×1
  • Dancer.dance (cyclomatic 86) renderer/noodles.js:750 — Dancer.dance has cyclomatic complexity 86 (threshold 15). Of this number, 82 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · app.drawFrame (cyclomatic 73) · ×1
  • app.drawFrame (cyclomatic 73) renderer/app.js:2459 — app.drawFrame has cyclomatic complexity 73 (threshold 15). Of this number, 71 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createScenery (cyclomatic 72) · ×1
  • createScenery (cyclomatic 72) renderer/scenery.js:6506 — createScenery has cyclomatic complexity 72 (threshold 15). Most of this is not in the body itself: 1 of the 72 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 6771, 6556, 6557, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · createTakeRender.render (cyclomatic 71) · ×1
  • createTakeRender.render (cyclomatic 71) helpers/take-render.cjs:61 — createTakeRender.render has cyclomatic complexity 71 (threshold 15). Of this number, 46 points are the body's own statements and 25 belong to 23 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · scenery.createScenery.sim (cyclomatic 68) · ×1
  • scenery.createScenery.sim (cyclomatic 68) renderer/scenery.js:6771 — scenery.createScenery.sim has cyclomatic complexity 68 (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 · take-render.createTakeRender.render (cyclomatic 66) · ×1
  • take-render.createTakeRender.render (cyclomatic 66) helpers/take-render.cjs:61 — take-render.createTakeRender.render has cyclomatic complexity 66 (threshold 15). Of this number, 41 points are the body's own statements and 25 belong to 13 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · scenery.pixFor (cyclomatic 66) · ×1
  • scenery.pixFor (cyclomatic 66) renderer/scenery.js:5485 — scenery.pixFor has cyclomatic complexity 66 (threshold 15). Of this number, 64 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.drawBoat (cyclomatic 63) · ×1
  • scenery.drawBoat (cyclomatic 63) renderer/scenery.js:5715 — scenery.drawBoat has cyclomatic complexity 63 (threshold 15). Of this number, 61 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.onKey (cyclomatic 61) · ×1
  • library-panel.createLibraryPanel.onKey (cyclomatic 61) renderer/library-panel.js:1320 — library-panel.createLibraryPanel.onKey has cyclomatic complexity 61 (threshold 15). Of this number, 49 points are the body's own statements and 12 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createLibraryPanel.onKey (cyclomatic 61) · ×1
  • createLibraryPanel.onKey (cyclomatic 61) renderer/library-panel.js:1320 — createLibraryPanel.onKey has cyclomatic complexity 61 (threshold 15). Of this number, 49 points are the body's own statements and 12 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · visuals.createField.draw (cyclomatic 60) · ×1
  • visuals.createField.draw (cyclomatic 60) renderer/visuals.js:249 — visuals.createField.draw has cyclomatic complexity 60 (threshold 15). Of this number, 53 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · melody.pathLine1 (cyclomatic 60) · ×1
  • melody.pathLine1 (cyclomatic 60) renderer/melody.js:64 — melody.pathLine1 has cyclomatic complexity 60 (threshold 15). Of this number, 55 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · createField.draw (cyclomatic 60) · ×1
  • createField.draw (cyclomatic 60) renderer/visuals.js:249 — createField.draw has cyclomatic complexity 60 (threshold 15). Of this number, 53 points are the body's own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createWebApi.list (cyclomatic 60) · ×1
  • createWebApi.list (cyclomatic 60) helpers/spotify.cjs:285 — createWebApi.list has cyclomatic complexity 60 (threshold 15). Of this number, 54 points are the body's own statements and 6 belong to 9 function literals inside it that branch. 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 · spotify.createWebApi.list (cyclomatic 57) · ×1
  • spotify.createWebApi.list (cyclomatic 57) helpers/spotify.cjs:285 — spotify.createWebApi.list has cyclomatic complexity 57 (threshold 15). Of this number, 51 points are the body's own statements and 6 belong to 3 function literals inside it that branch. 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 · swimSharks (cyclomatic 57) · ×1
  • swimSharks (cyclomatic 57) renderer/scenery.js:6079 — swimSharks has cyclomatic complexity 57 (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 · createLibraryPanel (cyclomatic 56) · ×1
  • createLibraryPanel (cyclomatic 56) renderer/library-panel.js:34 — createLibraryPanel has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 6 of the 56 points are its own statements and the rest belongs to 21 function items inside it that branch (a function literal at line 1377, a function literal at line 1363, a function literal at line 1370, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · Dancers.update (cyclomatic 53) · ×1
  • Dancers.update (cyclomatic 53) renderer/noodles.js:450 — Dancers.update has cyclomatic complexity 53 (threshold 15). Of this number, 50 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · codegen.riffNotes (cyclomatic 51) · ×1
  • codegen.riffNotes (cyclomatic 51) renderer/codegen.js:112 — codegen.riffNotes has cyclomatic complexity 51 (threshold 15). Of this number, 50 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · card.createCard.draw (cyclomatic 51) · ×1
  • card.createCard.draw (cyclomatic 51) renderer/card.js:251 — card.createCard.draw has cyclomatic complexity 51 (threshold 15). Of this number, 49 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · player.createPlayerBar.update (cyclomatic 51) · ×1
  • player.createPlayerBar.update (cyclomatic 51) renderer/player.js:243 — player.createPlayerBar.update has cyclomatic complexity 51 (threshold 15). Of this number, 47 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createEventLedger (cyclomatic 51) · ×1
  • createEventLedger (cyclomatic 51) renderer/engine.js:36 — createEventLedger has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 11 of the 51 points are its own statements and the rest belongs to 16 function items inside it that branch (append, restore, startCapture, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · createPlayerBar.update (cyclomatic 51) · ×1
  • createPlayerBar.update (cyclomatic 51) renderer/player.js:243 — createPlayerBar.update has cyclomatic complexity 51 (threshold 15). Of this number, 47 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createCard.draw (cyclomatic 51) · ×1
  • createCard.draw (cyclomatic 51) renderer/card.js:251 — createCard.draw has cyclomatic complexity 51 (threshold 15). Of this number, 49 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · buildLines (cyclomatic 49) · ×1
  • buildLines (cyclomatic 49) renderer/codegen.js:302 — buildLines has cyclomatic complexity 49 (threshold 15). Of this number, 42 points are the body's own statements and 7 belong to 12 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · game.createGame.draw (cyclomatic 47) · ×1
  • game.createGame.draw (cyclomatic 47) renderer/game.js:806 — game.createGame.draw has cyclomatic complexity 47 (threshold 15). Of this number, 34 points are the body's own statements and 13 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · tape.createTape (cyclomatic 47) · ×1
  • tape.createTape (cyclomatic 47) renderer/tape.js:20 — tape.createTape has cyclomatic complexity 47 (threshold 15). Of this number, 43 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.draw (cyclomatic 47) · ×1
  • createGame.draw (cyclomatic 47) renderer/game.js:806 — createGame.draw has cyclomatic complexity 47 (threshold 15). Of this number, 34 points are the body's own statements and 13 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · onmessage (cyclomatic 47) · ×1
  • onmessage (cyclomatic 47) renderer/stems-worker.js:29 — onmessage has cyclomatic complexity 47 (threshold 15). Of this number, 46 points are the body's own statements and 1 belongs to 4 function literals inside it that branch. 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 · dominoes.createDominoes.step (cyclomatic 46) · ×1
  • dominoes.createDominoes.step (cyclomatic 46) renderer/dominoes.js:154 — dominoes.createDominoes.step has cyclomatic complexity 46 (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 · voxcam.createVoxCam.draw (cyclomatic 46) · ×1
  • voxcam.createVoxCam.draw (cyclomatic 46) renderer/voxcam.js:148 — voxcam.createVoxCam.draw has cyclomatic complexity 46 (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 · createDominoes.step (cyclomatic 46) · ×1
  • createDominoes.step (cyclomatic 46) renderer/dominoes.js:154 — createDominoes.step has cyclomatic complexity 46 (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 · createVoxCam.draw (cyclomatic 46) · ×1
  • createVoxCam.draw (cyclomatic 46) renderer/voxcam.js:148 — createVoxCam.draw has cyclomatic complexity 46 (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 · scenery.swimFish (cyclomatic 45) · ×1
  • scenery.swimFish (cyclomatic 45) renderer/scenery.js:5991 — scenery.swimFish has cyclomatic complexity 45 (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 · clock.createClock (cyclomatic 44) · ×1
  • clock.createClock (cyclomatic 44) renderer/clock.js:80 — clock.createClock has cyclomatic complexity 44 (threshold 15). Of this number, 20 points are the body's own statements and 24 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createOrb (cyclomatic 44) · ×1
  • createOrb (cyclomatic 44) renderer/orb.js:472 — createOrb has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 585, (anonymous)::fire, a function literal at line 526, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · game.createGame.model (cyclomatic 42) · ×1
  • game.createGame.model (cyclomatic 42) renderer/game.js:246 — game.createGame.model has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.model (cyclomatic 42) · ×1
  • createGame.model (cyclomatic 42) renderer/game.js:246 — createGame.model has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · advance (cyclomatic 42) · ×1
  • advance (cyclomatic 42) renderer/spaghetti.js:167 — advance has cyclomatic complexity 42 (threshold 15). Of this number, 41 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · placeBass (cyclomatic 42) · ×1
  • placeBass (cyclomatic 42) renderer/melody.js:196 — placeBass has cyclomatic complexity 42 (threshold 15). Of this number, 27 points are the body's own statements and 15 belong to 5 function literals inside it that branch. 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 · orb.createOrb.sim (cyclomatic 41) · ×1
  • orb.createOrb.sim (cyclomatic 41) renderer/orb.js:585 — orb.createOrb.sim has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createEarth.draw (cyclomatic 41) · ×1
  • createEarth.draw (cyclomatic 41) renderer/earth.js:185 — createEarth.draw has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · storm.createStorm.draw (cyclomatic 40) · ×1
  • storm.createStorm.draw (cyclomatic 40) renderer/storm.js:212 — storm.createStorm.draw has cyclomatic complexity 40 (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 · scenery.drawLighthouse (cyclomatic 40) · ×1
  • scenery.drawLighthouse (cyclomatic 40) renderer/scenery.js:5119 — scenery.drawLighthouse has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createStorm.draw (cyclomatic 40) · ×1
  • createStorm.draw (cyclomatic 40) renderer/storm.js:212 — createStorm.draw has cyclomatic complexity 40 (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 · game.createGame.drawShell (cyclomatic 39) · ×1
  • game.createGame.drawShell (cyclomatic 39) renderer/game.js:424 — game.createGame.drawShell has cyclomatic complexity 39 (threshold 15). Of this number, 37 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.spRow (cyclomatic 39) · ×1
  • library-panel.createLibraryPanel.spRow (cyclomatic 39) renderer/library-panel.js:520 — library-panel.createLibraryPanel.spRow has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createLibraryPanel.spRow (cyclomatic 39) · ×1
  • createLibraryPanel.spRow (cyclomatic 39) renderer/library-panel.js:520 — createLibraryPanel.spRow has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.drawShell (cyclomatic 39) · ×1
  • createGame.drawShell (cyclomatic 39) renderer/game.js:424 — createGame.drawShell has cyclomatic complexity 39 (threshold 15). Of this number, 37 points are the body's own statements and 2 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · gameboot.paint (cyclomatic 38) · ×1
  • gameboot.paint (cyclomatic 38) renderer/gameboot.js:84 — gameboot.paint has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dotcam.createDotCam.draw (cyclomatic 38) · ×1
  • dotcam.createDotCam.draw (cyclomatic 38) renderer/dotcam.js:159 — dotcam.createDotCam.draw has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · segcam.createSegcam.draw (cyclomatic 38) · ×1
  • segcam.createSegcam.draw (cyclomatic 38) renderer/segcam.js:152 — segcam.createSegcam.draw has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.spArtSrc (cyclomatic 38) · ×1
  • library-panel.createLibraryPanel.spArtSrc (cyclomatic 38) renderer/library-panel.js:583 — library-panel.createLibraryPanel.spArtSrc has cyclomatic complexity 38 (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 · createLibraryPanel.spArtSrc (cyclomatic 38) · ×1
  • createLibraryPanel.spArtSrc (cyclomatic 38) renderer/library-panel.js:583 — createLibraryPanel.spArtSrc has cyclomatic complexity 38 (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 · layout (cyclomatic 38) · ×1
  • layout (cyclomatic 38) renderer/noodles.js:582 — layout has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body's own statements and 7 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createSegcam.draw (cyclomatic 38) · ×1
  • createSegcam.draw (cyclomatic 38) renderer/segcam.js:152 — createSegcam.draw has cyclomatic complexity 38 (threshold 15). Of this number, 35 points are the body's own statements and 3 belong to 14 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createDotCam.draw (cyclomatic 38) · ×1
  • createDotCam.draw (cyclomatic 38) renderer/dotcam.js:159 — createDotCam.draw has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · game.createGame.drawBottom (cyclomatic 37) · ×1
  • game.createGame.drawBottom (cyclomatic 37) renderer/game.js:684 — game.createGame.drawBottom has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · earth.createEarth.draw (cyclomatic 37) · ×1
  • earth.createEarth.draw (cyclomatic 37) renderer/earth.js:185 — earth.createEarth.draw has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createGame.drawBottom (cyclomatic 37) · ×1
  • createGame.drawBottom (cyclomatic 37) renderer/game.js:684 — createGame.drawBottom has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createPost.draw (cyclomatic 37) · ×1
  • createPost.draw (cyclomatic 37) REDACTED:790 — createPost.draw has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · take-store.checkMeta (cyclomatic 36) · ×1
  • take-store.checkMeta (cyclomatic 36) helpers/take-store.cjs:125 — take-store.checkMeta has cyclomatic complexity 36 (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 · post.createPost.draw (cyclomatic 36) · ×1
  • post.createPost.draw (cyclomatic 36) REDACTED:790 — post.createPost.draw has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library.coverGlyphs (cyclomatic 36) · ×1
  • library.coverGlyphs (cyclomatic 36) renderer/library.js:315 — library.coverGlyphs has cyclomatic complexity 36 (threshold 15). Of this number, 29 points are the body's own statements and 7 belong to one function literal inside it that branches. 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 · game.createGame.drawTop (cyclomatic 35) · ×1
  • game.createGame.drawTop (cyclomatic 35) renderer/game.js:551 — game.createGame.drawTop has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · visuals.createPunchcard.queue (cyclomatic 35) · ×1
  • visuals.createPunchcard.queue (cyclomatic 35) renderer/visuals.js:505 — visuals.createPunchcard.queue has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 35) · ×1
  • (anonymous) (cyclomatic 35) renderer/app.js:3326 — (anonymous) has cyclomatic complexity 35 (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 · lcdTop (cyclomatic 35) · ×1
  • lcdTop (cyclomatic 35) renderer/gameskins.js:182 — lcdTop has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.drawTop (cyclomatic 35) · ×1
  • createGame.drawTop (cyclomatic 35) renderer/game.js:551 — createGame.drawTop has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createPunchcard.queue (cyclomatic 35) · ×1
  • createPunchcard.queue (cyclomatic 35) renderer/visuals.js:505 — createPunchcard.queue has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body's own statements and 1 belongs to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createTape · ×1
  • createTape::song (cyclomatic 35) renderer/tape.js:62 — createTape::song has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · embedded-cover.id3 (cyclomatic 34) · ×1
  • embedded-cover.id3 (cyclomatic 34) renderer/embedded-cover.js:48 — embedded-cover.id3 has cyclomatic complexity 34 (threshold 15). Of this number, 32 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createWebApi.play (cyclomatic 34) · ×1
  • createWebApi.play (cyclomatic 34) helpers/spotify.cjs:342 — createWebApi.play has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · spotify.createWebApi.play (cyclomatic 33) · ×1
  • spotify.createWebApi.play (cyclomatic 33) helpers/spotify.cjs:342 — spotify.createWebApi.play has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dominoes.createDominoes.draw (cyclomatic 33) · ×1
  • dominoes.createDominoes.draw (cyclomatic 33) renderer/dominoes.js:227 — dominoes.createDominoes.draw has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.drawMoon (cyclomatic 33) · ×1
  • scenery.drawMoon (cyclomatic 33) renderer/scenery.js:5047 — scenery.drawMoon has cyclomatic complexity 33 (threshold 15). Of this number, 31 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.stepPond (cyclomatic 33) · ×1
  • scenery.stepPond (cyclomatic 33) renderer/scenery.js:6410 — scenery.stepPond has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · audio-tags.id3Frames (cyclomatic 33) · ×1
  • audio-tags.id3Frames (cyclomatic 33) renderer/audio-tags.js:92 — audio-tags.id3Frames has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createDominoes.draw (cyclomatic 33) · ×1
  • createDominoes.draw (cyclomatic 33) renderer/dominoes.js:227 — createDominoes.draw has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body's own statements and 3 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createBackrooms.draw (cyclomatic 33) · ×1
  • createBackrooms.draw (cyclomatic 33) renderer/backrooms.js:154 — createBackrooms.draw has cyclomatic complexity 33 (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 · engine.timingHypotheses (cyclomatic 32) · ×1
  • engine.timingHypotheses (cyclomatic 32) renderer/engine.js:475 — engine.timingHypotheses has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body's own statements and 9 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · y2k.createY2k.draw (cyclomatic 32) · ×1
  • y2k.createY2k.draw (cyclomatic 32) renderer/y2k.js:371 — y2k.createY2k.draw has cyclomatic complexity 32 (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 · tape.compactFromExact (cyclomatic 32) · ×1
  • tape.compactFromExact (cyclomatic 32) renderer/tape.js:399 — tape.compactFromExact has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 12 of the 32 points are its own statements and the rest belongs to 3 function items inside it that branch (compactLine, wrap, a function literal at line 468). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · audio-tags.mp4 (cyclomatic 32) · ×1
  • audio-tags.mp4 (cyclomatic 32) renderer/audio-tags.js:216 — audio-tags.mp4 has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · danceTop (cyclomatic 32) · ×1
  • danceTop (cyclomatic 32) renderer/gameskins.js:584 — danceTop has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createPunchcard.draw (cyclomatic 32) · ×1
  • createPunchcard.draw (cyclomatic 32) renderer/visuals.js:607 — createPunchcard.draw has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createY2k.draw (cyclomatic 32) · ×1
  • createY2k.draw (cyclomatic 32) renderer/y2k.js:371 — createY2k.draw has cyclomatic complexity 32 (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 · visuals.createPunchcard.draw (cyclomatic 31) · ×1
  • visuals.createPunchcard.draw (cyclomatic 31) renderer/visuals.js:607 — visuals.createPunchcard.draw has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · now-coding.html.renderField (cyclomatic 30) · ×1
  • now-coding.html.renderField (cyclomatic 30) prototype/now-coding.html:1281 — now-coding.html.renderField has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · spectro.createSpectro.draw (cyclomatic 30) · ×1
  • spectro.createSpectro.draw (cyclomatic 30) renderer/spectro.js:344 — spectro.createSpectro.draw has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · backrooms.createBackrooms.draw (cyclomatic 30) · ×1
  • backrooms.createBackrooms.draw (cyclomatic 30) renderer/backrooms.js:154 — backrooms.createBackrooms.draw has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rebuild.program (cyclomatic 30) · ×1
  • rebuild.program (cyclomatic 30) renderer/rebuild.js:407 — rebuild.program has cyclomatic complexity 30 (threshold 15). Of this number, 15 points are the body's own statements and 15 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createSpectro.draw (cyclomatic 30) · ×1
  • createSpectro.draw (cyclomatic 30) renderer/spectro.js:344 — createSpectro.draw has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · codeview.createCodeView.plan (cyclomatic 29) · ×1
  • codeview.createCodeView.plan (cyclomatic 29) renderer/codeview.js:185 — codeview.createCodeView.plan has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · orb.createOrb.draw (cyclomatic 29) · ×1
  • orb.createOrb.draw (cyclomatic 29) renderer/orb.js:678 — orb.createOrb.draw has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · vfdTop (cyclomatic 29) · ×1
  • vfdTop (cyclomatic 29) renderer/gameskins.js:840 — vfdTop has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createOrb.draw (cyclomatic 29) · ×1
  • createOrb.draw (cyclomatic 29) renderer/orb.js:678 — createOrb.draw has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createCodeView.plan (cyclomatic 29) · ×1
  • createCodeView.plan (cyclomatic 29) renderer/codeview.js:185 — createCodeView.plan has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · stepParts (cyclomatic 29) · ×1
  • stepParts (cyclomatic 29) renderer/codegen.js:10 — stepParts has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body's own statements and 8 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library.coverSize (cyclomatic 28) · ×1
  • library.coverSize (cyclomatic 28) helpers/library.cjs:167 — library.coverSize has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · now-coding.html.drumParts (cyclomatic 28) · ×1
  • now-coding.html.drumParts (cyclomatic 28) prototype/now-coding.html:1032 — now-coding.html.drumParts has cyclomatic complexity 28 (threshold 15). Of this number, 22 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · codeview.createCodeView.step (cyclomatic 28) · ×1
  • codeview.createCodeView.step (cyclomatic 28) renderer/codeview.js:333 — codeview.createCodeView.step has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · codeview.createCodeView.highlight (cyclomatic 28) · ×1
  • codeview.createCodeView.highlight (cyclomatic 28) renderer/codeview.js:421 — codeview.createCodeView.highlight has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body's own statements and 3 belong to 2 function items inside it that branch. 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 · visuals.createWebcam.applyFx (cyclomatic 28) · ×1
  • visuals.createWebcam.applyFx (cyclomatic 28) renderer/visuals.js:719 — visuals.createWebcam.applyFx has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · Noodles.world (cyclomatic 28) · ×1
  • Noodles.world (cyclomatic 28) renderer/noodles.js:286 — Noodles.world has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.feedKoi (cyclomatic 28) · ×1
  • scenery.feedKoi (cyclomatic 28) renderer/scenery.js:6330 — scenery.feedKoi has cyclomatic complexity 28 (threshold 15). Of this number, 20 points are the body's own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.activate (cyclomatic 28) · ×1
  • library-panel.createLibraryPanel.activate (cyclomatic 28) renderer/library-panel.js:1181 — library-panel.createLibraryPanel.activate has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · app.loadSettings (cyclomatic 28) · ×1
  • app.loadSettings (cyclomatic 28) renderer/app.js:249 — app.loadSettings has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createLibraryPanel.activate (cyclomatic 28) · ×1
  • createLibraryPanel.activate (cyclomatic 28) renderer/library-panel.js:1181 — createLibraryPanel.activate has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · osTop (cyclomatic 28) · ×1
  • osTop (cyclomatic 28) renderer/gameskins.js:317 — osTop has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createWebcam.applyFx (cyclomatic 28) · ×1
  • createWebcam.applyFx (cyclomatic 28) renderer/visuals.js:719 — createWebcam.applyFx has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · createCodeView.step (cyclomatic 28) · ×1
  • createCodeView.step (cyclomatic 28) renderer/codeview.js:333 — createCodeView.step has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body's own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createCodeView.highlight (cyclomatic 28) · ×1
  • createCodeView.highlight (cyclomatic 28) renderer/codeview.js:421 — createCodeView.highlight has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body's own statements and 3 belong to 3 function items inside it that branch. 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 · scenery.drawGardenKoi · ×1
  • scenery.drawGardenKoi::spot (cyclomatic 27) renderer/scenery.js:5005 — scenery.drawGardenKoi::spot has cyclomatic complexity 27 (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. This shape REPEATS in the file: one other method here (scenery.drawGardenKoi) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · createPlayerBar (cyclomatic 27) · ×1
  • createPlayerBar (cyclomatic 27) renderer/player.js:123 — createPlayerBar has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 458, 131, 145, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · update.check (cyclomatic 26) · ×1
  • update.check (cyclomatic 26) update.js:67 — update.check has cyclomatic complexity 26 (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 · gameskins.codeRows (cyclomatic 26) · ×1
  • gameskins.codeRows (cyclomatic 26) renderer/gameskins.js:492 — gameskins.codeRows has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 6 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 501). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · fx.createTakeover.draw (cyclomatic 26) · ×1
  • fx.createTakeover.draw (cyclomatic 26) renderer/fx.js:313 — fx.createTakeover.draw 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 · Noodles.touch (cyclomatic 26) · ×1
  • Noodles.touch (cyclomatic 26) renderer/noodles.js:232 — Noodles.touch 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 · library.spotifyRows (cyclomatic 26) · ×1
  • library.spotifyRows (cyclomatic 26) renderer/library.js:173 — library.spotifyRows 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 · library-panel.createLibraryPanel.update (cyclomatic 26) · ×1
  • library-panel.createLibraryPanel.update (cyclomatic 26) renderer/library-panel.js:1024 — library-panel.createLibraryPanel.update has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createLibraryPanel.update (cyclomatic 26) · ×1
  • createLibraryPanel.update (cyclomatic 26) renderer/library-panel.js:1024 — createLibraryPanel.update has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · highwayTop (cyclomatic 26) · ×1
  • highwayTop (cyclomatic 26) renderer/gameskins.js:704 — highwayTop 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 · createLibrary.scanIn (cyclomatic 26) · ×1
  • createLibrary.scanIn (cyclomatic 26) helpers/library.cjs:317 — createLibrary.scanIn has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 326, (anonymous)::fail, a function literal at line 325, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · createTakeover.draw (cyclomatic 26) · ×1
  • createTakeover.draw (cyclomatic 26) renderer/fx.js:313 — createTakeover.draw 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 · library.createLibrary.scanIn (cyclomatic 25) · ×1
  • library.createLibrary.scanIn (cyclomatic 25) helpers/library.cjs:317 — library.createLibrary.scanIn has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 326, 323, 325). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · spotify.createWebApi.control (cyclomatic 25) · ×1
  • spotify.createWebApi.control (cyclomatic 25) helpers/spotify.cjs:398 — spotify.createWebApi.control has cyclomatic complexity 25 (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 · scenery.drawGardenKoi (cyclomatic 25) · ×1
  • scenery.drawGardenKoi (cyclomatic 25) renderer/scenery.js:5002 — scenery.drawGardenKoi has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (scenery.drawGardenKoi::spot) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · firstrun.advanceHints (cyclomatic 25) · ×1
  • firstrun.advanceHints (cyclomatic 25) renderer/firstrun.js:19 — firstrun.advanceHints has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · app.changeWindowMode (cyclomatic 25) · ×1
  • app.changeWindowMode (cyclomatic 25) renderer/app.js:1747 — app.changeWindowMode has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · exportSong (cyclomatic 25) · ×1
  • exportSong (cyclomatic 25) renderer/app.js:1597 — exportSong has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body's own statements and 1 belongs to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createWebApi.control (cyclomatic 25) · ×1
  • createWebApi.control (cyclomatic 25) helpers/spotify.cjs:398 — createWebApi.control has cyclomatic complexity 25 (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 · glass.createGlass.drawCode (cyclomatic 24) · ×1
  • glass.createGlass.drawCode (cyclomatic 24) renderer/glass.js:272 — glass.createGlass.drawCode has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · worldlooks.blueNoise (cyclomatic 24) · ×1
  • worldlooks.blueNoise (cyclomatic 24) renderer/worldlooks.js:508 — worldlooks.blueNoise has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (rows, tightest, loosest, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · scenery.drawFlame (cyclomatic 24) · ×1
  • scenery.drawFlame (cyclomatic 24) renderer/scenery.js:5309 — scenery.drawFlame has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.stepSea (cyclomatic 24) · ×1
  • scenery.stepSea (cyclomatic 24) renderer/scenery.js:5953 — scenery.stepSea has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.searchSpotify (cyclomatic 24) · ×1
  • library-panel.createLibraryPanel.searchSpotify (cyclomatic 24) renderer/library-panel.js:364 — library-panel.createLibraryPanel.searchSpotify 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 · library-panel.createLibraryPanel.paintBig (cyclomatic 24) · ×1
  • library-panel.createLibraryPanel.paintBig (cyclomatic 24) renderer/library-panel.js:599 — library-panel.createLibraryPanel.paintBig has cyclomatic complexity 24 (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 · nowPlaying (cyclomatic 24) · ×1
  • nowPlaying (cyclomatic 24) renderer/app.js:894 — nowPlaying has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createLibraryPanel.searchSpotify (cyclomatic 24) · ×1
  • createLibraryPanel.searchSpotify (cyclomatic 24) renderer/library-panel.js:364 — createLibraryPanel.searchSpotify 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 · createLibraryPanel.paintBig (cyclomatic 24) · ×1
  • createLibraryPanel.paintBig (cyclomatic 24) renderer/library-panel.js:599 — createLibraryPanel.paintBig has cyclomatic complexity 24 (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 · readBass (cyclomatic 24) · ×1
  • readBass (cyclomatic 24) renderer/rebuild.js:266 — readBass has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body's own statements and 11 belong to 16 function items inside it that branch. 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 · createGlass.drawCode (cyclomatic 24) · ×1
  • createGlass.drawCode (cyclomatic 24) renderer/glass.js:272 — createGlass.drawCode has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · game.createGame.idle (cyclomatic 23) · ×1
  • game.createGame.idle (cyclomatic 23) renderer/game.js:859 — game.createGame.idle has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · song-memory.createSongMemory.put (cyclomatic 23) · ×1
  • song-memory.createSongMemory.put (cyclomatic 23) renderer/song-memory.js:41 — song-memory.createSongMemory.put has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rebuild.render (cyclomatic 23) · ×1
  • rebuild.render (cyclomatic 23) renderer/rebuild.js:384 — rebuild.render has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.idle (cyclomatic 23) · ×1
  • createGame.idle (cyclomatic 23) renderer/game.js:859 — createGame.idle has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wraps (cyclomatic 23) · ×1
  • wraps (cyclomatic 23) renderer/codeview.js:37 — wraps 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 · createCuts (cyclomatic 23) · ×1
  • createCuts (cyclomatic 23) renderer/cuts.js:219 — createCuts has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 344, 370, 367, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · createSongMemory.put (cyclomatic 23) · ×1
  • createSongMemory.put (cyclomatic 23) renderer/song-memory.js:41 — createSongMemory.put has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 7 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · visuals.glField (cyclomatic 22) · ×1
  • visuals.glField (cyclomatic 22) renderer/visuals.js:56 — visuals.glField has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · spaghetti.createSpaghetti.encode (cyclomatic 22) · ×1
  • spaghetti.createSpaghetti.encode (cyclomatic 22) renderer/spaghetti.js:694 — spaghetti.createSpaghetti.encode has cyclomatic complexity 22 (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 · player.createPlayerBar.paintSpotify (cyclomatic 22) · ×1
  • player.createPlayerBar.paintSpotify (cyclomatic 22) renderer/player.js:359 — player.createPlayerBar.paintSpotify has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · cover-palette.extras (cyclomatic 22) · ×1
  • cover-palette.extras (cyclomatic 22) renderer/cover-palette.js:167 — cover-palette.extras has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body's own statements and 9 belong to 4 function items inside it that branch. 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 · library-panel.createLibraryPanel.spHead (cyclomatic 22) · ×1
  • library-panel.createLibraryPanel.spHead (cyclomatic 22) renderer/library-panel.js:422 — library-panel.createLibraryPanel.spHead has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-source.scanHandle · ×1
  • library-source.scanHandle::walk (cyclomatic 22) renderer/library-source.js:71 — library-source.scanHandle::walk has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · app.eng.on.drop (cyclomatic 22) · ×1
  • app.eng.on.drop (cyclomatic 22) renderer/app.js:1012 — app.eng.on.drop has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rebuild.bassPitch (cyclomatic 22) · ×1
  • rebuild.bassPitch (cyclomatic 22) renderer/rebuild.js:232 — rebuild.bassPitch has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · createLibraryPanel.spHead (cyclomatic 22) · ×1
  • createLibraryPanel.spHead (cyclomatic 22) renderer/library-panel.js:422 — createLibraryPanel.spHead has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createSpaghetti.encode (cyclomatic 22) · ×1
  • createSpaghetti.encode (cyclomatic 22) renderer/spaghetti.js:694 — createSpaghetti.encode has cyclomatic complexity 22 (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 · createPlayerBar.paintSpotify (cyclomatic 22) · ×1
  • createPlayerBar.paintSpotify (cyclomatic 22) renderer/player.js:359 — createPlayerBar.paintSpotify has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · youtube.parseXml (cyclomatic 21) · ×1
  • youtube.parseXml (cyclomatic 21) helpers/youtube.cjs:119 — youtube.parseXml has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · visuals.createPunchcard.sim (cyclomatic 21) · ×1
  • visuals.createPunchcard.sim (cyclomatic 21) renderer/visuals.js:547 — visuals.createPunchcard.sim has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · cuts.createCuts.sim (cyclomatic 21) · ×1
  • cuts.createCuts.sim (cyclomatic 21) renderer/cuts.js:344 — cuts.createCuts.sim has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body's own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · palette.createPalette (cyclomatic 21) · ×1
  • palette.createPalette (cyclomatic 21) renderer/palette.js:47 — palette.createPalette has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 118, 103, 126). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · library-core.readScenes (cyclomatic 21) · ×1
  • library-core.readScenes (cyclomatic 21) renderer/library-core.js:82 — library-core.readScenes has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body's own statements and 7 belong to 2 function items inside it that branch. 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 · createPunchcard (cyclomatic 21) · ×1
  • createPunchcard (cyclomatic 21) renderer/visuals.js:476 — createPunchcard has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 547, 580, 478). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · createSpectro.read (cyclomatic 21) · ×1
  • createSpectro.read (cyclomatic 21) renderer/spectro.js:228 — createSpectro.read has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createLanes.draw (cyclomatic 21) · ×1
  • createLanes.draw (cyclomatic 21) renderer/lanes.js:111 — createLanes.draw has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · now-coding.html.wanted (cyclomatic 20) · ×1
  • now-coding.html.wanted (cyclomatic 20) prototype/now-coding.html:1083 — now-coding.html.wanted has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · codegen.bassParts (cyclomatic 20) · ×1
  • codegen.bassParts (cyclomatic 20) renderer/codegen.js:189 — codegen.bassParts has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body's own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · codeview.createCodeView.update (cyclomatic 20) · ×1
  • codeview.createCodeView.update (cyclomatic 20) renderer/codeview.js:311 — codeview.createCodeView.update has cyclomatic complexity 20 (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 · game.createPageTurner.<returned closure> (cyclomatic 20) · ×1
  • game.createPageTurner.<returned closure> (cyclomatic 20) renderer/game.js:207 — game.createPageTurner.<returned closure> has cyclomatic complexity 20 (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 · Pasta.card (cyclomatic 20) · ×1
  • Pasta.card (cyclomatic 20) renderer/spaghetti.js:332 — Pasta.card has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.paintArt (cyclomatic 20) · ×1
  • library-panel.createLibraryPanel.paintArt (cyclomatic 20) renderer/library-panel.js:165 — library-panel.createLibraryPanel.paintArt has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createLibraryPanel.paintArt (cyclomatic 20) · ×1
  • createLibraryPanel.paintArt (cyclomatic 20) renderer/library-panel.js:165 — createLibraryPanel.paintArt has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createPageTurner (cyclomatic 20) · ×1
  • createPageTurner (cyclomatic 20) renderer/game.js:204 — createPageTurner has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 207, 211). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · createCodeView.update (cyclomatic 20) · ×1
  • createCodeView.update (cyclomatic 20) renderer/codeview.js:311 — createCodeView.update has cyclomatic complexity 20 (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 · tuneFor (cyclomatic 20) · ×1
  • tuneFor (cyclomatic 20) renderer/tune.js:44 — tuneFor has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. 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 · spotify.createWebApi.playback (cyclomatic 19) · ×1
  • spotify.createWebApi.playback (cyclomatic 19) helpers/spotify.cjs:381 — spotify.createWebApi.playback has cyclomatic complexity 19 (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 · gameboot.paintIdle (cyclomatic 19) · ×1
  • gameboot.paintIdle (cyclomatic 19) renderer/gameboot.js:160 — gameboot.paintIdle has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · gestures.read (cyclomatic 19) · ×1
  • gestures.read (cyclomatic 19) renderer/gestures.js:25 — gestures.read has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to one function literal inside it that branches. 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 · scenery.stirSea (cyclomatic 19) · ×1
  • scenery.stirSea (cyclomatic 19) renderer/scenery.js:6201 — scenery.stirSea has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · lanes.createLanes.draw (cyclomatic 19) · ×1
  • lanes.createLanes.draw (cyclomatic 19) renderer/lanes.js:111 — lanes.createLanes.draw has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · cuts.createCuts.draw (cyclomatic 19) · ×1
  • cuts.createCuts.draw (cyclomatic 19) renderer/cuts.js:384 — cuts.createCuts.draw has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · demo.makeDemo.schedule (cyclomatic 19) · ×1
  • demo.makeDemo.schedule (cyclomatic 19) renderer/demo.js:86 — demo.makeDemo.schedule 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 · gl-pool.createGlPool (cyclomatic 19) · ×1
  • gl-pool.createGlPool (cyclomatic 19) renderer/gl-pool.js:21 — gl-pool.createGlPool has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body's own statements and 7 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.findKey (cyclomatic 19) · ×1
  • library-panel.createLibraryPanel.findKey (cyclomatic 19) renderer/library-panel.js:1255 — library-panel.createLibraryPanel.findKey has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body's own statements and 7 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · app.renderGrid (cyclomatic 19) · ×1
  • app.renderGrid (cyclomatic 19) renderer/app.js:1847 — app.renderGrid 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 · app.updateHints (cyclomatic 19) · ×1
  • app.updateHints (cyclomatic 19) renderer/app.js:2944 — app.updateHints has cyclomatic complexity 19 (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 · createLibraryPanel.findKey (cyclomatic 19) · ×1
  • createLibraryPanel.findKey (cyclomatic 19) renderer/library-panel.js:1255 — createLibraryPanel.findKey has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body's own statements and 7 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createLibraryPanel.finishInput (cyclomatic 19) · ×1
  • createLibraryPanel.finishInput (cyclomatic 19) renderer/library-panel.js:1274 — createLibraryPanel.finishInput has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · failure (cyclomatic 19) · ×1
  • failure (cyclomatic 19) helpers/spotify.cjs:251 — failure has cyclomatic complexity 19 (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 · createWebApi.playback (cyclomatic 19) · ×1
  • createWebApi.playback (cyclomatic 19) helpers/spotify.cjs:381 — createWebApi.playback has cyclomatic complexity 19 (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 · createChrome (cyclomatic 19) · ×1
  • createChrome (cyclomatic 19) renderer/chrome.js:188 — createChrome has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 337, 287, 288). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · createCuts.draw (cyclomatic 19) · ×1
  • createCuts.draw (cyclomatic 19) renderer/cuts.js:384 — createCuts.draw has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · makeDemo.schedule (cyclomatic 19) · ×1
  • makeDemo.schedule (cyclomatic 19) renderer/demo.js:86 — makeDemo.schedule 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 · gameskins.highwayBottom (cyclomatic 18) · ×1
  • gameskins.highwayBottom (cyclomatic 18) renderer/gameskins.js:784 — gameskins.highwayBottom has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 796). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · game.createGame.drawStance (cyclomatic 18) · ×1
  • game.createGame.drawStance (cyclomatic 18) renderer/game.js:496 — game.createGame.drawStance has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · visuals.createWebcam.findEyes (cyclomatic 18) · ×1
  • visuals.createWebcam.findEyes (cyclomatic 18) renderer/visuals.js:800 — visuals.createWebcam.findEyes has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · glass.createGlass.runs · ×1
  • glass.createGlass.runs::walk (cyclomatic 18) renderer/glass.js:346 — glass.createGlass.runs::walk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · portal.createSwipes.update (cyclomatic 18) · ×1
  • portal.createSwipes.update (cyclomatic 18) renderer/portal.js:163 — portal.createSwipes.update has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · gestures.createGestures.update (cyclomatic 18) · ×1
  • gestures.createGestures.update (cyclomatic 18) renderer/gestures.js:50 — gestures.createGestures.update has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, 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 · chrome.createChrome.sim (cyclomatic 18) · ×1
  • chrome.createChrome.sim (cyclomatic 18) renderer/chrome.js:337 — chrome.createChrome.sim has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Noodles.step (cyclomatic 18) · ×1
  • Noodles.step (cyclomatic 18) renderer/noodles.js:146 — Noodles.step has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · spectro.createSpectro.read (cyclomatic 18) · ×1
  • spectro.createSpectro.read (cyclomatic 18) renderer/spectro.js:228 — spectro.createSpectro.read has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · spectro.createSpectro.drawMarks (cyclomatic 18) · ×1
  • spectro.createSpectro.drawMarks (cyclomatic 18) renderer/spectro.js:263 — spectro.createSpectro.drawMarks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wait.createWait.draw (cyclomatic 18) · ×1
  • wait.createWait.draw (cyclomatic 18) renderer/wait.js:123 — wait.createWait.draw has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · cover-palette.cluster (cyclomatic 18) · ×1
  • cover-palette.cluster (cyclomatic 18) renderer/cover-palette.js:102 — cover-palette.cluster has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, 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 · audio-tags.mp3Length (cyclomatic 18) · ×1
  • audio-tags.mp3Length (cyclomatic 18) renderer/audio-tags.js:160 — audio-tags.mp3Length has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · library.groupAlbums (cyclomatic 18) · ×1
  • library.groupAlbums (cyclomatic 18) renderer/library.js:69 — library.groupAlbums has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 77, a function literal at line 76, sortKey, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · library-panel.createLibraryPanel.finishInput (cyclomatic 18) · ×1
  • library-panel.createLibraryPanel.finishInput (cyclomatic 18) renderer/library-panel.js:1274 — library-panel.createLibraryPanel.finishInput has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · app.aRound (cyclomatic 18) · ×1
  • app.aRound (cyclomatic 18) renderer/app.js:2751 — app.aRound has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · app.paletteEntries (cyclomatic 18) · ×1
  • app.paletteEntries (cyclomatic 18) renderer/app.js:2851 — app.paletteEntries has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 2872, 2879, 2918, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · Ear.process (cyclomatic 18) · ×1
  • Ear.process (cyclomatic 18) renderer/ear-worklet.js:48 — Ear.process has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · rebuild.findGrid (cyclomatic 18) · ×1
  • rebuild.findGrid (cyclomatic 18) renderer/rebuild.js:121 — rebuild.findGrid has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body's own statements and 7 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · rebuild.readDrums (cyclomatic 18) · ×1
  • rebuild.readDrums (cyclomatic 18) renderer/rebuild.js:176 — rebuild.readDrums has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 185, 203, 214, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · playQueue (cyclomatic 18) · ×1
  • playQueue (cyclomatic 18) renderer/app.js:578 — playQueue has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · loadLooks (cyclomatic 18) · ×1
  • loadLooks (cyclomatic 18) renderer/app.js:1283 — loadLooks has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createSwipes.update (cyclomatic 18) · ×1
  • createSwipes.update (cyclomatic 18) renderer/portal.js:163 — createSwipes.update has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.drawStance (cyclomatic 18) · ×1
  • createGame.drawStance (cyclomatic 18) renderer/game.js:496 — createGame.drawStance has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGame.step (cyclomatic 18) · ×1
  • createGame.step (cyclomatic 18) renderer/game.js:789 — createGame.step has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createWebcam.findEyes (cyclomatic 18) · ×1
  • createWebcam.findEyes (cyclomatic 18) renderer/visuals.js:800 — createWebcam.findEyes has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · createSpectro.drawMarks (cyclomatic 18) · ×1
  • createSpectro.drawMarks (cyclomatic 18) renderer/spectro.js:263 — createSpectro.drawMarks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGlass.runs · ×1
  • createGlass.runs::walk (cyclomatic 18) renderer/glass.js:346 — createGlass.runs::walk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createCuts.partAt (cyclomatic 18) · ×1
  • createCuts.partAt (cyclomatic 18) renderer/cuts.js:262 — createCuts.partAt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · checkEnd (cyclomatic 18) · ×1
  • checkEnd (cyclomatic 18) helpers/take-store.cjs:151 — checkEnd has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 157, plain, a function literal at line 161, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · createWait.draw (cyclomatic 18) · ×1
  • createWait.draw (cyclomatic 18) renderer/wait.js:123 — createWait.draw has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · onmessage (cyclomatic 18) · ×1
  • onmessage (cyclomatic 18) renderer/track-worker.js:94 — onmessage has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · createGestures.update (cyclomatic 18) · ×1
  • createGestures.update (cyclomatic 18) renderer/gestures.js:50 — createGestures.update has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to 5 function literals inside it that branch. 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 · library.walk (cyclomatic 17) · ×1
  • library.walk (cyclomatic 17) helpers/library.cjs:72 — library.walk has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · now-coding.html.makeDemo.schedule (cyclomatic 17) · ×1
  • now-coding.html.makeDemo.schedule (cyclomatic 17) prototype/now-coding.html:417 — now-coding.html.makeDemo.schedule 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 · codegen.strudelProgram (cyclomatic 17) · ×1
  • codegen.strudelProgram (cyclomatic 17) renderer/codegen.js:379 — codegen.strudelProgram 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 · codeview.createCodeView.render (cyclomatic 17) · ×1
  • codeview.createCodeView.render (cyclomatic 17) renderer/codeview.js:244 — codeview.createCodeView.render has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (rawPiece, piece, a function literal at line 270). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · gameskins.lcdBottom (cyclomatic 17) · ×1
  • gameskins.lcdBottom (cyclomatic 17) renderer/gameskins.js:280 — gameskins.lcdBottom has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 296). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · game.createGame.step (cyclomatic 17) · ×1
  • game.createGame.step (cyclomatic 17) renderer/game.js:789 — game.createGame.step 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 · glass.createGlass.draw (cyclomatic 17) · ×1
  • glass.createGlass.draw (cyclomatic 17) renderer/glass.js:400 — glass.createGlass.draw 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 · collage.layout (cyclomatic 17) · ×1
  • collage.layout (cyclomatic 17) renderer/collage.js:88 — collage.layout has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 105, 110). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · spectro.createSpectro.makeColumn (cyclomatic 17) · ×1
  • spectro.createSpectro.makeColumn (cyclomatic 17) renderer/spectro.js:190 — spectro.createSpectro.makeColumn has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · scenery.drawToast (cyclomatic 17) · ×1
  • scenery.drawToast (cyclomatic 17) renderer/scenery.js:5436 — scenery.drawToast has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scenery.createScenery.build (cyclomatic 17) · ×1
  • scenery.createScenery.build (cyclomatic 17) renderer/scenery.js:6561 — scenery.createScenery.build has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (program::ready, program::done, program::settled, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · share-card.drawShareCard (cyclomatic 17) · ×1
  • share-card.drawShareCard (cyclomatic 17) renderer/share-card.js:28 — share-card.drawShareCard has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to 3 function items inside it that branch. 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 · take-replay.replay (cyclomatic 17) · ×1
  • take-replay.replay (cyclomatic 17) renderer/take-replay.js:83 — take-replay.replay has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (advance, a function literal at line 132). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · rebuild.readVoice (cyclomatic 17) · ×1
  • rebuild.readVoice (cyclomatic 17) renderer/rebuild.js:303 — rebuild.readVoice has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createScenery.build (cyclomatic 17) · ×1
  • createScenery.build (cyclomatic 17) renderer/scenery.js:6561 — createScenery.build has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 7 function items inside it that branch (program::ready, program::done, program::settled, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · tourEarth (cyclomatic 17) · ×1
  • tourEarth (cyclomatic 17) renderer/app.js:1157 — tourEarth has cyclomatic complexity 17 (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 · createPlayerBar.toggleMode (cyclomatic 17) · ×1
  • createPlayerBar.toggleMode (cyclomatic 17) renderer/player.js:325 — createPlayerBar.toggleMode has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createCodeView.render (cyclomatic 17) · ×1
  • createCodeView.render (cyclomatic 17) renderer/codeview.js:244 — createCodeView.render has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (rawPiece, piece, a function literal at line 270, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · createSpectro.makeColumn (cyclomatic 17) · ×1
  • createSpectro.makeColumn (cyclomatic 17) renderer/spectro.js:190 — createSpectro.makeColumn has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createGlass.draw (cyclomatic 17) · ×1
  • createGlass.draw (cyclomatic 17) renderer/glass.js:400 — createGlass.draw 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 · createFire (cyclomatic 17) · ×1
  • createFire (cyclomatic 17) renderer/fire.js:39 — createFire has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 52). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · createTracker.open (cyclomatic 17) · ×1
  • createTracker.open (cyclomatic 17) renderer/tracking.js:31 — createTracker.open has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function items inside it that branch (onmessage, onerror, a function literal at line 36, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · mac-update.swapScript (cyclomatic 16) · ×1
  • mac-update.swapScript (cyclomatic 16) helpers/mac-update.cjs:130 — mac-update.swapScript has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to one function item inside it that branches. 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 · spotify.parseLink (cyclomatic 16) · ×1
  • spotify.parseLink (cyclomatic 16) helpers/spotify.cjs:433 — spotify.parseLink 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 · codegen.calm (cyclomatic 16) · ×1
  • codegen.calm (cyclomatic 16) renderer/codegen.js:273 — codegen.calm 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 · gameskins.danceBottom (cyclomatic 16) · ×1
  • gameskins.danceBottom (cyclomatic 16) renderer/gameskins.js:659 — gameskins.danceBottom 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 · tracking.createTracker.update (cyclomatic 16) · ×1
  • tracking.createTracker.update (cyclomatic 16) renderer/tracking.js:86 — tracking.createTracker.update has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body's own statements and 5 belong to 3 function literals inside it that branch. 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. This is NOT this file's highest cyclomatic complexity: tracking.createTracker.open (cyclomatic 17) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · portal.createPortal (cyclomatic 16) · ×1
  • portal.createPortal (cyclomatic 16) renderer/portal.js:477 — portal.createPortal 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 · rings.createWheel.draw (cyclomatic 16) · ×1
  • rings.createWheel.draw (cyclomatic 16) renderer/rings.js:136 — rings.createWheel.draw has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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 · Dancers.pick (cyclomatic 16) · ×1
  • Dancers.pick (cyclomatic 16) renderer/noodles.js:516 — Dancers.pick 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. This is NOT this file's highest cyclomatic complexity: Noodles.box (cyclomatic 17) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Pasta.retire (cyclomatic 16) · ×1
  • Pasta.retire (cyclomatic 16) renderer/spaghetti.js:283 — Pasta.retire has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · scenery.drawTrout (cyclomatic 16) · ×1
  • scenery.drawTrout (cyclomatic 16) renderer/scenery.js:5277 — scenery.drawTrout 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 · scenery.pixAtlas (cyclomatic 16) · ×1
  • scenery.pixAtlas (cyclomatic 16) renderer/scenery.js:5452 — scenery.pixAtlas has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · cuts.createCuts.partAt (cyclomatic 16) · ×1
  • cuts.createCuts.partAt (cyclomatic 16) renderer/cuts.js:262 — cuts.createCuts.partAt 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 · tape.barEvents (cyclomatic 16) · ×1
  • tape.barEvents (cyclomatic 16) renderer/tape.js:209 — tape.barEvents has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · player.createPlayerBar.toggleMode (cyclomatic 16) · ×1
  • player.createPlayerBar.toggleMode (cyclomatic 16) renderer/player.js:325 — player.createPlayerBar.toggleMode has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · app.takeBegin (cyclomatic 16) · ×1
  • app.takeBegin (cyclomatic 16) renderer/app.js:2195 — app.takeBegin 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 · app.playingNow (cyclomatic 16) · ×1
  • app.playingNow (cyclomatic 16) renderer/app.js:3106 — app.playingNow 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 · startRecording (cyclomatic 16) · ×1
  • startRecording (cyclomatic 16) renderer/app.js:2015 — startRecording has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 9 function items inside it that branch (ondataavailable, a function literal at line 2047, (anonymous)::onstop, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · askPlayers (cyclomatic 16) · ×1
  • askPlayers (cyclomatic 16) main.js:353 — askPlayers 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 · createPost.uniforms (cyclomatic 16) · ×1
  • createPost.uniforms (cyclomatic 16) REDACTED:681 — createPost.uniforms has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rebuild (cyclomatic 16) · ×1
  • rebuild (cyclomatic 16) renderer/rebuild.js:363 — rebuild has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · placeLead (cyclomatic 16) · ×1
  • placeLead (cyclomatic 16) renderer/melody.js:168 — placeLead has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createWheel.draw (cyclomatic 16) · ×1
  • createWheel.draw (cyclomatic 16) renderer/rings.js:136 — createWheel.draw has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createTracker.update (cyclomatic 16) · ×1
  • createTracker.update (cyclomatic 16) renderer/tracking.js:86 — createTracker.update has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D12 · Dependency Hygiene · Deprecated · ×1
  • Deprecated: mp4-muxer REDACTED:23 — mp4-muxer 5.2.2, declared in REDACTED, is marked deprecated by its publisher: "This library is superseded by Mediabunny. Please migrate to it.". Replace it with the package or version that message names, or record why this one must stay.
D2 · Cognitive Complexity · engine.createEngine (cognitive 1354) · ×1
  • engine.createEngine (cognitive 1354) renderer/engine.js:546 — engine.createEngine has cognitive complexity 1354 (threshold 15). Drivers by points: if/else 423 (680 pts), boolean chains 345, loops 153 (240 pts), ternaries 117 (186 pts) (nesting depth added 413). To reduce it, split the body into named stages: move each independent 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 shape REPEATS in the file: one other method here (engine.createEngine::fit) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · createScenery.draw (cognitive 280) · ×1
  • createScenery.draw (cognitive 280) renderer/scenery.js:6912 — createScenery.draw has cognitive complexity 280 (threshold 15). Drivers by points: if/else 82 (117 pts), ternaries 56 (74 pts), boolean chains 60, loops 6 (14 pts), other 9, error handling 3 (6 pts) (nesting depth added 64). Of this number, 267 points are the body's own statements and 13 belong to 12 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.createScenery.draw (cognitive 252) · ×1
  • scenery.createScenery.draw (cognitive 252) renderer/scenery.js:6912 — scenery.createScenery.draw has cognitive complexity 252 (threshold 15). Drivers by points: if/else 82 (117 pts), boolean chains 59, ternaries 43 (59 pts), loops 6 (14 pts), error handling 2 (3 pts) (nesting depth added 60). Of this number, 240 points are the body's own statements and 12 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPortal.draw (cognitive 191) · ×1
  • createPortal.draw (cognitive 191) renderer/portal.js:838 — createPortal.draw has cognitive complexity 191 (threshold 15). Drivers by points: if/else 63 (93 pts), boolean chains 50, ternaries 19 (35 pts), loops 3 (10 pts), error handling 1 (2 pts), other 1 (nesting depth added 54). Of this number, 184 points are the body's own statements and 7 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · portal.createPortal.draw (cognitive 174) · ×1
  • portal.createPortal.draw (cognitive 174) renderer/portal.js:838 — portal.createPortal.draw has cognitive complexity 174 (threshold 15). Drivers by points: if/else 63 (93 pts), boolean chains 47, ternaries 14 (22 pts), loops 3 (10 pts), error handling 1 (2 pts) (nesting depth added 46). Of this number, 167 points are the body's own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createField.draw (cognitive 147) · ×1
  • createField.draw (cognitive 147) renderer/visuals.js:249 — createField.draw has cognitive complexity 147 (threshold 15). Drivers by points: if/else 23 (61 pts), loops 16 (43 pts), ternaries 9 (33 pts), boolean chains 10 (nesting depth added 89). Of this number, 130 points are the body's own statements and 17 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pathLine1 (cognitive 143) · ×1
  • pathLine1 (cognitive 143) renderer/melody.js:64 — pathLine1 has cognitive complexity 143 (threshold 15). Drivers by points: loops 25 (63 pts), if/else 20 (54 pts), ternaries 5 (16 pts), boolean chains 10 (nesting depth added 83). Of this number, 135 points are the body's own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLens.draw (cognitive 140) · ×1
  • createLens.draw (cognitive 140) renderer/lens.js:457 — createLens.draw has cognitive complexity 140 (threshold 15). Drivers by points: if/else 50 (79 pts), boolean chains 33, ternaries 13 (20 pts), loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 40). Of this number, 126 points are the body's own statements and 14 belong to 21 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.drawBoat (cognitive 137) · ×1
  • scenery.drawBoat (cognitive 137) renderer/scenery.js:5715 — scenery.drawBoat has cognitive complexity 137 (threshold 15). Drivers by points: ternaries 13 (64 pts), if/else 24 (40 pts), loops 11 (22 pts), boolean chains 11 (nesting depth added 78). Of this number, 134 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · lens.createLens.draw (cognitive 130) · ×1
  • lens.createLens.draw (cognitive 130) renderer/lens.js:457 — lens.createLens.draw has cognitive complexity 130 (threshold 15). Drivers by points: if/else 50 (79 pts), boolean chains 31, ternaries 8 (12 pts), loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 37). Of this number, 117 points are the body's own statements and 13 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · worlds.createWorlds (cognitive 128) · ×1
  • worlds.createWorlds (cognitive 128) renderer/worlds.js:1185 — worlds.createWorlds has cognitive complexity 128 (threshold 15). Drivers by points: if/else 90 (121 pts), boolean chains 70, ternaries 30 (40 pts), loops 18 (25 pts), error handling 4 (7 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setUpIpc (cognitive 127) · ×1
  • setUpIpc (cognitive 127) main.js:527 — setUpIpc has cognitive complexity 127 (threshold 15). Drivers by points: if/else 51 (59 pts), boolean chains 33, error handling 13 (17 pts), ternaries 10 (14 pts), loops 3 (4 pts) (nesting depth added 17). Most of this is not in the body itself: 2 of the 127 points are its own statements and the rest belongs to 103 function items inside it that branch (a function literal at line 598, a function literal at line 624, a function literal at line 771, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · visuals.createField.draw (cognitive 120) · ×1
  • visuals.createField.draw (cognitive 120) renderer/visuals.js:249 — visuals.createField.draw has cognitive complexity 120 (threshold 15). Drivers by points: if/else 23 (61 pts), loops 16 (43 pts), boolean chains 10, ternaries 2 (6 pts) (nesting depth added 69). Of this number, 112 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createScenery (cognitive 114) · ×1
  • createScenery (cognitive 114) renderer/scenery.js:6506 — createScenery has cognitive complexity 114 (threshold 15). Drivers by points: if/else 33 (63 pts), boolean chains 22, ternaries 8 (18 pts), loops 4 (7 pts), other 4 (nesting depth added 43). None of this is in the body itself: all 114 points belong to 4 function literals inside it that branch (lines 6771, 6556, 6557, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · pixFor (cognitive 113) · ×1
  • pixFor (cognitive 113) renderer/scenery.js:5485 — pixFor has cognitive complexity 113 (threshold 15). Drivers by points: ternaries 21 (59 pts), if/else 21 (30 pts), boolean chains 13, loops 5 (11 pts) (nesting depth added 53). Of this number, 110 points are the body's own statements and 3 belong to 7 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · dance (cognitive 107) · ×1
  • dance (cognitive 107) renderer/noodles.js:750 — dance has cognitive complexity 107 (threshold 15). Drivers by points: ternaries 34 (41 pts), if/else 19 (31 pts), boolean chains 20, loops 8 (15 pts) (nesting depth added 26). Of this number, 103 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · swimSharks (cognitive 106) · ×1
  • swimSharks (cognitive 106) renderer/scenery.js:6079 — swimSharks has cognitive complexity 106 (threshold 15). Drivers by points: ternaries 17 (41 pts), if/else 14 (35 pts), boolean chains 18, loops 5 (11 pts), other 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · swimFish (cognitive 105) · ×1
  • swimFish (cognitive 105) renderer/scenery.js:5991 — swimFish has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (58 pts), ternaries 7 (22 pts), loops 6 (15 pts), boolean chains 10 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.createScenery.sim (cognitive 101) · ×1
  • scenery.createScenery.sim (cognitive 101) renderer/scenery.js:6771 — scenery.createScenery.sim has cognitive complexity 101 (threshold 15). Drivers by points: if/else 33 (63 pts), boolean chains 21, ternaries 4 (10 pts), loops 4 (7 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · drawFrame (cognitive 96) · ×1
  • drawFrame (cognitive 96) renderer/app.js:2459 — drawFrame has cognitive complexity 96 (threshold 15). Drivers by points: if/else 41 (51 pts), ternaries 14 (30 pts), boolean chains 15 (nesting depth added 26). Of this number, 88 points are the body's own statements and 8 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createDominoes.step (cognitive 92) · ×1
  • createDominoes.step (cognitive 92) renderer/dominoes.js:154 — createDominoes.step has cognitive complexity 92 (threshold 15). Drivers by points: if/else 21 (57 pts), boolean chains 12, loops 5 (12 pts), ternaries 3 (11 pts) (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Dancers.update (cognitive 88) · ×1
  • Dancers.update (cognitive 88) renderer/noodles.js:450 — Dancers.update has cognitive complexity 88 (threshold 15). Drivers by points: if/else 20 (41 pts), ternaries 7 (20 pts), loops 8 (15 pts), boolean chains 12 (nesting depth added 41). Of this number, 84 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · scenery.drawLighthouse (cognitive 88) · ×1
  • scenery.drawLighthouse (cognitive 88) renderer/scenery.js:5119 — scenery.drawLighthouse has cognitive complexity 88 (threshold 15). Drivers by points: ternaries 19 (68 pts), loops 11 (15 pts), boolean chains 5 (nesting depth added 53). Of this number, 86 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · dominoes.createDominoes.step (cognitive 84) · ×1
  • dominoes.createDominoes.step (cognitive 84) renderer/dominoes.js:154 — dominoes.createDominoes.step has cognitive complexity 84 (threshold 15). Drivers by points: if/else 21 (57 pts), boolean chains 12, loops 5 (12 pts), ternaries 1 (3 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · riffNotes (cognitive 83) · ×1
  • riffNotes (cognitive 83) renderer/codegen.js:112 — riffNotes has cognitive complexity 83 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 18, loops 8 (18 pts), ternaries 4 (11 pts) (nesting depth added 37). Of this number, 81 points are the body's own statements and 2 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createTakeRender.render (cognitive 78) · ×1
  • createTakeRender.render (cognitive 78) helpers/take-render.cjs:61 — createTakeRender.render has cognitive complexity 78 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 21, loops 7 (10 pts), error handling 6 (7 pts), other 5, ternaries 5 (nesting depth added 9). Of this number, 52 points are the body's own statements and 26 belong to 23 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · take-render.createTakeRender.render (cognitive 74) · ×1
  • take-render.createTakeRender.render (cognitive 74) helpers/take-render.cjs:61 — take-render.createTakeRender.render has cognitive complexity 74 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 21, loops 7 (10 pts), error handling 6 (9 pts), ternaries 4 (nesting depth added 11). Of this number, 49 points are the body's own statements and 25 belong to 13 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · createGame.drawBottom (cognitive 74) · ×1
  • createGame.drawBottom (cognitive 74) renderer/game.js:684 — createGame.drawBottom has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 15 (38 pts), if/else 13 (25 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createDominoes.draw (cognitive 72) · ×1
  • createDominoes.draw (cognitive 72) renderer/dominoes.js:227 — createDominoes.draw has cognitive complexity 72 (threshold 15). Drivers by points: ternaries 8 (32 pts), if/else 8 (20 pts), loops 7 (13 pts), boolean chains 7 (nesting depth added 42). Of this number, 71 points are the body's own statements and 1 belongs to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · paint (cognitive 71) · ×1
  • paint (cognitive 71) renderer/gameboot.js:84 — paint has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (37 pts), ternaries 9 (20 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 32). Of this number, 54 points are the body's own statements and 17 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · onmessage (cognitive 71) · ×1
  • onmessage (cognitive 71) renderer/stems-worker.js:29 — onmessage has cognitive complexity 71 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 11 (23 pts), boolean chains 11, ternaries 7 (8 pts), error handling 4 (5 pts) (nesting depth added 26). Of this number, 70 points are the body's own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLibraryPanel (cognitive 70) · ×1
  • createLibraryPanel (cognitive 70) renderer/library-panel.js:34 — createLibraryPanel has cognitive complexity 70 (threshold 15). Drivers by points: if/else 42 (49 pts), boolean chains 8, ternaries 4 (6 pts), loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 12). Most of this is not in the body itself: 5 of the 70 points are its own statements and the rest belongs to 21 function items inside it that branch (a function literal at line 1377, a function literal at line 1363, a function literal at line 1370, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createLibraryPanel.onKey (cognitive 70) · ×1
  • createLibraryPanel.onKey (cognitive 70) renderer/library-panel.js:1320 — createLibraryPanel.onKey has cognitive complexity 70 (threshold 15). Drivers by points: if/else 29 (33 pts), boolean chains 19, ternaries 9 (18 pts) (nesting depth added 13). Of this number, 48 points are the body's own statements and 22 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createWebApi.list (cognitive 69) · ×1
  • createWebApi.list (cognitive 69) helpers/spotify.cjs:285 — createWebApi.list has cognitive complexity 69 (threshold 15). Drivers by points: boolean chains 32, if/else 13 (23 pts), ternaries 5 (11 pts), other 3 (nesting depth added 16). Of this number, 64 points are the body's own statements and 5 belong to 9 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · timingHypotheses (cognitive 68) · ×1
  • timingHypotheses (cognitive 68) renderer/engine.js:475 — timingHypotheses has cognitive complexity 68 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 8 (21 pts), boolean chains 9, ternaries 4 (9 pts) (nesting depth added 39). Of this number, 58 points are the body's own statements and 10 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.drawMoon (cognitive 67) · ×1
  • scenery.drawMoon (cognitive 67) renderer/scenery.js:5047 — scenery.drawMoon has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 7 (26 pts), if/else 8 (20 pts), loops 10 (19 pts), boolean chains 2 (nesting depth added 40). Of this number, 66 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · advance (cognitive 66) · ×1
  • advance (cognitive 66) renderer/spaghetti.js:167 — advance has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 8 (15 pts), loops 6 (12 pts), boolean chains 8, other 1 (nesting depth added 26). Of this number, 64 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createGame.drawShell (cognitive 65) · ×1
  • game.createGame.drawShell (cognitive 65) renderer/game.js:424 — game.createGame.drawShell has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (30 pts), ternaries 8 (20 pts), loops 3 (9 pts), boolean chains 6 (nesting depth added 28). Of this number, 63 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createOrb (cognitive 65) · ×1
  • createOrb (cognitive 65) renderer/orb.js:472 — createOrb has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (31 pts), ternaries 8 (14 pts), loops 6 (10 pts), boolean chains 8, other 2 (nesting depth added 24). None of this is in the body itself: all 65 points belong to 5 function items inside it that branch (a function literal at line 585, (anonymous)::fire, a function literal at line 526, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · segcam.createSegcam.draw (cognitive 64) · ×1
  • segcam.createSegcam.draw (cognitive 64) renderer/segcam.js:152 — segcam.createSegcam.draw has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 6 (13 pts), boolean chains 10, loops 4 (8 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · createSegcam.draw (cognitive 64) · ×1
  • createSegcam.draw (cognitive 64) renderer/segcam.js:152 — createSegcam.draw has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 7 (13 pts), boolean chains 10, loops 4 (8 pts) (nesting depth added 27). Of this number, 62 points are the body's own statements and 2 belong to 14 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · spotify.createWebApi.list (cognitive 63) · ×1
  • spotify.createWebApi.list (cognitive 63) helpers/spotify.cjs:285 — spotify.createWebApi.list has cognitive complexity 63 (threshold 15). Drivers by points: boolean chains 34, if/else 13 (23 pts), ternaries 3 (6 pts) (nesting depth added 13). Of this number, 58 points are the body's own statements and 5 belong to 3 function literals inside it that branch. 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.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.onKey (cognitive 63) · ×1
  • library-panel.createLibraryPanel.onKey (cognitive 63) renderer/library-panel.js:1320 — library-panel.createLibraryPanel.onKey has cognitive complexity 63 (threshold 15). Drivers by points: if/else 29 (33 pts), boolean chains 19, ternaries 5 (11 pts) (nesting depth added 10). Of this number, 49 points are the body's own statements and 14 belong to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · visuals.createWebcam.applyFx (cognitive 62) · ×1
  • visuals.createWebcam.applyFx (cognitive 62) renderer/visuals.js:719 — visuals.createWebcam.applyFx has cognitive complexity 62 (threshold 15). Drivers by points: loops 11 (38 pts), if/else 8 (16 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · createPunchcard.queue (cognitive 62) · ×1
  • createPunchcard.queue (cognitive 62) renderer/visuals.js:505 — createPunchcard.queue has cognitive complexity 62 (threshold 15). Drivers by points: if/else 9 (26 pts), ternaries 5 (13 pts), boolean chains 12, loops 5 (11 pts) (nesting depth added 31). Of this number, 61 points are the body's own statements and 1 belongs to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createWebcam.applyFx (cognitive 62) · ×1
  • createWebcam.applyFx (cognitive 62) renderer/visuals.js:719 — createWebcam.applyFx has cognitive complexity 62 (threshold 15). Drivers by points: loops 11 (38 pts), if/else 8 (16 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · card.createCard.draw (cognitive 61) · ×1
  • card.createCard.draw (cognitive 61) renderer/card.js:251 — card.createCard.draw has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 14 (18 pts), boolean chains 13, loops 3 (4 pts) (nesting depth added 13). Of this number, 59 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.spRow (cognitive 61) · ×1
  • library-panel.createLibraryPanel.spRow (cognitive 61) renderer/library-panel.js:520 — library-panel.createLibraryPanel.spRow has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 21 (44 pts), if/else 13, boolean chains 4 (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 · createGame.drawShell (cognitive 61) · ×1
  • createGame.drawShell (cognitive 61) renderer/game.js:424 — createGame.drawShell has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (30 pts), ternaries 9 (16 pts), loops 3 (9 pts), boolean chains 6 (nesting depth added 23). Of this number, 59 points are the body's own statements and 2 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compactFromExact (cognitive 61) · ×1
  • compactFromExact (cognitive 61) renderer/tape.js:399 — compactFromExact has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 8 (23 pts), loops 6 (9 pts), boolean chains 4 (nesting depth added 29). Of this number, 30 points are the body's own statements and 31 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createCard.draw (cognitive 61) · ×1
  • createCard.draw (cognitive 61) renderer/card.js:251 — createCard.draw has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 15 (17 pts), boolean chains 14, loops 3 (4 pts) (nesting depth added 11). Of this number, 59 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · createGame.draw (cognitive 60) · ×1
  • createGame.draw (cognitive 60) renderer/game.js:806 — createGame.draw has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 15, ternaries 9 (14 pts), loops 4 (6 pts) (nesting depth added 15). Of this number, 39 points are the body's own statements and 21 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createStorm.draw (cognitive 59) · ×1
  • createStorm.draw (cognitive 59) renderer/storm.js:212 — createStorm.draw has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 11 (13 pts), loops 4 (9 pts), boolean chains 7 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createGame.draw (cognitive 58) · ×1
  • game.createGame.draw (cognitive 58) renderer/game.js:806 — game.createGame.draw has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 15, ternaries 7 (12 pts), loops 4 (6 pts) (nesting depth added 15). Of this number, 38 points are the body's own statements and 20 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tape.createTape (cognitive 58) · ×1
  • tape.createTape (cognitive 58) renderer/tape.js:20 — tape.createTape has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 15, loops 8 (10 pts), ternaries 4 (7 pts) (nesting depth added 13). Of this number, 55 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · coverGlyphs (cognitive 58) · ×1
  • coverGlyphs (cognitive 58) renderer/library.js:315 — coverGlyphs has cognitive complexity 58 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 10 (18 pts), ternaries 4 (12 pts), boolean chains 7 (nesting depth added 26). Of this number, 53 points are the body's own statements and 5 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · buildLines (cognitive 58) · ×1
  • buildLines (cognitive 58) renderer/codegen.js:302 — buildLines has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 23 (28 pts), boolean chains 13, if/else 10 (13 pts), loops 2 (3 pts), other 1 (nesting depth added 9). Of this number, 50 points are the body's own statements and 8 belong to 12 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · createVoxCam.draw (cognitive 58) · ×1
  • createVoxCam.draw (cognitive 58) renderer/voxcam.js:148 — createVoxCam.draw has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 11, loops 6 (9 pts), ternaries 4 (8 pts), error handling 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · storm.createStorm.draw (cognitive 57) · ×1
  • storm.createStorm.draw (cognitive 57) renderer/storm.js:212 — storm.createStorm.draw has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 8 (11 pts), loops 4 (9 pts), boolean chains 7 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · stepPond (cognitive 57) · ×1
  • stepPond (cognitive 57) renderer/scenery.js:6410 — stepPond has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 11 (25 pts), if/else 5 (13 pts), boolean chains 11, loops 4 (8 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.
D2 · Cognitive Complexity · createLibraryPanel.spRow (cognitive 57) · ×1
  • createLibraryPanel.spRow (cognitive 57) renderer/library-panel.js:520 — createLibraryPanel.spRow has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 21 (40 pts), if/else 13, boolean chains 4 (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 · now-coding.html.renderField (cognitive 56) · ×1
  • now-coding.html.renderField (cognitive 56) prototype/now-coding.html:1281 — now-coding.html.renderField has cognitive complexity 56 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 10 (21 pts), ternaries 2 (6 pts), boolean chains 4 (nesting depth added 30). Of this number, 48 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · orb.createOrb.sim (cognitive 56) · ×1
  • orb.createOrb.sim (cognitive 56) renderer/orb.js:585 — orb.createOrb.sim has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 5 (9 pts), boolean chains 8, ternaries 4 (8 pts) (nesting depth added 22). Of this number, 46 points are the body's own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createGame.drawTop (cognitive 56) · ×1
  • createGame.drawTop (cognitive 56) renderer/game.js:551 — createGame.drawTop has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 11 (22 pts), boolean chains 6, loops 5 (6 pts) (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 · visuals.createPunchcard.queue (cognitive 55) · ×1
  • visuals.createPunchcard.queue (cognitive 55) renderer/visuals.js:505 — visuals.createPunchcard.queue has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 11, loops 5 (11 pts), ternaries 3 (7 pts) (nesting depth added 27). Of this number, 54 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · voxcam.createVoxCam.draw (cognitive 55) · ×1
  • voxcam.createVoxCam.draw (cognitive 55) renderer/voxcam.js:148 — voxcam.createVoxCam.draw has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 11, loops 6 (9 pts), ternaries 3 (5 pts), error handling 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · layout (cognitive 55) · ×1
  • layout (cognitive 55) renderer/noodles.js:582 — layout has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 8 (15 pts), loops 8 (14 pts), match/switch 2 (3 pts), boolean chains 2, other 1 (nesting depth added 26). Of this number, 38 points are the body's own statements and 17 belong to 11 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPlayerBar.update (cognitive 53) · ×1
  • createPlayerBar.update (cognitive 53) renderer/player.js:243 — createPlayerBar.update has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 20 (26 pts), boolean chains 15, if/else 8 (11 pts), loops 1 (nesting depth added 9). Of this number, 49 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · now-coding.html.drumParts (cognitive 52) · ×1
  • now-coding.html.drumParts (cognitive 52) prototype/now-coding.html:1032 — now-coding.html.drumParts has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 6 (16 pts), loops 6 (11 pts), boolean chains 4 (nesting depth added 24). Of this number, 41 points are the body's own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createGame.model (cognitive 52) · ×1
  • game.createGame.model (cognitive 52) renderer/game.js:246 — game.createGame.model has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 16, ternaries 7 (11 pts), loops 5 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createGame.model (cognitive 52) · ×1
  • createGame.model (cognitive 52) renderer/game.js:246 — createGame.model has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 15, ternaries 8 (12 pts), loops 5 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · id3Frames (cognitive 51) · ×1
  • id3Frames (cognitive 51) renderer/audio-tags.js:92 — id3Frames has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 7 (17 pts), boolean chains 11, loops 1 (nesting depth added 20). Of this number, 46 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createClock (cognitive 51) · ×1
  • createClock (cognitive 51) renderer/clock.js:80 — createClock has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 8, ternaries 6, loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 7). None of this is in the body itself: all 51 points belong to 31 function items inside it that branch (fire, follow, live, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · audio-tags.mp4 (cognitive 50) · ×1
  • audio-tags.mp4 (cognitive 50) renderer/audio-tags.js:216 — audio-tags.mp4 has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 4 (11 pts), boolean chains 8, loops 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · stepParts (cognitive 50) · ×1
  • stepParts (cognitive 50) renderer/codegen.js:10 — stepParts has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 6 (11 pts), ternaries 4 (11 pts), boolean chains 5, other 2 (nesting depth added 21). Of this number, 37 points are the body's own statements and 13 belong to 11 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dominoes.createDominoes.draw (cognitive 49) · ×1
  • dominoes.createDominoes.draw (cognitive 49) renderer/dominoes.js:227 — dominoes.createDominoes.draw has cognitive complexity 49 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (13 pts), boolean chains 8, ternaries 2 (8 pts) (nesting depth added 24). Of this number, 46 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Noodles.touch (cognitive 49) · ×1
  • Noodles.touch (cognitive 49) renderer/noodles.js:232 — Noodles.touch has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 6 (9 pts), ternaries 2 (8 pts), boolean chains 7 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · lcdTop (cognitive 49) · ×1
  • lcdTop (cognitive 49) renderer/gameskins.js:182 — lcdTop has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 10 (15 pts), loops 8 (11 pts), boolean chains 5, other 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · world (cognitive 49) · ×1
  • world (cognitive 49) renderer/noodles.js:286 — world has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 5 (16 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createTape · ×1
  • createTape::song (cognitive 49) renderer/tape.js:62 — createTape::song has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 11, loops 8 (10 pts), ternaries 4 (8 pts), other 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPost.draw (cognitive 48) · ×1
  • createPost.draw (cognitive 48) REDACTED:790 — createPost.draw has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 8 (10 pts), boolean chains 9, loops 1 (3 pts), other 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · post.createPost.draw (cognitive 47) · ×1
  • post.createPost.draw (cognitive 47) REDACTED:790 — post.createPost.draw has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 8 (10 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · vfdTop (cognitive 47) · ×1
  • vfdTop (cognitive 47) renderer/gameskins.js:840 — vfdTop has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 14 (28 pts), if/else 5 (8 pts), loops 6 (8 pts), boolean chains 2, other 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.drawGardenKoi (cognitive 46) · ×1
  • scenery.drawGardenKoi (cognitive 46) renderer/scenery.js:5002 — scenery.drawGardenKoi has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 11 (34 pts), boolean chains 15, loops 8 (10 pts), if/else 5 (9 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (scenery.drawGardenKoi::spot) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · parseXml (cognitive 46) · ×1
  • parseXml (cognitive 46) helpers/youtube.cjs:119 — parseXml has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · glass.createGlass.runs · ×1
  • glass.createGlass.runs::walk (cognitive 45) renderer/glass.js:346 — glass.createGlass.runs::walk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (33 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · danceTop (cognitive 45) · ×1
  • danceTop (cognitive 45) renderer/gameskins.js:584 — danceTop has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 16 (28 pts), if/else 4 (6 pts), boolean chains 5, loops 5, other 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createGlass.runs · ×1
  • createGlass.runs::walk (cognitive 45) renderer/glass.js:346 — createGlass.runs::walk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (33 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · placeBass (cognitive 44) · ×1
  • placeBass (cognitive 44) renderer/melody.js:196 — placeBass has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 13, loops 7 (11 pts), ternaries 2 (4 pts), other 1 (nesting depth added 13). Of this number, 23 points are the body's own statements and 21 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · id3 (cognitive 44) · ×1
  • id3 (cognitive 44) renderer/embedded-cover.js:48 — id3 has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 18, if/else 9 (15 pts), ternaries 5 (10 pts), loops 1 (nesting depth added 11). Of this number, 42 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dotcam.createDotCam.draw (cognitive 43) · ×1
  • dotcam.createDotCam.draw (cognitive 43) renderer/dotcam.js:159 — dotcam.createDotCam.draw has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11, error handling 2 (4 pts), loops 3 (4 pts), ternaries 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · drawFlame (cognitive 43) · ×1
  • drawFlame (cognitive 43) renderer/scenery.js:5309 — drawFlame has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 5 (13 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 23). Of this number, 42 points are the body's own statements and 1 belongs to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPunchcard.draw (cognitive 43) · ×1
  • createPunchcard.draw (cognitive 43) renderer/visuals.js:607 — createPunchcard.draw has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 10, ternaries 6 (10 pts), loops 1, other 1 (nesting depth added 12). Of this number, 37 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createDotCam.draw (cognitive 43) · ×1
  • createDotCam.draw (cognitive 43) renderer/dotcam.js:159 — createDotCam.draw has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11, error handling 2 (4 pts), loops 3 (4 pts), ternaries 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createGame.drawTop (cognitive 42) · ×1
  • game.createGame.drawTop (cognitive 42) renderer/game.js:551 — game.createGame.drawTop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 4 (8 pts), boolean chains 6, loops 5 (6 pts) (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 · scenery.feedKoi (cognitive 42) · ×1
  • scenery.feedKoi (cognitive 42) renderer/scenery.js:6330 — scenery.feedKoi has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (10 pts), ternaries 4 (7 pts), boolean chains 6 (nesting depth added 16). Of this number, 29 points are the body's own statements and 13 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · player.createPlayerBar.update (cognitive 42) · ×1
  • player.createPlayerBar.update (cognitive 42) renderer/player.js:243 — player.createPlayerBar.update has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 13 (16 pts), boolean chains 14, if/else 8 (11 pts), loops 1 (nesting depth added 6). Of this number, 38 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · createLibraryPanel.update (cognitive 42) · ×1
  • createLibraryPanel.update (cognitive 42) renderer/library-panel.js:1024 — createLibraryPanel.update has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, ternaries 2 (7 pts) (nesting depth added 17). Of this number, 32 points are the body's own statements and 10 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · osTop (cognitive 42) · ×1
  • osTop (cognitive 42) renderer/gameskins.js:317 — osTop has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 10 (16 pts), loops 6, boolean chains 2, other 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · codeview.createCodeView.step (cognitive 41) · ×1
  • codeview.createCodeView.step (cognitive 41) renderer/codeview.js:333 — codeview.createCodeView.step has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createGame.drawBottom (cognitive 41) · ×1
  • game.createGame.drawBottom (cognitive 41) renderer/game.js:684 — game.createGame.drawBottom has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 8, loops 3 (4 pts), ternaries 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.
D2 · Cognitive Complexity · visuals.createPunchcard.draw (cognitive 41) · ×1
  • visuals.createPunchcard.draw (cognitive 41) renderer/visuals.js:607 — visuals.createPunchcard.draw has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 10, ternaries 5 (9 pts), loops 1 (nesting depth added 12). Of this number, 35 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.drawTrout (cognitive 41) · ×1
  • scenery.drawTrout (cognitive 41) renderer/scenery.js:5277 — scenery.drawTrout has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 6 (27 pts), if/else 2 (6 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · cover-palette.cluster (cognitive 41) · ×1
  • cover-palette.cluster (cognitive 41) renderer/cover-palette.js:102 — cover-palette.cluster has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 8 (17 pts), ternaries 1 (2 pts) (nesting depth added 24). Of this number, 36 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createCodeView.step (cognitive 41) · ×1
  • createCodeView.step (cognitive 41) renderer/codeview.js:333 — createCodeView.step has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 3 (nesting depth added 13). Of this number, 40 points are the body's own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rebuild.program (cognitive 40) · ×1
  • rebuild.program (cognitive 40) renderer/rebuild.js:407 — rebuild.program has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 9 (12 pts), loops 9 (11 pts), boolean chains 4 (nesting depth added 10). Of this number, 16 points are the body's own statements and 24 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · highwayTop (cognitive 40) · ×1
  • highwayTop (cognitive 40) renderer/gameskins.js:704 — highwayTop has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 11 (19 pts), loops 9 (14 pts), if/else 3 (5 pts), boolean chains 1, other 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createWebApi.play (cognitive 40) · ×1
  • createWebApi.play (cognitive 40) helpers/spotify.cjs:342 — createWebApi.play has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 14, ternaries 2 (3 pts), error handling 1 (2 pts), other 1 (nesting depth added 10). Of this number, 37 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createEarth.draw (cognitive 40) · ×1
  • createEarth.draw (cognitive 40) renderer/earth.js:185 — createEarth.draw has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 11, ternaries 10, other 3, error handling 1 (2 pts) (nesting depth added 4). Of this number, 37 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · engine.createEventLedger (cognitive 39) · ×1
  • engine.createEventLedger (cognitive 39) renderer/engine.js:36 — engine.createEventLedger has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 14, loops 4 (5 pts) (nesting depth added 6). Of this number, 38 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.update (cognitive 38) · ×1
  • library-panel.createLibraryPanel.update (cognitive 38) renderer/library-panel.js:1024 — library-panel.createLibraryPanel.update has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 14). Of this number, 32 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-source.scanHandle · ×1
  • library-source.scanHandle::walk (cognitive 38) renderer/library-source.js:71 — library-source.scanHandle::walk has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 5, ternaries 1 (4 pts), error handling 2 (3 pts), loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · earth.createEarth.draw (cognitive 37) · ×1
  • earth.createEarth.draw (cognitive 37) renderer/earth.js:185 — earth.createEarth.draw has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 10 (12 pts), boolean chains 11 (nesting depth added 5). Of this number, 34 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · exportSong (cognitive 37) · ×1
  • exportSong (cognitive 37) renderer/app.js:1597 — exportSong has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 10 (13 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 13). Of this number, 36 points are the body's own statements and 1 belongs to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLibraryPanel.spArtSrc (cognitive 37) · ×1
  • createLibraryPanel.spArtSrc (cognitive 37) renderer/library-panel.js:583 — createLibraryPanel.spArtSrc has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 25, ternaries 6 (9 pts), if/else 3 (nesting depth added 3). 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.
D2 · Cognitive Complexity · bassPitch (cognitive 37) · ×1
  • bassPitch (cognitive 37) renderer/rebuild.js:232 — bassPitch has cognitive complexity 37 (threshold 15). Drivers by points: loops 14 (23 pts), if/else 4 (9 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · createLibrary.scanIn (cognitive 37) · ×1
  • createLibrary.scanIn (cognitive 37) helpers/library.cjs:317 — createLibrary.scanIn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (6 pts), ternaries 3 (6 pts), error handling 2 (3 pts), boolean chains 2, other 1 (nesting depth added 13). None of this is in the body itself: all 37 points belong to 6 function items inside it that branch (a function literal at line 326, a function literal at line 325, (anonymous)::fail, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · spotify.createWebApi.play (cognitive 36) · ×1
  • spotify.createWebApi.play (cognitive 36) helpers/spotify.cjs:342 — spotify.createWebApi.play has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 14, error handling 1 (2 pts) (nesting depth added 9). Of this number, 34 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createOrb.draw (cognitive 36) · ×1
  • createOrb.draw (cognitive 36) renderer/orb.js:678 — createOrb.draw has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 8 (11 pts), boolean chains 7, error handling 1 (2 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 · worldlooks.blueNoise (cognitive 35) · ×1
  • worldlooks.blueNoise (cognitive 35) renderer/worldlooks.js:508 — worldlooks.blueNoise has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 13 (15 pts), boolean chains 2 (nesting depth added 12). Most of this is not in the body itself: 12 of the 35 points are its own statements and the rest belongs to 4 function items inside it that branch (rows, tightest, loosest, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createBackrooms.draw (cognitive 35) · ×1
  • createBackrooms.draw (cognitive 35) renderer/backrooms.js:154 — createBackrooms.draw has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 10, ternaries 6, error handling 1 (2 pts), other 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · makeDemo.schedule (cognitive 35) · ×1
  • makeDemo.schedule (cognitive 35) renderer/demo.js:86 — makeDemo.schedule has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 5, ternaries 1 (4 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library.coverSize (cognitive 34) · ×1
  • library.coverSize (cognitive 34) helpers/library.cjs:167 — library.coverSize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library.createLibrary.scanIn (cognitive 34) · ×1
  • library.createLibrary.scanIn (cognitive 34) helpers/library.cjs:317 — library.createLibrary.scanIn has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (6 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 12). None of this is in the body itself: all 34 points belong to 3 function literals inside it that branch (lines 326, 325, 323). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · y2k.createY2k.draw (cognitive 34) · ×1
  • y2k.createY2k.draw (cognitive 34) renderer/y2k.js:371 — y2k.createY2k.draw has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.spHead (cognitive 34) · ×1
  • library-panel.createLibraryPanel.spHead (cognitive 34) renderer/library-panel.js:422 — library-panel.createLibraryPanel.spHead has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 13 (26 pts), boolean chains 6, if/else 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.spArtSrc (cognitive 34) · ×1
  • library-panel.createLibraryPanel.spArtSrc (cognitive 34) renderer/library-panel.js:583 — library-panel.createLibraryPanel.spArtSrc has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 22, ternaries 6 (9 pts), if/else 3 (nesting depth added 3). 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.
D2 · Cognitive Complexity · createWebcam.findEyes (cognitive 34) · ×1
  • createWebcam.findEyes (cognitive 34) renderer/visuals.js:800 — createWebcam.findEyes has cognitive complexity 34 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 1 (5 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 19). Of this number, 32 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · createY2k.draw (cognitive 34) · ×1
  • createY2k.draw (cognitive 34) renderer/y2k.js:371 — createY2k.draw has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · library.walk (cognitive 33) · ×1
  • library.walk (cognitive 33) helpers/library.cjs:72 — library.walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 4 (10 pts), error handling 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). Of this number, 26 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · spectro.createSpectro.draw (cognitive 33) · ×1
  • spectro.createSpectro.draw (cognitive 33) renderer/spectro.js:344 — spectro.createSpectro.draw has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 9, boolean chains 8, loops 4 (5 pts), error handling 1 (2 pts) (nesting depth added 5). Of this number, 32 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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 · scenery.stepSea (cognitive 33) · ×1
  • scenery.stepSea (cognitive 33) renderer/scenery.js:5953 — scenery.stepSea has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (17 pts), boolean chains 7, if/else 5 (6 pts), loops 2 (3 pts) (nesting depth added 12). Of this number, 31 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · (anonymous) (cognitive 33) · ×1
  • (anonymous) (cognitive 33) renderer/app.js:3326 — (anonymous) has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 8, error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · danceBottom (cognitive 33) · ×1
  • danceBottom (cognitive 33) renderer/gameskins.js:659 — danceBottom has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 4 (13 pts), if/else 3 (9 pts), loops 3 (7 pts), boolean chains 4 (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 · createSpectro.draw (cognitive 33) · ×1
  • createSpectro.draw (cognitive 33) renderer/spectro.js:344 — createSpectro.draw has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 9, boolean chains 8, loops 4 (5 pts), error handling 1 (2 pts) (nesting depth added 5). Of this number, 32 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · checkMeta (cognitive 33) · ×1
  • checkMeta (cognitive 33) helpers/take-store.cjs:125 — checkMeta has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 15, if/else 9 (11 pts), ternaries 5 (6 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · backrooms.createBackrooms.draw (cognitive 32) · ×1
  • backrooms.createBackrooms.draw (cognitive 32) renderer/backrooms.js:154 — backrooms.createBackrooms.draw has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 10, ternaries 6 (7 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · createLibraryPanel.spHead (cognitive 32) · ×1
  • createLibraryPanel.spHead (cognitive 32) renderer/library-panel.js:422 — createLibraryPanel.spHead has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 13 (24 pts), boolean chains 6, if/else 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 · game.createGame.idle (cognitive 31) · ×1
  • game.createGame.idle (cognitive 31) renderer/game.js:859 — game.createGame.idle has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 6 (9 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 9). Of this number, 18 points are the body's own statements and 13 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · orb.createOrb.draw (cognitive 31) · ×1
  • orb.createOrb.draw (cognitive 31) renderer/orb.js:678 — orb.createOrb.draw has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, ternaries 5 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · scenery.drawToast (cognitive 31) · ×1
  • scenery.drawToast (cognitive 31) renderer/scenery.js:5436 — scenery.drawToast has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 4 (18 pts), boolean chains 7, if/else 1 (3 pts), loops 2 (3 pts) (nesting depth added 17). Of this number, 28 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · demo.makeDemo.schedule (cognitive 31) · ×1
  • demo.makeDemo.schedule (cognitive 31) renderer/demo.js:86 — demo.makeDemo.schedule has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 5, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library.spotifyRows (cognitive 31) · ×1
  • library.spotifyRows (cognitive 31) renderer/library.js:173 — library.spotifyRows has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (12 pts), ternaries 3 (4 pts), 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 · Ear.process (cognitive 31) · ×1
  • Ear.process (cognitive 31) renderer/ear-worklet.js:48 — Ear.process has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rebuild.render (cognitive 31) · ×1
  • rebuild.render (cognitive 31) renderer/rebuild.js:384 — rebuild.render has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 7, loops 5 (6 pts), if/else 2 (5 pts) (nesting depth added 11). Of this number, 23 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createCodeView.highlight (cognitive 31) · ×1
  • createCodeView.highlight (cognitive 31) renderer/codeview.js:421 — createCodeView.highlight has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 12, loops 7 (9 pts), ternaries 4 (6 pts), if/else 3 (4 pts) (nesting depth added 5). Of this number, 29 points are the body's own statements and 2 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · visuals.createWebcam.findEyes (cognitive 30) · ×1
  • visuals.createWebcam.findEyes (cognitive 30) renderer/visuals.js:800 — visuals.createWebcam.findEyes has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 1 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 17). Of this number, 28 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · stirSea (cognitive 30) · ×1
  • stirSea (cognitive 30) renderer/scenery.js:6201 — stirSea has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 4 (8 pts), loops 6 (8 pts), boolean chains 1 (nesting depth added 14). Of this number, 28 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createGame.idle (cognitive 30) · ×1
  • createGame.idle (cognitive 30) renderer/game.js:859 — createGame.idle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 6 (8 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 8). Of this number, 17 points are the body's own statements and 13 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createCuts (cognitive 30) · ×1
  • createCuts (cognitive 30) renderer/cuts.js:219 — createCuts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, loops 2 (5 pts), other 2, ternaries 1 (2 pts) (nesting depth added 12). None of this is in the body itself: all 30 points belong to 5 function literals inside it that branch (lines 344, 370, 367, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · mp3Length (cognitive 30) · ×1
  • mp3Length (cognitive 30) renderer/audio-tags.js:160 — mp3Length has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · codeview.createCodeView.highlight (cognitive 29) · ×1
  • codeview.createCodeView.highlight (cognitive 29) renderer/codeview.js:421 — codeview.createCodeView.highlight has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 10, loops 7 (9 pts), ternaries 4 (6 pts), if/else 3 (4 pts) (nesting depth added 5). Of this number, 27 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gameskins.codeRows (cognitive 29) · ×1
  • gameskins.codeRows (cognitive 29) renderer/gameskins.js:492 — gameskins.codeRows has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 12 (13 pts), if/else 8 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). Most of this is not in the body itself: 5 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 501). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · pinches.createPinches.update (cognitive 29) · ×1
  • pinches.createPinches.update (cognitive 29) renderer/pinches.js:17 — pinches.createPinches.update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · renderGrid (cognitive 29) · ×1
  • renderGrid (cognitive 29) renderer/app.js:1847 — renderGrid has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (15 pts), boolean chains 6, if/else 3 (5 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createCuts.draw (cognitive 29) · ×1
  • createCuts.draw (cognitive 29) renderer/cuts.js:384 — createCuts.draw has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 8). Of this number, 28 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createSongMemory.put (cognitive 29) · ×1
  • createSongMemory.put (cognitive 29) renderer/song-memory.js:41 — createSongMemory.put has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 10, if/else 4 (5 pts), loops 2 (3 pts) (nesting depth added 7). Of this number, 22 points are the body's own statements and 7 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPinches.update (cognitive 29) · ×1
  • createPinches.update (cognitive 29) renderer/pinches.js:17 — createPinches.update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 15). Of this number, 27 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cuts.createCuts.sim (cognitive 28) · ×1
  • cuts.createCuts.sim (cognitive 28) renderer/cuts.js:344 — cuts.createCuts.sim has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 12). Of this number, 21 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · drawCrab (cognitive 28) · ×1
  • drawCrab (cognitive 28) renderer/scenery.js:5099 — drawCrab has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (18 pts), loops 5 (8 pts), if/else 2 (nesting depth added 13). Of this number, 26 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · loadSettings (cognitive 28) · ×1
  • loadSettings (cognitive 28) renderer/app.js:249 — loadSettings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (18 pts), ternaries 5, boolean chains 3, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · createCodeView.plan (cognitive 28) · ×1
  • createCodeView.plan (cognitive 28) renderer/codeview.js:185 — createCodeView.plan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (7 pts), boolean chains 6, loops 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createTakeover.draw (cognitive 28) · ×1
  • createTakeover.draw (cognitive 28) renderer/fx.js:313 — createTakeover.draw has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 9, loops 2, 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 · paintIdle (cognitive 28) · ×1
  • paintIdle (cognitive 28) renderer/gameboot.js:160 — paintIdle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 7 (11 pts), boolean chains 2 (nesting depth added 9). Of this number, 26 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · now-coding.html.makeDemo.schedule (cognitive 27) · ×1
  • now-coding.html.makeDemo.schedule (cognitive 27) prototype/now-coding.html:417 — now-coding.html.makeDemo.schedule has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · codeview.createCodeView.plan (cognitive 27) · ×1
  • codeview.createCodeView.plan (cognitive 27) renderer/codeview.js:185 — codeview.createCodeView.plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (7 pts), boolean chains 5, loops 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fx.createTakeover.draw (cognitive 27) · ×1
  • fx.createTakeover.draw (cognitive 27) renderer/fx.js:313 — fx.createTakeover.draw has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 9, 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 · glass.createGlass.drawCode (cognitive 27) · ×1
  • glass.createGlass.drawCode (cognitive 27) renderer/glass.js:272 — glass.createGlass.drawCode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 3, ternaries 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 · cuts.createCuts.draw (cognitive 27) · ×1
  • cuts.createCuts.draw (cognitive 27) renderer/cuts.js:384 — cuts.createCuts.draw has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 7). Of this number, 26 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.activate (cognitive 27) · ×1
  • library-panel.createLibraryPanel.activate (cognitive 27) renderer/library-panel.js:1181 — library-panel.createLibraryPanel.activate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, boolean chains 6, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · rebuild.findGrid (cognitive 27) · ×1
  • rebuild.findGrid (cognitive 27) renderer/rebuild.js:121 — rebuild.findGrid has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7 (11 pts), ternaries 2, boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body's own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLibraryPanel.glyphMask (cognitive 27) · ×1
  • createLibraryPanel.glyphMask (cognitive 27) renderer/library-panel.js:112 — createLibraryPanel.glyphMask has cognitive complexity 27 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (8 pts), ternaries 3 (6 pts), error handling 1 (2 pts) (nesting depth added 15). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 115, 135, 136, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · createLibraryPanel.activate (cognitive 27) · ×1
  • createLibraryPanel.activate (cognitive 27) renderer/library-panel.js:1181 — createLibraryPanel.activate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, boolean chains 6, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). Of this number, 26 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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 · readVoice (cognitive 27) · ×1
  • readVoice (cognitive 27) renderer/rebuild.js:303 — readVoice has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (8 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 10). Of this number, 22 points are the body's own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wraps (cognitive 27) · ×1
  • wraps (cognitive 27) renderer/codeview.js:37 — wraps has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, loops 3 (4 pts), other 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 · createGlass.drawCode (cognitive 27) · ×1
  • createGlass.drawCode (cognitive 27) renderer/glass.js:272 — createGlass.drawCode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 3, ternaries 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 · engine.createEngine · ×1
  • engine.createEngine::fit (cognitive 26) renderer/engine.js:2387 — engine.createEngine::fit has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 3 (6 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (engine.createEngine) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · card.createCard.fromArt (cognitive 26) · ×1
  • card.createCard.fromArt (cognitive 26) renderer/card.js:107 — card.createCard.fromArt has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 2 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · portal.createSwipes.update (cognitive 26) · ×1
  • portal.createSwipes.update (cognitive 26) renderer/portal.js:163 — portal.createSwipes.update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 7, loops 4 (6 pts), ternaries 2 (5 pts) (nesting depth added 10). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · firstrun.advanceHints (cognitive 26) · ×1
  • firstrun.advanceHints (cognitive 26) renderer/firstrun.js:19 — firstrun.advanceHints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, loops 1 (2 pts), ternaries 2 (nesting depth added 4). Of this number, 23 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · rebuild.readKeys (cognitive 26) · ×1
  • rebuild.readKeys (cognitive 26) renderer/rebuild.js:330 — rebuild.readKeys has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 4 (9 pts), boolean chains 1, ternaries 1 (nesting depth added 12). Of this number, 19 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · createLibraryPanel.searchSpotify (cognitive 26) · ×1
  • createLibraryPanel.searchSpotify (cognitive 26) renderer/library-panel.js:364 — createLibraryPanel.searchSpotify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, ternaries 4, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · createSwipes.update (cognitive 26) · ×1
  • createSwipes.update (cognitive 26) renderer/portal.js:163 — createSwipes.update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 7, loops 4 (6 pts), ternaries 2 (5 pts) (nesting depth added 10). Of this number, 24 points are the body's own statements and 2 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · readBass (cognitive 26) · ×1
  • readBass (cognitive 26) renderer/rebuild.js:266 — readBass has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), loops 5 (6 pts), ternaries 5 (nesting depth added 4). Of this number, 15 points are the body's own statements and 11 belong to 16 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createChrome (cognitive 26) · ×1
  • createChrome (cognitive 26) renderer/chrome.js:188 — createChrome has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (6 pts), boolean chains 3, loops 2, other 1 (nesting depth added 9). None of this is in the body itself: all 26 points belong to 3 function literals inside it that branch (lines 337, 287, 288). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · createBoot.draw (cognitive 26) · ×1
  • createBoot.draw (cognitive 26) renderer/gameboot.js:232 — createBoot.draw has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (7 pts), loops 2 (6 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · createCard.fromArt (cognitive 26) · ×1
  • createCard.fromArt (cognitive 26) renderer/card.js:107 — createCard.fromArt has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 2 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · game.createGame.drawStance (cognitive 25) · ×1
  • game.createGame.drawStance (cognitive 25) renderer/game.js:496 — game.createGame.drawStance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 8). Of this number, 20 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · chrome.createChrome.sim (cognitive 25) · ×1
  • chrome.createChrome.sim (cognitive 25) renderer/chrome.js:337 — chrome.createChrome.sim has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (6 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · preanalyse.createPreanalysis.loop (cognitive 25) · ×1
  • preanalyse.createPreanalysis.loop (cognitive 25) renderer/preanalyse.js:56 — preanalyse.createPreanalysis.loop has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 11). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · player.createPlayerBar (cognitive 25) · ×1
  • player.createPlayerBar (cognitive 25) renderer/player.js:123 — player.createPlayerBar has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 3 (4 pts), loops 2, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 458, 131, 145, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.glyphMask (cognitive 25) · ×1
  • library-panel.createLibraryPanel.glyphMask (cognitive 25) renderer/library-panel.js:112 — library-panel.createLibraryPanel.glyphMask has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (8 pts), ternaries 3 (6 pts) (nesting depth added 14). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 115). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · createGame.drawStance (cognitive 25) · ×1
  • createGame.drawStance (cognitive 25) renderer/game.js:496 — createGame.drawStance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 8). Of this number, 20 points are the body's own statements and 5 belong to 11 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · glField (cognitive 25) · ×1
  • glField (cognitive 25) renderer/visuals.js:56 — glField has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (3 pts), error handling 2 (nesting depth added 5). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 9 function items inside it that branch (draw, finish, setup, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · strudelProgram (cognitive 25) · ×1
  • strudelProgram (cognitive 25) renderer/codegen.js:379 — strudelProgram has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 5 (9 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPreanalysis.loop (cognitive 25) · ×1
  • createPreanalysis.loop (cognitive 25) renderer/preanalyse.js:56 — createPreanalysis.loop has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 11). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · codegen.bassParts (cognitive 24) · ×1
  • codegen.bassParts (cognitive 24) renderer/codegen.js:189 — codegen.bassParts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 4 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). Of this number, 12 points are the body's own statements and 12 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · preanalyse.analyseBytes (cognitive 24) · ×1
  • preanalyse.analyseBytes (cognitive 24) renderer/preanalyse.js:8 — preanalyse.analyseBytes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.findKey (cognitive 24) · ×1
  • library-panel.createLibraryPanel.findKey (cognitive 24) renderer/library-panel.js:1255 — library-panel.createLibraryPanel.findKey has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 5). Of this number, 12 points are the body's own statements and 12 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · nowPlaying (cognitive 24) · ×1
  • nowPlaying (cognitive 24) renderer/app.js:894 — nowPlaying has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), ternaries 5, other 1 (nesting depth added 3). Of this number, 20 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · loadLooks (cognitive 24) · ×1
  • loadLooks (cognitive 24) renderer/app.js:1283 — loadLooks has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5 (6 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 6). Of this number, 20 points are the body's own statements and 4 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · changeWindowMode (cognitive 24) · ×1
  • changeWindowMode (cognitive 24) renderer/app.js:1747 — changeWindowMode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 7, boolean chains 6, error handling 1 (nesting depth added 1). Of this number, 15 points are the body's own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · aRound (cognitive 24) · ×1
  • aRound (cognitive 24) renderer/app.js:2751 — aRound has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (10 pts), boolean chains 3 (nesting depth added 7). Of this number, 15 points are the body's own statements and 9 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLibraryPanel.findKey (cognitive 24) · ×1
  • createLibraryPanel.findKey (cognitive 24) renderer/library-panel.js:1255 — createLibraryPanel.findKey has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 5). Of this number, 12 points are the body's own statements and 12 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createGame.step (cognitive 24) · ×1
  • createGame.step (cognitive 24) renderer/game.js:789 — createGame.step has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (4 pts), other 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 · createPunchcard (cognitive 24) · ×1
  • createPunchcard (cognitive 24) renderer/visuals.js:476 — createPunchcard has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 4 (6 pts), boolean chains 5, ternaries 3 (4 pts) (nesting depth added 4). None of this is in the body itself: all 24 points belong to 3 function literals inside it that branch (lines 547, 580, 478). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · createPlayerBar.toggleMode (cognitive 24) · ×1
  • createPlayerBar.toggleMode (cognitive 24) renderer/player.js:325 — createPlayerBar.toggleMode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 4 (6 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 7). Of this number, 17 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · blockCode (cognitive 24) · ×1
  • blockCode (cognitive 24) renderer/tape.js:335 — blockCode has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 2 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). Of this number, 22 points are the body's own statements and 2 belong to 10 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createSpectro.read (cognitive 24) · ×1
  • createSpectro.read (cognitive 24) renderer/spectro.js:228 — createSpectro.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, ternaries 2 (4 pts), other 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLanes.draw (cognitive 24) · ×1
  • createLanes.draw (cognitive 24) renderer/lanes.js:111 — createLanes.draw has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 6, if/else 3, loops 2 (3 pts), error handling 1 (2 pts), other 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 · roll (cognitive 24) · ×1
  • roll (cognitive 24) renderer/stars.js:27 — roll has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (8 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). Of this number, 16 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · update.check (cognitive 23) · ×1
  • update.check (cognitive 23) update.js:67 — update.check has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (7 pts), error handling 1 (3 pts), ternaries 2 (nesting depth added 3). 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.
D2 · Cognitive Complexity · gl-pool.createGlPool (cognitive 23) · ×1
  • gl-pool.createGlPool (cognitive 23) renderer/gl-pool.js:21 — gl-pool.createGlPool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 3, error handling 1 (2 pts) (nesting depth added 6). Of this number, 16 points are the body's own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.searchSpotify (cognitive 23) · ×1
  • library-panel.createLibraryPanel.searchSpotify (cognitive 23) renderer/library-panel.js:364 — library-panel.createLibraryPanel.searchSpotify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, error handling 2 (3 pts), ternaries 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 · present (cognitive 23) · ×1
  • present (cognitive 23) renderer/spaghetti.js:249 — present has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (10 pts), loops 5 (7 pts), if/else 2 (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 · card (cognitive 23) · ×1
  • card (cognitive 23) renderer/spaghetti.js:332 — card has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (9 pts), ternaries 8, boolean chains 3, if/else 3 (nesting depth added 4). Of this number, 21 points are the body's own statements and 2 belong to one function item inside it that branches. 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 · createSpectro.drawMarks (cognitive 23) · ×1
  • createSpectro.drawMarks (cognitive 23) renderer/spectro.js:263 — createSpectro.drawMarks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, ternaries 2 (4 pts), loops 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 · createFire (cognitive 23) · ×1
  • createFire (cognitive 23) renderer/fire.js:39 — createFire has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5, boolean chains 3, other 2, ternaries 1 (nesting depth added 6). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 52). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · radio.icyTitles.<returned closure> (cognitive 22) · ×1
  • radio.icyTitles.<returned closure> (cognitive 22) helpers/radio.cjs:11 — radio.icyTitles.<returned closure> has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · spotify.createWebApi.control (cognitive 22) · ×1
  • spotify.createWebApi.control (cognitive 22) helpers/spotify.cjs:398 — spotify.createWebApi.control has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (8 pts), ternaries 2, error handling 1 (nesting depth added 1). 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.
D2 · Cognitive Complexity · glass.createGlass.draw (cognitive 22) · ×1
  • glass.createGlass.draw (cognitive 22) renderer/glass.js:400 — glass.createGlass.draw has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, error handling 1 (2 pts), 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 · scenery.drawGardenKoi · ×1
  • scenery.drawGardenKoi::spot (cognitive 22) renderer/scenery.js:5005 — scenery.drawGardenKoi::spot has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, ternaries 4 (9 pts), if/else 3 (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. This shape REPEATS in the file: one other method here (scenery.drawGardenKoi) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · controls.createControls.mount (cognitive 22) · ×1
  • controls.createControls.mount (cognitive 22) renderer/controls.js:75 — controls.createControls.mount has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 15 points are the body's own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · app.eng.on.drop (cognitive 22) · ×1
  • app.eng.on.drop (cognitive 22) renderer/app.js:1012 — app.eng.on.drop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · createLibraryPanel.paintHead (cognitive 22) · ×1
  • createLibraryPanel.paintHead (cognitive 22) renderer/library-panel.js:236 — createLibraryPanel.paintHead has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 7 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLibraryPanel.finishInput (cognitive 22) · ×1
  • createLibraryPanel.finishInput (cognitive 22) renderer/library-panel.js:1274 — createLibraryPanel.finishInput has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, other 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · createGame.judge (cognitive 22) · ×1
  • createGame.judge (cognitive 22) renderer/game.js:290 — createGame.judge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (8 pts), boolean chains 3 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · rebuild (cognitive 22) · ×1
  • rebuild (cognitive 22) renderer/rebuild.js:363 — rebuild has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), boolean chains 2, other 2 (nesting depth added 7). Of this number, 21 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createSpectro.makeColumn (cognitive 22) · ×1
  • createSpectro.makeColumn (cognitive 22) renderer/spectro.js:190 — createSpectro.makeColumn has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (8 pts), ternaries 5 (8 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 6). Of this number, 20 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createGlass.draw (cognitive 22) · ×1
  • createGlass.draw (cognitive 22) renderer/glass.js:400 — createGlass.draw has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, error handling 1 (2 pts), 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 · createCard.fromCamera (cognitive 22) · ×1
  • createCard.fromCamera (cognitive 22) renderer/card.js:68 — createCard.fromCamera has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · createControls.mount (cognitive 22) · ×1
  • createControls.mount (cognitive 22) renderer/controls.js:75 — createControls.mount has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 15 points are the body's own statements and 7 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rings.createSpiral.draw (cognitive 21) · ×1
  • rings.createSpiral.draw (cognitive 21) renderer/rings.js:47 — rings.createSpiral.draw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 7). Of this number, 16 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Noodles.step (cognitive 21) · ×1
  • Noodles.step (cognitive 21) renderer/noodles.js:146 — Noodles.step has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · spaghetti.createSpaghetti.encode (cognitive 21) · ×1
  • spaghetti.createSpaghetti.encode (cognitive 21) renderer/spaghetti.js:694 — spaghetti.createSpaghetti.encode has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), loops 3 (nesting depth added 2). 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.
D2 · Cognitive Complexity · scenery.pixAtlas (cognitive 21) · ×1
  • scenery.pixAtlas (cognitive 21) renderer/scenery.js:5452 — scenery.pixAtlas has cognitive complexity 21 (threshold 15). Drivers by points: loops 12 (16 pts), if/else 3 (5 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · cuts.createCuts.listen (cognitive 21) · ×1
  • cuts.createCuts.listen (cognitive 21) renderer/cuts.js:290 — cuts.createCuts.listen has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · player.createPlayerBar.toggleMode (cognitive 21) · ×1
  • player.createPlayerBar.toggleMode (cognitive 21) renderer/player.js:325 — player.createPlayerBar.toggleMode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (5 pts), boolean chains 3, error handling 1 (nesting depth added 6). Of this number, 14 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.spSongs (cognitive 21) · ×1
  • library-panel.createLibraryPanel.spSongs (cognitive 21) renderer/library-panel.js:689 — library-panel.createLibraryPanel.spSongs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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 · library-panel.createLibraryPanel.finishInput (cognitive 21) · ×1
  • library-panel.createLibraryPanel.finishInput (cognitive 21) renderer/library-panel.js:1274 — library-panel.createLibraryPanel.finishInput has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · take-replay.replay (cognitive 21) · ×1
  • take-replay.replay (cognitive 21) renderer/take-replay.js:83 — take-replay.replay has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (advance, a function literal at line 132). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createLibraryPanel.paintArt (cognitive 21) · ×1
  • createLibraryPanel.paintArt (cognitive 21) renderer/library-panel.js:165 — createLibraryPanel.paintArt has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), loops 2 (3 pts), ternaries 3, error handling 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · createLibraryPanel.halfSrc (cognitive 21) · ×1
  • createLibraryPanel.halfSrc (cognitive 21) renderer/library-panel.js:193 — createLibraryPanel.halfSrc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts), ternaries 2 (nesting depth added 9). Of this number, 13 points are the body's own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createLibraryPanel.spSongs (cognitive 21) · ×1
  • createLibraryPanel.spSongs (cognitive 21) renderer/library-panel.js:689 — createLibraryPanel.spSongs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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 · lcdBottom (cognitive 21) · ×1
  • lcdBottom (cognitive 21) renderer/gameskins.js:280 — lcdBottom has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 5, boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 296). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · retire (cognitive 21) · ×1
  • retire (cognitive 21) renderer/spaghetti.js:283 — retire has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 4 (5 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 · createSpaghetti.encode (cognitive 21) · ×1
  • createSpaghetti.encode (cognitive 21) renderer/spaghetti.js:694 — createSpaghetti.encode has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), loops 3 (nesting depth added 2). 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.
D2 · Cognitive Complexity · createWebApi.control (cognitive 21) · ×1
  • createWebApi.control (cognitive 21) helpers/spotify.cjs:398 — createWebApi.control has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), ternaries 2, error handling 1 (nesting depth added 1). 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.
D2 · Cognitive Complexity · readDrums (cognitive 21) · ×1
  • readDrums (cognitive 21) renderer/rebuild.js:176 — readDrums has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (12 pts), loops 3 (4 pts), boolean chains 3, if/else 2 (nesting depth added 4). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 28 function items inside it that branch (a function literal at line 185, a function literal at line 214, a function literal at line 203, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createPlayerBar.paintSpotify (cognitive 21) · ×1
  • createPlayerBar.paintSpotify (cognitive 21) renderer/player.js:359 — createPlayerBar.paintSpotify has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 7, if/else 5 (6 pts) (nesting depth added 2). Of this number, 17 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · createPlayerBar.press (cognitive 21) · ×1
  • createPlayerBar.press (cognitive 21) renderer/player.js:420 — createPlayerBar.press has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 3 (6 pts), boolean chains 3, ternaries 1 (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 · createCuts.listen (cognitive 21) · ×1
  • createCuts.listen (cognitive 21) renderer/cuts.js:290 — createCuts.listen has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · createSpiral.draw (cognitive 21) · ×1
  • createSpiral.draw (cognitive 21) renderer/rings.js:47 — createSpiral.draw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 7). Of this number, 16 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · onmessage (cognitive 21) · ×1
  • onmessage (cognitive 21) renderer/track-worker.js:94 — onmessage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, error handling 3 (5 pts), ternaries 4, other 1 (nesting depth added 4). Of this number, 18 points are the body's own statements and 3 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · icyTitles (cognitive 21) · ×1
  • icyTitles (cognitive 21) helpers/radio.cjs:9 — icyTitles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). None of this is in the body itself: all 21 points belong to one function literal inside it that branches (line 11). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · gameskins.vfdBottom (cognitive 20) · ×1
  • gameskins.vfdBottom (cognitive 20) renderer/gameskins.js:899 — gameskins.vfdBottom has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 5, boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 910). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · gameboot.createBoot.draw (cognitive 20) · ×1
  • gameboot.createBoot.draw (cognitive 20) renderer/gameboot.js:232 — gameboot.createBoot.draw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · visuals.createPunchcard.sim (cognitive 20) · ×1
  • visuals.createPunchcard.sim (cognitive 20) renderer/visuals.js:547 — visuals.createPunchcard.sim has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · rings.createWheel.draw (cognitive 20) · ×1
  • rings.createWheel.draw (cognitive 20) renderer/rings.js:136 — rings.createWheel.draw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2 (nesting depth added 5). Of this number, 17 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fire.createFire.sim (cognitive 20) · ×1
  • fire.createFire.sim (cognitive 20) renderer/fire.js:52 — fire.createFire.sim has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · player.modesFor (cognitive 20) · ×1
  • player.modesFor (cognitive 20) renderer/player.js:100 — player.modesFor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (13 pts), boolean chains 5, if/else 2 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.paintArt (cognitive 20) · ×1
  • library-panel.createLibraryPanel.paintArt (cognitive 20) renderer/library-panel.js:165 — library-panel.createLibraryPanel.paintArt has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), loops 2 (3 pts), ternaries 2, error handling 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · createLibraryPanel.paintBig (cognitive 20) · ×1
  • createLibraryPanel.paintBig (cognitive 20) renderer/library-panel.js:599 — createLibraryPanel.paintBig has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 7, ternaries 4. 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 · askPlayers (cognitive 20) · ×1
  • askPlayers (cognitive 20) main.js:353 — askPlayers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, error handling 2 (4 pts), ternaries 2 (4 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 · createPageTurner (cognitive 20) · ×1
  • createPageTurner (cognitive 20) renderer/game.js:204 — createPageTurner has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 pts), ternaries 1 (2 pts) (nesting depth added 2). None of this is in the body itself: all 20 points belong to 2 function literals inside it that branch (lines 207, 211). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · barEvents (cognitive 20) · ×1
  • barEvents (cognitive 20) renderer/tape.js:209 — barEvents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 4). Of this number, 14 points are the body's own statements and 6 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · createCodeView.render (cognitive 20) · ×1
  • createCodeView.render (cognitive 20) renderer/codeview.js:244 — createCodeView.render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 4 (5 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (rawPiece, piece, a function literal at line 270, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createCuts.partAt (cognitive 20) · ×1
  • createCuts.partAt (cognitive 20) renderer/cuts.js:262 — createCuts.partAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, loops 1, other 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 · createCard.dither (cognitive 20) · ×1
  • createCard.dither (cognitive 20) renderer/card.js:178 — createCard.dither has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (12 pts), loops 3 (4 pts), boolean chains 3, if/else 1 (nesting depth added 8). Of this number, 18 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createWheel.draw (cognitive 20) · ×1
  • createWheel.draw (cognitive 20) renderer/rings.js:136 — createWheel.draw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2 (nesting depth added 5). Of this number, 17 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · main.spotify (cognitive 19) · ×1
  • main.spotify (cognitive 19) main.js:504 — main.spotify has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (14 pts), error handling 1 (3 pts), boolean chains 1, if/else 1 (nesting depth added 9). Of this number, 16 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createGame.step (cognitive 19) · ×1
  • game.createGame.step (cognitive 19) renderer/game.js:789 — game.createGame.step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · card.createCard.fromCamera (cognitive 19) · ×1
  • card.createCard.fromCamera (cognitive 19) renderer/card.js:68 — card.createCard.fromCamera has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · fire.createFire.step (cognitive 19) · ×1
  • fire.createFire.step (cognitive 19) renderer/fire.js:117 — fire.createFire.step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dancers.pick (cognitive 19) · ×1
  • Dancers.pick (cognitive 19) renderer/noodles.js:516 — Dancers.pick has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts), ternaries 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 · spectro.createSpectro.drawMarks (cognitive 19) · ×1
  • spectro.createSpectro.drawMarks (cognitive 19) renderer/spectro.js:263 — spectro.createSpectro.drawMarks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, loops 3 (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 · wait.createWait.paint (cognitive 19) · ×1
  • wait.createWait.paint (cognitive 19) renderer/wait.js:85 — wait.createWait.paint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), ternaries 1 (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.
D2 · Cognitive Complexity · cuts.createCuts.partAt (cognitive 19) · ×1
  • cuts.createCuts.partAt (cognitive 19) renderer/cuts.js:262 — cuts.createCuts.partAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, 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 · library-panel.createLibraryPanel.paintBig (cognitive 19) · ×1
  • library-panel.createLibraryPanel.paintBig (cognitive 19) renderer/library-panel.js:599 — library-panel.createLibraryPanel.paintBig has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7, ternaries 2. 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.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.artistRows (cognitive 19) · ×1
  • library-panel.createLibraryPanel.artistRows (cognitive 19) renderer/library-panel.js:836 — library-panel.createLibraryPanel.artistRows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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 · rebuild.flux (cognitive 19) · ×1
  • rebuild.flux (cognitive 19) renderer/rebuild.js:64 — rebuild.flux has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · seaCells (cognitive 19) · ×1
  • seaCells (cognitive 19) renderer/scenery.js:6231 — seaCells has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · radioTitle (cognitive 19) · ×1
  • radioTitle (cognitive 19) renderer/app.js:933 — radioTitle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1 (3 pts), ternaries 2 (nesting depth added 6). Of this number, 14 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · makeLibrary (cognitive 19) · ×1
  • makeLibrary (cognitive 19) renderer/app.js:3143 — makeLibrary has cognitive complexity 19 (threshold 15). Drivers by points: error handling 3 (6 pts), ternaries 3 (6 pts), if/else 2 (4 pts), boolean chains 2, other 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 28 function items inside it that branch (play, search, blocked, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createLibraryPanel.artistRows (cognitive 19) · ×1
  • createLibraryPanel.artistRows (cognitive 19) renderer/library-panel.js:836 — createLibraryPanel.artistRows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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 · staff.step (cognitive 19) · ×1
  • staff.step (cognitive 19) renderer/orb.js:170 — staff.step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts), other 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 · createCodeView.update (cognitive 19) · ×1
  • createCodeView.update (cognitive 19) renderer/codeview.js:311 — createCodeView.update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · extras (cognitive 19) · ×1
  • extras (cognitive 19) renderer/cover-palette.js:167 — extras has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (6 pts), loops 3, ternaries 1 (nesting depth added 3). Of this number, 14 points are the body's own statements and 5 belong to 10 function items inside it that branch. 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.
D2 · Cognitive Complexity · listWithKey (cognitive 19) · ×1
  • listWithKey (cognitive 19) helpers/youtube.cjs:265 — listWithKey has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), loops 2 (3 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 · readScenes (cognitive 19) · ×1
  • readScenes (cognitive 19) renderer/library-core.js:82 — readScenes has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (7 pts), ternaries 2, loops 1 (nesting depth added 3). Of this number, 13 points are the body's own statements and 6 belong to 3 function items inside it that branch. 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.
D2 · Cognitive Complexity · createFire.step (cognitive 19) · ×1
  • createFire.step (cognitive 19) renderer/fire.js:117 — createFire.step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createWait.paint (cognitive 19) · ×1
  • createWait.paint (cognitive 19) renderer/wait.js:85 — createWait.paint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), ternaries 1 (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.
D2 · Cognitive Complexity · createPalette (cognitive 19) · ×1
  • createPalette (cognitive 19) renderer/palette.js:47 — createPalette has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 4). None of this is in the body itself: all 19 points belong to 3 function literals inside it that branch (lines 103, 118, 126). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · now-coding.html.stepTyper (cognitive 18) · ×1
  • now-coding.html.stepTyper (cognitive 18) prototype/now-coding.html:1140 — now-coding.html.stepTyper has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (4 pts), boolean chains 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 · codegen.calm (cognitive 18) · ×1
  • codegen.calm (cognitive 18) renderer/codegen.js:273 — codegen.calm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · codeview.createCodeView.update (cognitive 18) · ×1
  • codeview.createCodeView.update (cognitive 18) renderer/codeview.js:311 — codeview.createCodeView.update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · game.createPageTurner.<returned closure> (cognitive 18) · ×1
  • game.createPageTurner.<returned closure> (cognitive 18) renderer/game.js:207 — game.createPageTurner.<returned closure> has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 pts) (nesting depth added 1). 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.
D2 · Cognitive Complexity · lanes.createLanes.draw (cognitive 18) · ×1
  • lanes.createLanes.draw (cognitive 18) renderer/lanes.js:111 — lanes.createLanes.draw has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3, loops 2 (3 pts), ternaries 3, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · song-memory.createSongMemory.put (cognitive 18) · ×1
  • song-memory.createSongMemory.put (cognitive 18) renderer/song-memory.js:41 — song-memory.createSongMemory.put has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), loops 2 (3 pts) (nesting depth added 2). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
D2 · Cognitive Complexity · player.createPlayerBar.sendToSystem (cognitive 18) · ×1
  • player.createPlayerBar.sendToSystem (cognitive 18) renderer/player.js:400 — player.createPlayerBar.sendToSystem has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 6, boolean chains 3, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.halfSrc (cognitive 18) · ×1
  • library-panel.createLibraryPanel.halfSrc (cognitive 18) renderer/library-panel.js:193 — library-panel.createLibraryPanel.halfSrc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). Of this number, 12 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · library-panel.createLibraryPanel.paintKeys (cognitive 18) · ×1
  • library-panel.createLibraryPanel.paintKeys (cognitive 18) renderer/library-panel.js:996 — library-panel.createLibraryPanel.paintKeys has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · app.takeBegin (cognitive 18) · ×1
  • app.takeBegin (cognitive 18) renderer/app.js:2195 — app.takeBegin has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 4, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · playQueue (cognitive 18) · ×1
  • playQueue (cognitive 18) renderer/app.js:578 — playQueue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 2). Of this number, 14 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · failure (cognitive 18) · ×1
  • failure (cognitive 18) helpers/spotify.cjs:251 — failure has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 7, error handling 1, ternaries 1. 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.
D2 · Cognitive Complexity · dom-time.createAnimationDriver.drive (cognitive 17) · ×1
  • dom-time.createAnimationDriver.drive (cognitive 17) renderer/dom-time.js:21 — dom-time.createAnimationDriver.drive has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 3 (5 pts), boolean chains 2, error handling 1 (2 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 · codeview.createCodeView.render (cognitive 17) · ×1
  • codeview.createCodeView.render (cognitive 17) renderer/codeview.js:244 — codeview.createCodeView.render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (rawPiece, a function literal at line 270, piece). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · orb.applyMoves (cognitive 17) · ×1
  • orb.applyMoves (cognitive 17) renderer/orb.js:357 — orb.applyMoves 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 · Dancers.room (cognitive 17) · ×1
  • Dancers.room (cognitive 17) renderer/noodles.js:559 — Dancers.room has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (crowd). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · spectro.createSpectro.read (cognitive 17) · ×1
  • spectro.createSpectro.read (cognitive 17) renderer/spectro.js:228 — spectro.createSpectro.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 1 (2 pts), 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 · wait.createWait.draw (cognitive 17) · ×1
  • wait.createWait.draw (cognitive 17) renderer/wait.js:123 — wait.createWait.draw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · app.paletteEntries (cognitive 17) · ×1
  • app.paletteEntries (cognitive 17) renderer/app.js:2851 — app.paletteEntries has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 4, if/else 2. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 2872, 2879, 2918, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · nowplaying.swift.appName (cognitive 17) · ×1
  • nowplaying.swift.appName (cognitive 17) helpers/mac/nowplaying.swift:104 — nowplaying.swift.appName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (2 pts), boolean chains 1, ternaries 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 · createScenery.sceneProgram (cognitive 17) · ×1
  • createScenery.sceneProgram (cognitive 17) renderer/scenery.js:6642 — createScenery.sceneProgram has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 pts), boolean chains 3, ternaries 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 · createLibraryPanel.paintList (cognitive 17) · ×1
  • createLibraryPanel.paintList (cognitive 17) renderer/library-panel.js:969 — createLibraryPanel.paintList has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5 (nesting depth added 6). Of this number, 11 points are the body's own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parseLink (cognitive 17) · ×1
  • parseLink (cognitive 17) helpers/spotify.cjs:433 — parseLink has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createPlayerBar.sendToSystem (cognitive 17) · ×1
  • createPlayerBar.sendToSystem (cognitive 17) renderer/player.js:400 — createPlayerBar.sendToSystem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, ternaries 3 (6 pts), boolean chains 3, error handling 1 (2 pts) (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 · fetchZip (cognitive 17) · ×1
  • fetchZip (cognitive 17) update.js:112 — fetchZip has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (6 pts), boolean chains 4, error handling 3 (4 pts), if/else 3 (nesting depth added 3). Of this number, 14 points are the body's own statements and 3 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · placeLead (cognitive 17) · ×1
  • placeLead (cognitive 17) renderer/melody.js:168 — placeLead has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 4). Of this number, 13 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · checkEnd (cognitive 17) · ×1
  • checkEnd (cognitive 17) helpers/take-store.cjs:151 — checkEnd has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 157, plain, a function literal at line 161, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · tuneFor (cognitive 17) · ×1
  • tuneFor (cognitive 17) renderer/tune.js:44 — tuneFor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4, ternaries 3, error handling 2. Of this number, 16 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. 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.
D2 · Cognitive Complexity · createWait.draw (cognitive 17) · ×1
  • createWait.draw (cognitive 17) renderer/wait.js:123 — createWait.draw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · drawShareCard (cognitive 17) · ×1
  • drawShareCard (cognitive 17) renderer/share-card.js:28 — drawShareCard has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, loops 3, ternaries 2 (3 pts), if/else 1 (nesting depth added 1). Of this number, 14 points are the body's own statements and 3 belong to 5 function items inside it that branch. 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.
D2 · Cognitive Complexity · now-coding.html.updateHighlights (cognitive 16) · ×1
  • now-coding.html.updateHighlights (cognitive 16) prototype/now-coding.html:1201 — now-coding.html.updateHighlights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 4 (6 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 · gameskins.highwayBottom (cognitive 16) · ×1
  • gameskins.highwayBottom (cognitive 16) renderer/gameskins.js:784 — gameskins.highwayBottom has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, if/else 2 (nesting depth added 4). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 796). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · portal.swipeOf (cognitive 16) · ×1
  • portal.swipeOf (cognitive 16) renderer/portal.js:131 — portal.swipeOf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1 (nesting depth added 2). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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 · chrome.createChrome.draw (cognitive 16) · ×1
  • chrome.createChrome.draw (cognitive 16) renderer/chrome.js:453 — chrome.createChrome.draw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 2 (6 pts), boolean chains 4 (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 · Noodles.feed (cognitive 16) · ×1
  • Noodles.feed (cognitive 16) renderer/noodles.js:90 — Noodles.feed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scenery.createScenery.sceneProgram (cognitive 16) · ×1
  • scenery.createScenery.sceneProgram (cognitive 16) renderer/scenery.js:6642 — scenery.createScenery.sceneProgram has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 pts), boolean chains 3 (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 · player.controlsFor (cognitive 16) · ×1
  • player.controlsFor (cognitive 16) renderer/player.js:35 — player.controlsFor has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 5, boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · player.createPlayerBar.paintSpotify (cognitive 16) · ×1
  • player.createPlayerBar.paintSpotify (cognitive 16) renderer/player.js:359 — player.createPlayerBar.paintSpotify has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 4 (nesting depth added 1). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, 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 · player.createPlayerBar.press (cognitive 16) · ×1
  • player.createPlayerBar.press (cognitive 16) renderer/player.js:420 — player.createPlayerBar.press has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · applyTheme (cognitive 16) · ×1
  • applyTheme (cognitive 16) renderer/app.js:1079 — applyTheme has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · createEventLedger · ×1
  • createEventLedger::restore (cognitive 16) renderer/engine.js:105 — createEventLedger::restore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · osPads (cognitive 16) · ×1
  • osPads (cognitive 16) renderer/gameskins.js:443 — osPads has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 3, loops 1 (2 pts), boolean chains 1 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (a function literal at line 453, fs, a function literal at line 466). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createPlayerBar.where (cognitive 16) · ×1
  • createPlayerBar.where (cognitive 16) renderer/player.js:202 — createPlayerBar.where has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 pts) (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 · eventCode (cognitive 16) · ×1
  • eventCode (cognitive 16) renderer/tape.js:296 — eventCode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3, ternaries 2 (3 pts), boolean chains 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 310, a function literal at line 306, (anonymous)::token, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createChrome.draw (cognitive 16) · ×1
  • createChrome.draw (cognitive 16) renderer/chrome.js:453 — createChrome.draw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 2 (6 pts), boolean chains 4 (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 · line (cognitive 16) · ×1
  • line (cognitive 16) renderer/cuts.js:79 — line has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (6 pts), if/else 3 (4 pts), loops 2 (3 pts), boolean chains 2, other 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · closeUpRect (cognitive 16) · ×1
  • closeUpRect (cognitive 16) renderer/fx.js:159 — closeUpRect has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · readLinks (cognitive 16) · ×1
  • readLinks (cognitive 16) renderer/library-core.js:167 — readLinks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). Of this number, 14 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createControls.refresh (cognitive 16) · ×1
  • createControls.refresh (cognitive 16) renderer/controls.js:179 — createControls.refresh has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), boolean chains 2, loops 2, other 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 · createTracker.open (cognitive 16) · ×1
  • createTracker.open (cognitive 16) renderer/tracking.js:31 — createTracker.open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, ternaries 1. None of this is in the body itself: all 16 points belong to 4 function items inside it that branch (onmessage, onerror, a function literal at line 36, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · createEar.onmessage (cognitive 16) · ×1
  • createEar.onmessage (cognitive 16) renderer/ear.js:38 — createEar.onmessage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · createAnimationDriver · ×1
  • createAnimationDriver::drive (cognitive 16) renderer/dom-time.js:21 — createAnimationDriver::drive has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 3 (5 pts), boolean chains 2, error handling 1 (2 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D3 · God Classes · MethodTooLong · ×1
  • MethodTooLong: Dancer.dance renderer/noodles.js:750 — MethodTooLong — dance runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D35 · Change Coupling · Change coupling · ×1
  • Change coupling: news.js ↔ scenery.js renderer/news.js:1 — `renderer/news.js` and `renderer/scenery.js` change together 100% of the time (10 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `234ffcce` Toaster 0.5.4; `7115f378` Toaster 0.5.3; `01151f2f` Toaster 0.4.15 — run `git show` on any of them.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (3 members, 5 shared lines) · ×1
  • Near-duplicate member family (3 members, 5 shared lines) tools/handheld/clear.py:56 — tools/handheld/clear.py:56-64 | tools/handheld/concepts/cc.py:31-39 | tools/handheld/model.py:45-53 — These 3 members are variants of one another: a block of 5 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) tools/handheld/clear.py:395 — tools/handheld/clear.py:395-405 | tools/handheld/model.py:306-317 — 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 (4 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 11+ corresponding lines) tools/handheld/concepts/labels_jp.py:16 — tools/handheld/concepts/labels_jp.py:16-26 | tools/handheld/concepts/stickers2.py:14-28 | tools/handheld/concepts/tex_wide.py:14-26 | tools/handheld/concepts/textures.py:16-32 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 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 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 12+ corresponding lines) tools/handheld/concepts/stickers2.py:288 — tools/handheld/concepts/stickers2.py:288-299 | tools/handheld/concepts/textures.py:35-49 | tools/handheld/concepts/textures.py:100-112 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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 copies of one member (3 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 10+ corresponding lines) tools/handheld/clear.py:74 — tools/handheld/clear.py:74-85 | tools/handheld/concepts/cc.py:49-58 | tools/handheld/model.py:63-75 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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 copies of one member (3 members, 8+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 8+ corresponding lines) tools/handheld/clear.py:296 — tools/handheld/clear.py:296-303 | tools/handheld/concepts/cc.py:192-201 | tools/handheld/model.py:204-211 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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 copies of one member (3 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 5+ corresponding lines) tools/handheld/clear.py:438 — tools/handheld/clear.py:438-442 | tools/handheld/concepts/cc.py:204-209 | tools/handheld/model.py:348-352 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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 (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) tools/handheld/clear.py:158 — tools/handheld/clear.py:158-161 | tools/handheld/model.py:133-136 — These two members are one piece of code written twice and then edited apart: 4 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, 2+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 2+ corresponding lines) tools/handheld/clear.py:70 — tools/handheld/clear.py:70-71 | tools/handheld/concepts/cc.py:45-46 | tools/handheld/model.py:59-60 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 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 copies of one member (3 members, 1+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 1+ corresponding lines) tools/handheld/clear.py:67 — tools/handheld/clear.py:67-67 | tools/handheld/concepts/cc.py:42-42 | tools/handheld/model.py:56-56 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 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 copies of one member (3 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 4+ corresponding lines) tools/handheld/clear.py:96 — tools/handheld/clear.py:96-99 | tools/handheld/concepts/cc.py:89-92 | tools/handheld/model.py:83-86 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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 · Duplicated block (2–5 lines × 3) · ×1
  • Duplicated block (2–5 lines × 3) tools/handheld/clear.py:81 — tools/handheld/clear.py:81-85 | tools/handheld/concepts/cc.py:54-55 | tools/handheld/model.py:71-75 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `tools/handheld/clear.py:81` calls `to_mesh`, `free` and `tools/handheld/concepts/cc.py:54` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
P12 · CI test-gate honesty · Test suite runs only after the merge · ×1
  • Test suite runs only after the merge — `REDACTED` run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) — so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging call was found in the 123 JavaScript/TypeScript, Swift production file(s) this check read across 2 module(s). Each was searched for its ecosystem's logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Swift: os.Logger/os_log/NSLog, swift-log, CocoaLumberjack, SwiftyBeaver, XCGLogger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×1
  • Outbound HTTP without resilience helpers/spotify.cjs:100 — `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 0 typed · 323 plain JS — the untyped files are helpers/issue-url.cjs, helpers/library-worker.cjs, helpers/library.cjs, helpers/mac-update.cjs, helpers/player.cjs, helpers/radio.cjs (+317 more).
R10 · Code Duplication · Duplication concentrated across 3 sibling directories (6 clone groups) · ×1
  • Duplication concentrated across 3 sibling directories (6 clone groups) renderer/take-replay.js:27 — 6 of the duplicated blocks reported below have copies in at least two of the sibling directories helpers, renderer, tools under the repository root. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block with local edits (93 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (93 matched lines × 2 locations) renderer/backrooms.js:80 — renderer/backrooms.js:80 · renderer/earth.js:89 — the two spans are one implementation copied and then locally edited — 1322 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (30 matched lines × 2 locations) renderer/dotcam.js:153 — renderer/dotcam.js:153 · renderer/voxcam.js:144 — the two spans are one implementation copied and then locally edited — 442 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (25 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (25 matched lines × 2 locations) renderer/take-replay.js:27 — renderer/take-replay.js:27 · tools/clock-harness-page.js:77 — the two spans are one implementation copied and then locally edited — 392 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (23 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (23 matched lines × 2 locations) renderer/scenery.js:6712 — renderer/scenery.js:6712 · renderer/wait.js:19 — the two spans are one implementation copied and then locally edited — 309 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (18 lines × 2 locations) · ×1
  • Duplicated block (18 lines × 2 locations) renderer/audio-tags.js:190 — renderer/audio-tags.js:190 · renderer/embedded-cover.js:78 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (18 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (18 matched lines × 2 locations) renderer/portal.js:606 — renderer/portal.js:606 · renderer/portal.js:656 — the two spans are one implementation copied and then locally edited — 214 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (15 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (15 matched lines × 2 locations) main.js:376 — main.js:376 · main.js:414 — the two spans are one implementation copied and then locally edited — 92 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (12 lines × 2 locations) · ×1
  • Duplicated block (12 lines × 2 locations) renderer/lens.js:458 — renderer/lens.js:458 · renderer/portal.js:840 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (11 lines × 2 locations) · ×1
  • Duplicated block (11 lines × 2 locations) renderer/glass.js:166 — renderer/glass.js:166 · renderer/orb.js:492 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block with local edits (10 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (10 matched lines × 2 locations) helpers/player.cjs:118 — helpers/player.cjs:118 · helpers/player.cjs:145 — the two spans are one implementation copied and then locally edited — 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (10 lines × 3 locations) · ×1
  • Duplicated block (10 lines × 3 locations) renderer/glitchorb.js:89 — renderer/glitchorb.js:89 · renderer/lens.js:349 · renderer/portal.js:519 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (10 lines × 2 locations) · ×1
  • Duplicated block (10 lines × 2 locations) tools/detbench/harmony.mjs:71 — tools/detbench/harmony.mjs:71 · tools/exportbench.mjs:239 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (9 lines × 3 locations) · ×1
  • Duplicated block (9 lines × 3 locations) renderer/chrome.js:203 — renderer/chrome.js:203 · renderer/spaghetti.js:567 · renderer/worlds.js:1237 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (8 lines × 3 locations) · ×1
  • Duplicated block (8 lines × 3 locations) renderer/glass.js:401 — renderer/glass.js:401 · renderer/lens.js:458 · renderer/portal.js:840 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 221, cognitive 267) · ×1
  • Complex function draw (cyclomatic 221, cognitive 267) renderer/scenery.js:6912 — draw has cyclomatic complexity 221 and cognitive complexity 267; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 141, cognitive 184) · ×1
  • Complex function draw (cyclomatic 141, cognitive 184) renderer/portal.js:838 — draw has cyclomatic complexity 141 and cognitive complexity 184; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function newBar (cyclomatic 130, cognitive 259) · ×1
  • Complex function newBar (cyclomatic 130, cognitive 259) renderer/engine.js:1917 — newBar has cyclomatic complexity 130 and cognitive complexity 259; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 93, cognitive 113) · ×1
  • Complex function (anonymous) (cyclomatic 93, cognitive 113) tools/spotify-fake.mjs:79 — (anonymous) has cyclomatic complexity 93 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function tempoUpdate (cyclomatic 91, cognitive 98) · ×1
  • Complex function tempoUpdate (cyclomatic 91, cognitive 98) renderer/engine.js:2488 — tempoUpdate has cyclomatic complexity 91 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 90, cognitive 126) · ×1
  • Complex function draw (cyclomatic 90, cognitive 126) renderer/lens.js:457 — draw has cyclomatic complexity 90 and cognitive complexity 126; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 87, cognitive 108) · ×1
  • Complex function draw (cyclomatic 87, cognitive 108) renderer/worlds.js:1716 — draw has cyclomatic complexity 87 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function dance (cyclomatic 82, cognitive 103) · ×1
  • Complex function dance (cyclomatic 82, cognitive 103) renderer/noodles.js:750 — dance has cyclomatic complexity 82 and cognitive complexity 103; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 72, cognitive 114) · ×1
  • Complex function (anonymous) (cyclomatic 72, cognitive 114) renderer/scenery.js:6771 — (anonymous) has cyclomatic complexity 72 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function scoreExportRun (cyclomatic 72, cognitive 101) · ×1
  • Complex function scoreExportRun (cyclomatic 72, cognitive 101) tools/exportbench.mjs:300 — scoreExportRun has cyclomatic complexity 72 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function updatePhase (cyclomatic 72, cognitive 96) · ×1
  • Complex function updatePhase (cyclomatic 72, cognitive 96) renderer/engine.js:2998 — updatePhase has cyclomatic complexity 72 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function drawFrame (cyclomatic 71, cognitive 88) · ×1
  • Complex function drawFrame (cyclomatic 71, cognitive 88) renderer/app.js:2459 — drawFrame has cyclomatic complexity 71 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function scoreHarmony (cyclomatic 69, cognitive 114) · ×1
  • Complex function scoreHarmony (cyclomatic 69, cognitive 114) tools/detbench/harmony.mjs:82 — scoreHarmony has cyclomatic complexity 69 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function pixFor (cyclomatic 64, cognitive 110) · ×1
  • Complex function pixFor (cyclomatic 64, cognitive 110) renderer/scenery.js:5485 — pixFor has cyclomatic complexity 64 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function drawBoat (cyclomatic 61, cognitive 125) · ×1
  • Complex function drawBoat (cyclomatic 61, cognitive 125) renderer/scenery.js:5715 — drawBoat has cyclomatic complexity 61 and cognitive complexity 125; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function frame (cyclomatic 61, cognitive 75) · ×1
  • Complex function frame (cyclomatic 61, cognitive 75) renderer/engine.js:775 — frame has cyclomatic complexity 61 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function swimSharks (cyclomatic 57, cognitive 106) · ×1
  • Complex function swimSharks (cyclomatic 57, cognitive 106) renderer/scenery.js:6079 — swimSharks has cyclomatic complexity 57 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function pathLine1 (cyclomatic 55, cognitive 135) · ×1
  • Complex function pathLine1 (cyclomatic 55, cognitive 135) renderer/melody.js:64 — pathLine1 has cyclomatic complexity 55 and cognitive complexity 135; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function list (cyclomatic 54, cognitive 64) · ×1
  • Complex function list (cyclomatic 54, cognitive 64) helpers/spotify.cjs:285 — list has cyclomatic complexity 54 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 53, cognitive 130) · ×1
  • Complex function draw (cyclomatic 53, cognitive 130) renderer/visuals.js:249 — draw has cyclomatic complexity 53 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function fluxUpdate (cyclomatic 53, cognitive 54) · ×1
  • Complex function fluxUpdate (cyclomatic 53, cognitive 54) renderer/engine.js:2892 — fluxUpdate has cyclomatic complexity 53 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function scoreSong (cyclomatic 50, cognitive 105) · ×1
  • Complex function scoreSong (cyclomatic 50, cognitive 105) tools/detbench/score.mjs:133 — scoreSong has cyclomatic complexity 50 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function riffNotes (cyclomatic 49, cognitive 81) · ×1
  • Complex function riffNotes (cyclomatic 49, cognitive 81) renderer/codegen.js:112 — riffNotes has cyclomatic complexity 49 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 49, cognitive 81) · ×1
  • Complex function (anonymous) (cyclomatic 49, cognitive 81) REDACTED:1 — (anonymous) has cyclomatic complexity 49 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 49, cognitive 59) · ×1
  • Complex function draw (cyclomatic 49, cognitive 59) renderer/card.js:251 — draw has cyclomatic complexity 49 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function onKey (cyclomatic 49, cognitive 48) · ×1
  • Complex function onKey (cyclomatic 49, cognitive 48) renderer/library-panel.js:1320 — onKey has cyclomatic complexity 49 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function update (cyclomatic 48, cognitive 76) · ×1
  • Complex function update (cyclomatic 48, cognitive 76) renderer/noodles.js:450 — update has cyclomatic complexity 48 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function update (cyclomatic 47, cognitive 49) · ×1
  • Complex function update (cyclomatic 47, cognitive 49) renderer/player.js:243 — update has cyclomatic complexity 47 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function step (cyclomatic 46, cognitive 92) · ×1
  • Complex function step (cyclomatic 46, cognitive 92) renderer/dominoes.js:154 — step has cyclomatic complexity 46 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function onmessage (cyclomatic 46, cognitive 70) · ×1
  • Complex function onmessage (cyclomatic 46, cognitive 70) renderer/stems-worker.js:29 — onmessage has cyclomatic complexity 46 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 46, cognitive 58) · ×1
  • Complex function draw (cyclomatic 46, cognitive 58) renderer/voxcam.js:148 — draw has cyclomatic complexity 46 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function render (cyclomatic 46, cognitive 52) · ×1
  • Complex function render (cyclomatic 46, cognitive 52) helpers/take-render.cjs:61 — render has cyclomatic complexity 46 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function swimFish (cyclomatic 45, cognitive 105) · ×1
  • Complex function swimFish (cyclomatic 45, cognitive 105) renderer/scenery.js:5991 — swimFish has cyclomatic complexity 45 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 44, cognitive 80) · ×1
  • Complex function (anonymous) (cyclomatic 44, cognitive 80) tools/checks.js:395 — (anonymous) has cyclomatic complexity 44 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function model (cyclomatic 42, cognitive 52) · ×1
  • Complex function model (cyclomatic 42, cognitive 52) renderer/game.js:246 — model has cyclomatic complexity 42 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function buildLines (cyclomatic 42, cognitive 50) · ×1
  • Complex function buildLines (cyclomatic 42, cognitive 50) renderer/codegen.js:302 — buildLines has cyclomatic complexity 42 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function harmonyBar (cyclomatic 42, cognitive 49) · ×1
  • Complex function harmonyBar (cyclomatic 42, cognitive 49) renderer/engine.js:2146 — harmonyBar has cyclomatic complexity 42 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function advance (cyclomatic 41, cognitive 64) · ×1
  • Complex function advance (cyclomatic 41, cognitive 64) renderer/spaghetti.js:167 — advance has cyclomatic complexity 41 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function draw (cyclomatic 40, cognitive 59) · ×1
  • Complex function draw (cyclomatic 40, cognitive 59) renderer/storm.js:212 — draw has cyclomatic complexity 40 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function firstUseLoad (cyclomatic 39, cognitive 69) · ×1
  • Complex function firstUseLoad (cyclomatic 39, cognitive 69) tools/first-use-host.cjs:14 — firstUseLoad has cyclomatic complexity 39 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · renderer/scenery.js · ×1
  • renderer/scenery.js: 7222 lines of code renderer/scenery.js:1 — renderer/scenery.js has 7222 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/app.js · ×1
  • renderer/app.js: 3341 lines of code renderer/app.js:1 — renderer/app.js has 3341 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/engine.js · ×1
  • renderer/engine.js: 3208 lines of code renderer/engine.js:1 — renderer/engine.js has 3208 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/worlds.js · ×1
  • renderer/worlds.js: 1855 lines of code renderer/worlds.js:1 — renderer/worlds.js has 1855 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 1633 lines of code REDACTED:1 — REDACTED has 1633 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/library-panel.js · ×1
  • renderer/library-panel.js: 1406 lines of code renderer/library-panel.js:1 — renderer/library-panel.js has 1406 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/portal.js · ×1
  • renderer/portal.js: 1108 lines of code renderer/portal.js:1 — renderer/portal.js has 1108 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · tools/checks.js · ×1
  • tools/checks.js: 1031 lines of code tools/checks.js:1 — tools/checks.js has 1031 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · main.js · ×1
  • main.js: 987 lines of code main.js:1 — main.js has 987 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/visuals.js · ×1
  • renderer/visuals.js: 986 lines of code renderer/visuals.js:1 — renderer/visuals.js has 986 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/gameskins.js · ×1
  • renderer/gameskins.js: 979 lines of code renderer/gameskins.js:1 — renderer/gameskins.js has 979 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/noodles.js · ×1
  • renderer/noodles.js: 915 lines of code renderer/noodles.js:1 — renderer/noodles.js has 915 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/spaghetti-kitchen.js · ×1
  • renderer/spaghetti-kitchen.js: 888 lines of code renderer/spaghetti-kitchen.js:1 — renderer/spaghetti-kitchen.js has 888 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/game.js · ×1
  • renderer/game.js: 865 lines of code renderer/game.js:1 — renderer/game.js has 865 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 840 lines of code REDACTED:1 — REDACTED has 840 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/spaghetti.js · ×1
  • renderer/spaghetti.js: 783 lines of code renderer/spaghetti.js:1 — renderer/spaghetti.js has 783 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/orb.js · ×1
  • renderer/orb.js: 747 lines of code renderer/orb.js:1 — renderer/orb.js has 747 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/lens.js · ×1
  • renderer/lens.js: 629 lines of code renderer/lens.js:1 — renderer/lens.js has 629 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · tools/exportbench.mjs · ×1
  • tools/exportbench.mjs: 550 lines of code tools/exportbench.mjs:1 — tools/exportbench.mjs has 550 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/worldlooks.js · ×1
  • renderer/worldlooks.js: 530 lines of code renderer/worldlooks.js:1 — renderer/worldlooks.js has 530 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · helpers/spotify.cjs · ×1
  • helpers/spotify.cjs: 516 lines of code helpers/spotify.cjs:1 — helpers/spotify.cjs has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/tape.js · ×1
  • renderer/tape.js: 475 lines of code renderer/tape.js:1 — renderer/tape.js has 475 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/library.js · ×1
  • renderer/library.js: 463 lines of code renderer/library.js:1 — renderer/library.js has 463 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/codeview.js · ×1
  • renderer/codeview.js: 459 lines of code renderer/codeview.js:1 — renderer/codeview.js has 459 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/chrome.js · ×1
  • renderer/chrome.js: 455 lines of code renderer/chrome.js:1 — renderer/chrome.js has 455 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/rebuild.js · ×1
  • renderer/rebuild.js: 454 lines of code renderer/rebuild.js:1 — renderer/rebuild.js has 454 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/player.js · ×1
  • renderer/player.js: 448 lines of code renderer/player.js:1 — renderer/player.js has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/glass.js · ×1
  • renderer/glass.js: 424 lines of code renderer/glass.js:1 — renderer/glass.js has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/cuts.js · ×1
  • renderer/cuts.js: 418 lines of code renderer/cuts.js:1 — renderer/cuts.js has 418 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · renderer/y2k.js · ×1
  • renderer/y2k.js: 402 lines of code renderer/y2k.js:1 — renderer/y2k.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · No lint or typecheck script · ×1
  • No lint or typecheck script — test ✓ · lint ✗ · typecheck ✗ — read from this repository's REDACTED scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1
  • Third-party script without Subresource Integrity prototype/studio.html:19 — `https://unpkg.com/@strudel/repl@1.3.0` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session.
Minor — 54 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×23
  • Duplicated predicate renderer/backrooms.js:133 — `!failed && (!!loading || !video || video.readyState < 2)` appears character-identically in 2 files — renderer/backrooms.js, renderer/earth.js. 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 renderer/backrooms.js:140 — `Math.abs(video.currentTime - want) < 0.0005 && !video.seeking` appears character-identically in 2 files — renderer/backrooms.js, renderer/earth.js. 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 tools/detbench/harmony.mjs:33 — `a && b && a.root === b.root && a.minor === b.minor` appears character-identically in 2 files — tools/detbench/harmony.mjs, tools/exportbench.mjs. 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 renderer/dotcam.js:160 — `broken || !video || video.readyState < 2 || gl?.isContextLost()` appears character-identically in 2 files — renderer/dotcam.js, renderer/voxcam.js. 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 renderer/backrooms.js:163 — `canvas.width !== W || canvas.height !== H` appears character-identically in 9 files — renderer/backrooms.js, renderer/chrome.js, renderer/earth.js, renderer/fire.js. 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 renderer/cuts.js:32 — `canvas.width !== w || canvas.height !== h` appears character-identically in 10 files — renderer/cuts.js, renderer/gamewarp.js, renderer/glass.js, renderer/handpoints.js. 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 renderer/backrooms.js:136 — `clock.mode !== 'render' || !active || !video || !(video.duration > 0)` appears character-identically in 2 files — renderer/backrooms.js, renderer/earth.js. 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 renderer/dotcam.js:178 — `eng.v.bd.shown?.[((g % 16) + 16) % 16] && eng.present('bd', t)` appears character-identically in 2 files — renderer/dotcam.js, renderer/voxcam.js. 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 renderer/scenery.js:6715 — `getComputedStyle(document.documentElement).getPropertyValue('--font') || 'monospace'` appears character-identically in 2 files — renderer/scenery.js, renderer/wait.js. 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 renderer/dotcam.js:177 — `lastStep === null || step < lastStep || step - lastStep > 8` appears character-identically in 4 files — renderer/dotcam.js, renderer/orb.js, renderer/storm.js, renderer/voxcam.js. 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 tools/take-live-check.mjs:27 — `m.error?.message || m.result.exceptionDetails.exception?.description || 'failed'` appears character-identically in 2 files — tools/take-live-check.mjs, tools/tune-export-check.mjs. 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 tools/detbench/score.mjs:169 — `o.confirmed_by_neural || o.strength >= 0.8` appears character-identically in 2 files — tools/detbench/score.mjs, tools/exportbench.mjs. 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 tools/cdp.mjs:12 — `p.type === 'page' && p.url.includes('index.html')` appears character-identically in 3 files — tools/cdp.mjs, tools/hitch.mjs, tools/take-live-check.mjs. 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 renderer/chrome.js:249 — `par && jobs.done - jobs.at > QUICK_MS && now - jobs.done < SETTLE_MS` appears character-identically in 2 files — renderer/chrome.js, renderer/spaghetti.js. 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 renderer/glass.js:180 — `parallel && !gl.getProgramParameter(prog, parallel.COMPLETION_STATUS_KHR)` appears character-identically in 2 files — renderer/glass.js, renderer/orb.js. 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 helpers/spotify.cjs:441 — `url && (url.protocol === 'https:' || url.protocol === 'http:') && url.hostname === 'open.spotify.com' && !url.username && !url.password && !…` appears character-identically in 2 files — helpers/spotify.cjs, renderer/library.js. 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 tools/event-writers.mjs:100 — `value === 'triangle' || value === 'square'` appears character-identically in 2 files — tools/event-writers.mjs, tools/exportbench.mjs. 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 renderer/backrooms.js:104 — `window.nc?.earthClip || window.takeRender?.earthClip` appears character-identically in 2 files — renderer/backrooms.js, renderer/earth.js. 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 tools/detbench/harmony.mjs:167 — `x !== null && x !== undefined && Number.isFinite(x)` appears character-identically in 3 files — tools/detbench/harmony.mjs, tools/detbench/score.mjs, tools/exportbench.mjs. 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 tools/handheld/concepts/metal.py:313 — `ob.type == 'LIGHT' or ob.name.startswith('sheen')` appears character-identically in 2 files — tools/handheld/concepts/metal.py, tools/handheld/concepts/wide.py. 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 tools/handheld/concepts/metal.py:314 — `ob.type in ('MESH', 'FONT', 'CURVE') and ob != wall` appears character-identically in 2 files — tools/handheld/concepts/metal.py, tools/handheld/concepts/wide.py. 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 tools/handheld/concepts/metal.py:274 — `ob.type not in ('MESH', 'FONT') or ob.hide_render or ob.name == 'wall' or ob.name.startswith('sheen')` appears character-identically in 2 files — tools/handheld/concepts/metal.py, tools/handheld/concepts/wide.py. 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 tools/handheld/assets.py:89 — `peak[sl][part].max() < 48 or part.sum() < 200` appears character-identically in 2 files — tools/handheld/assets.py, tools/handheld/assets_stance.py. 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.
D24 · Comment Value · redundant comment · ×6
  • redundant comment renderer/scenery.js:1189 — "The snow: a log cabin on the far shore of a frozen lake, snow on its roof and on the pines round it, its windows lit; mountains behind; the toaster ice fishing …" repeats the code it sits on: 30 of its 33 words (snow, log, cabin, far, shore, frozen, lake, roof, pines, round, windows, lit, mountains, behind, ice, near, night, aurora, hangs, falls, hats, busy, blown, wind, shimmers, drifts, music, flares, kick, float) are already in `const SNOW = ``. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment renderer/scenery.js:4174 — "The glyphs, each from the sheet, over the paper. In its own colours: each in its colour, on a night sky (darkest overhead) or on the day's paper; or in the them …" repeats the code it sits on: 13 of its 16 words (glyphs, sheet, paper, colours, colour, night, sky, day, theme, ink, background, shows, strength) are already in `const PAINT = `#version 300 es`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment renderer/worldlooks.js:216 — "a cyanotype: a contact print in Prussian blue, brushed on" repeats the code it sits on: 5 of its 6 words (cyanotype, contact, print, blue, brushed) are already in `const CYANOTYPE = `${PREFIX}`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tools/cover-palette.test.mjs:81 — "navy with an orange stripe" repeats the code it sits on: 3 of its 3 words (navy, orange, stripe) are already in `const navy = [14, 24, 70], orange = [255, 140, 20], p = coverPalette(coverPixels('navy with an orange stripe'));`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tools/cover-palette.test.mjs:91 — "red and cyan halves: one of each" repeats the code it sits on: 3 of its 3 words (red, cyan, halves) are already in `const halves = coverPalette(coverPixels('red and cyan halves'));`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tools/embedded-cover.test.mjs:18 — "(a PNG a tag calls a JPEG)" repeats the code it sits on: 4 of its 4 words (png, tag, calls, jpeg) are already in `same(await find(id3Tag({ version: 3, frames: [frame(apicBody(PNG, { mime: 'image/jpeg' }))] })), PNG, 'image/png');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
X7 · Silent fallback defaults · Silent fallback default in catch · ×4
  • Silent fallback default in catch helpers/take-store.cjs:101 — `createTakeStore.list` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch renderer/song-memory.js:63 — `createSongMemory.tried` swallows every exception into `return false` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch renderer/app.js:2185 — `artData` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch tools/detbench/run.mjs:54 — `kickSongs` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found REDACTED:11 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `REDACTED` makes this repository a deployable product (line 11).
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Most of the production code is in directories of its own, but 3 application file(s) sit at the repository root beside the build and tooling files (`main.js`, `preload.js`, `update.js`).
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 2 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 REDACTED:17 — `REDACTED` 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`.
P4 · Deployment & Rollback · No release approval gate · ×1
  • No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
R7 · Dead Code · Unused export 'POST_LAYERS' · ×1
  • Unused export 'POST_LAYERS' REDACTED:25 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'between' · ×1
  • Unused export 'between' renderer/random.js:52 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'whole' · ×1
  • Unused export 'whole' renderer/random.js:53 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'oneOf' · ×1
  • Unused export 'oneOf' renderer/random.js:54 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'CAP' · ×1
  • Unused export 'CAP' renderer/song-memory.js:5 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'SIZE' · ×1
  • Unused export 'SIZE' tools/cover-fixtures.mjs:7 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused module-local declaration 'sameKey' · ×1
  • Unused module-local declaration 'sameKey' tools/exportbench.mjs:24 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'playing' · ×1
  • Unused module-local declaration 'playing' REDACTED:157 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
X2 · Cancellation propagation · Not all async functions that make a request accept an AbortSignal · ×1
  • Not all async functions that make a request accept an AbortSignal — Only 2/8 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
Minor — 4 finding(s)
D10 · Test Quality · Skipped (documented) · ×3
  • Skipped (documented): (unnamed test) tools/spaghetti-sim.test.mjs:39 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) tools/spaghetti-sim.test.mjs:43 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) tools/spaghetti-sim.test.mjs:44 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
D12 · Dependency Hygiene · Outdated (npm) · ×1
  • Outdated (npm): @mediapipe/tasks-vision — @mediapipe/tasks-vision is pinned at 0.10.35; registry.npmjs.org publishes 1.2.3 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.

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 --report-format json --report-path /tmp/watchdog-gitleaks-0ed4522a55a34b0bb32758925fd14d73/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.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-0ed4522a55a34b0bb32758925fd14d73/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 .21artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .4artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1e9b0-9937-732c-b9df-3e686c1f224d · 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