Public report of phaserjs/phaser, published 13 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.3). 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, 13 November 2026, 18:22 UTC · Survey ID cd_b4cca9bd6050472eacf24500a8a09c4f

phaserjs/phaser

Measured 13 November 2026, 18:19 UTC, at code version 02d8931

Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureNoCollector).

Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.

CAI score 62out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 2 since the last survey

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 large codebase: 216,652 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 3.9 person-years · Weakest lens: Code Health, 53

Findings by how serious they are

20 critical 527 serious 235 minor

8 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
13 November 2026, 18:19 UTC

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

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

53of 53 dimensions measured by tools.
771of 782 findings point to an exact file and line, so you can open each one in the code. The other 11 concern the repository as a whole, such as missing documentation.
53dimensions across 5 lenses, read from 216,652 lines of product code in 1 project.
Chapters

Executive summary

phaserjs/phaser falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 62 out of 100 and is rated Adequate, and 14 of its 20 critical findings are security problems in the packages it uses and in the build pipeline.

Code Health, at 53, is the weakest lens and counts most in the score. The best first step is adding type checking, worth about 7 points. Handling the errors the code catches and ignores comes next, worth about 3 points. Raising Code Health to 70 would lift the score to about 69.

Twelve known security holes in the packages the code depends on can be used by attackers. One pipeline tool is referenced by a changeable name, so the build pipeline can be tampered with, and four sets of files in separate parts keep changing together, which points to hidden dependencies. Updating the vulnerable packages, pinning the tool to an exact version and making the hidden dependencies explicit would close these risks. Limiting each secret to its own step would fix the secret exposed to more of the pipeline than needed. The two loops of files that import each other need breaking.

The product code is 216,652 lines, about €560,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.
Code Health 53 · counts for 47%Production Readiness 66 · counts for 26%Maturity 66 · counts for 14%Architecture 83 · counts for 8%Security and Compliance 84 · counts for 4%

If Code Health rose from 53 to 70, the lowest score rated Strong, the score would rise from 62 to about 69.

Code composition: what the lines of code are
Product code 52%Tests 48%
New since the last survey: 22 findings

These 22 critical or serious findings weren't in the previous survey, on 24 October 2026.

  • Dependency Vulnerabilities · REDACTED
  • Dependency Vulnerabilities · REDACTED
  • Cyclomatic Complexity · Complex function createFromObjects (cyclomatic 30, cognitive 50) src/tilemaps/Tilemap.js
  • Cyclomatic Complexity · Complex function renderBody (cyclomatic 28, cognitive 50) src/physics/matter-js/World.js
  • Cyclomatic Complexity · Complex function separate (cyclomatic 28, cognitive 34) src/physics/arcade/World.js
  • Cyclomatic Complexity · Complex function PCTDecode (cyclomatic 27, cognitive 57) src/textures/parsers/PCTDecode.js
  • Cyclomatic Complexity · Complex function GetValueOp (cyclomatic 27, cognitive 49) src/tweens/builders/GetValueOp.js
  • Cyclomatic Complexity · Complex function AddEffectShine (cyclomatic 26, cognitive 31) src/actions/AddEffectShine.js
  • Cyclomatic Complexity · Complex function Run (cyclomatic 25, cognitive 44) src/physics/arcade/ProcessX.js
  • Cyclomatic Complexity · Complex function Run (cyclomatic 25, cognitive 44) src/physics/arcade/ProcessY.js
  • Cyclomatic Complexity · Complex function run (cyclomatic 25, cognitive 40) src/renderer/webgl/renderNodes/DynamicTextureHandler.js
  • Cyclomatic Complexity · Complex function CreateRenderer (cyclomatic 25, cognitive 35) src/core/CreateRenderer.js
  • Cyclomatic Complexity · Complex function _renderCanvas (cyclomatic 25, cognitive 34) src/textures/DynamicTexture.js
  • Cyclomatic Complexity · Complex function _completeLayout (cyclomatic 25, cognitive 28) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js
  • Cyclomatic Complexity · Complex function _copyAndCompleteConfig (cyclomatic 25, cognitive 26) src/renderer/webgl/renderNodes/BatchHandler.js
  • Cyclomatic Complexity · Complex function LineToRectangle (cyclomatic 25, cognitive 24) src/geom/intersects/LineToRectangle.js
  • Cyclomatic Complexity · Complex function ParseGID (cyclomatic 25, cognitive 16) src/tilemaps/parsers/tiled/ParseGID.js
  • Cyclomatic Complexity · Complex function HashSimplex (cyclomatic 24, cognitive 26) src/math/HashSimplex.js
  • Cyclomatic Complexity · Complex function _setAnimatedValue (cyclomatic 23, cognitive 35) src/gameobjects/spritegpulayer/SpriteGPULayer.js
  • Cyclomatic Complexity · Complex function collideSpriteVsGroup (cyclomatic 23, cognitive 34) src/physics/arcade/World.js
  • Cyclomatic Complexity · Complex function batchSprite (cyclomatic 23, cognitive 32) src/renderer/canvas/CanvasRenderer.js
  • Cyclomatic Complexity · Complex function setConstraintRenderStyle (cyclomatic 23, cognitive 23) src/physics/matter-js/World.js

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 1354 findings

These 1354 critical or serious findings were in the previous survey, on 24 October 2026, and are gone from this one. The first 100 are listed here.

  • Churn × Complexity Hotspots · Hotspot: src/renderer/webgl/DrawingContext.js src/renderer/webgl/DrawingContext.js
  • Secrets (history) · High secret: WD-SECRET-0005 REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Code Duplication · Duplicated block with local edits (48 matched lines × 2 locations) src/gameobjects/particles/ParticleEmitterCanvasRenderer.js
  • Code Duplication · Duplicated block with local edits (47 matched lines × 2 locations) src/math/Quaternion.js
  • Code Duplication · Duplicated block (45 lines × 3 locations) src/renderer/webgl/renderNodes/submitter/SubmitterQuad.js
  • Code Duplication · Duplicated block (45 lines × 2 locations) src/utils/array/Add.js
  • Code Duplication · Duplicated block with local edits (43 matched lines × 2 locations) src/gameobjects/shape/arc/Arc.js
  • Code Duplication · Duplicated block (43 lines × 3 locations) src/renderer/webgl/renderNodes/BatchHandlerQuad.js
  • Code Duplication · Duplicated block (42 lines × 2 locations) src/gameobjects/shape/isobox/IsoBox.js
  • Code Duplication · Duplicated block (42 lines × 2 locations) src/loader/filetypes/AsepriteFile.js
  • Code Duplication · Duplicated block (42 lines × 2 locations) src/renderer/webgl/WebGLRenderer.js
  • Code Duplication · Duplicated block (42 lines × 2 locations) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js
  • Code Duplication · Duplicated block (41 lines × 2 locations) src/gameobjects/graphics/Graphics.js
  • Code Duplication · Duplicated block (41 lines × 2 locations) src/physics/matter-js/World.js
  • Code Duplication · Duplicated block (40 lines × 2 locations) src/loader/filetypes/PluginFile.js
  • Code Duplication · Duplicated block with local edits (40 matched lines × 2 locations) src/physics/matter-js/MatterImage.js
  • Code Duplication · Duplicated block (38 lines × 2 locations) src/gameobjects/DisplayList.js
  • Code Duplication · Duplicated block (38 lines × 2 locations) src/gameobjects/components/Texture.js
  • Code Duplication · Duplicated block with local edits (38 matched lines × 2 locations) src/math/Vector3.js
  • Code Duplication · Duplicated block (38 lines × 2 locations) src/renderer/webgl/renderNodes/transformer/TransformerImage.js
  • Code Duplication · Duplicated block (38 lines × 2 locations) src/textures/TextureManager.js
  • Code Duplication · Duplicated block with local edits (37 matched lines × 2 locations) src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextWebGLRenderer.js
  • Code Duplication · Duplicated block with local edits (37 matched lines × 2 locations) src/gameobjects/image/Image.js
  • Code Duplication · Duplicated block (37 lines × 2 locations) src/physics/arcade/SeparateX.js
  • Code Duplication · Duplicated block (37 lines × 2 locations) src/renderer/webgl/renderNodes/BatchHandlerQuad.js
  • Code Duplication · Duplicated block (36 lines × 2 locations) src/gameobjects/stencil/Stencil.js
  • Code Duplication · Duplicated block with local edits (35 matched lines × 2 locations) src/loader/filetypes/CompressedTextureFile.js
  • Code Duplication · Duplicated block with local edits (34 matched lines × 2 locations) src/gameobjects/text/TextStyle.js
  • Code Duplication · Duplicated block (34 lines × 2 locations) src/geom/line/Line.js
  • Code Duplication · Duplicated block (34 lines × 2 locations) src/sound/BaseSoundManager.js
  • Code Duplication · Duplicated block (33 lines × 2 locations) src/gameobjects/GameObjectCreator.js
  • Code Duplication · Duplicated block with local edits (33 matched lines × 2 locations) src/physics/arcade/ArcadePhysics.js
  • Code Duplication · Duplicated block (33 lines × 2 locations) src/physics/arcade/Body.js
  • Code Duplication · Duplicated block (32 lines × 2 locations) src/loader/filetypes/CSSFile.js
  • Code Duplication · Duplicated block (32 lines × 2 locations) src/loader/filetypes/GLSLFile.js
  • Code Duplication · Duplicated block (31 lines × 2 locations) src/loader/filetypes/TilemapImpactFile.js
  • Code Duplication · Duplicated block (31 lines × 2 locations) src/physics/arcade/World.js
  • Code Duplication · Duplicated block (31 lines × 3 locations) src/physics/matter-js/World.js
  • Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) src/gameobjects/particles/ParticleEmitter.js
  • Code Duplication · Duplicated block (30 lines × 2 locations) src/gameobjects/rope/Rope.js
  • Code Duplication · Duplicated block (30 lines × 2 locations) src/loader/filetypes/HTMLFile.js
  • Code Duplication · Duplicated block (30 lines × 2 locations) src/math/Euler.js
  • Code Duplication · Duplicated block (30 lines × 3 locations) src/renderer/webgl/renderNodes/BatchHandler.js
  • Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) src/sound/BaseSound.js
  • Code Duplication · Duplicated block with local edits (29 matched lines × 2 locations) src/gameobjects/shape/grid/GridWebGLRenderer.js
  • Code Duplication · Duplicated block (29 lines × 2 locations) src/physics/arcade/Body.js
  • Code Duplication · Duplicated block (29 lines × 2 locations) src/renderer/webgl/renderNodes/BatchHandler.js
  • Code Duplication · Duplicated block (29 lines × 2 locations) src/tilemaps/parsers/tiled/ParseImageLayers.js
  • Code Duplication · Duplicated block (28 lines × 3 locations) src/math/Euler.js
  • Code Duplication · Duplicated block with local edits (27 matched lines × 2 locations) src/gameobjects/components/Origin.js
  • Code Duplication · Duplicated block (27 lines × 2 locations) src/gameobjects/container/ContainerWebGLRenderer.js
  • Code Duplication · Duplicated block (27 lines × 2 locations) src/tilemaps/parsers/tiled/ParseTileLayers.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/actions/GetFirst.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/gameobjects/components/Crop.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/geom/rectangle/Rectangle.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/input/InputManager.js
  • Code Duplication · Duplicated block with local edits (26 matched lines × 2 locations) src/math/Vector3.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/physics/arcade/ArcadeImage.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/tweens/tween/Tween.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/curves/path/Path.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/filters/Blur.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/gameobjects/components/ComputedSize.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/physics/arcade/tilemap/ProcessTileSeparationX.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/sound/html5/HTML5AudioSound.js
  • Code Duplication · Duplicated block (25 lines × 2 locations) src/sound/webaudio/WebAudioSound.js
  • Code Duplication · Duplicated block (24 lines × 2 locations) src/actions/SmoothStep.js
  • Code Duplication · Duplicated block (24 lines × 2 locations) src/input/Pointer.js
  • Code Duplication · Duplicated block (24 lines × 7 locations) src/loader/filetypes/AsepriteFile.js
  • Code Duplication · Duplicated block with local edits (24 matched lines × 2 locations) src/renderer/snapshot/CanvasSnapshot.js
  • Code Duplication · Duplicated block (24 lines × 2 locations) src/renderer/webgl/renderNodes/BatchHandlerPointLight.js
  • Code Duplication · Duplicated block with local edits (23 matched lines × 2 locations) src/animations/Animation.js
  • Code Duplication · Duplicated block (23 lines × 2 locations) src/cameras/2d/BaseCamera.js
  • Code Duplication · Duplicated block (23 lines × 2 locations) src/input/InputPlugin.js
  • Code Duplication · Duplicated block (23 lines × 3 locations) src/math/easing/elastic/In.js
  • Code Duplication · Duplicated block (23 lines × 3 locations) src/renderer/webgl/wrappers/WebGLGlobalWrapper.js
  • Code Duplication · Duplicated block (23 lines × 2 locations) src/tilemaps/Tilemap.js
  • Code Duplication · Duplicated block (23 lines × 2 locations) src/tilemaps/parsers/tiled/ParseImageLayers.js
  • Code Duplication · Duplicated block (22 lines × 3 locations) src/gameobjects/components/ComputedSize.js
  • Code Duplication · Duplicated block (22 lines × 6 locations) src/gameobjects/noise/Noise.js
  • Code Duplication · Duplicated block (22 lines × 2 locations) src/gameobjects/sprite/Sprite.js
  • Code Duplication · Duplicated block (22 lines × 2 locations) src/gameobjects/tilesprite/TileSprite.js
  • Code Duplication · Duplicated block (22 lines × 4 locations) src/physics/arcade/GetOverlapX.js
  • Code Duplication · Duplicated block (22 lines × 2 locations) src/physics/matter-js/components/Transform.js
  • Code Duplication · Duplicated block (22 lines × 2 locations) src/renderer/webgl/renderNodes/BatchHandlerQuad.js
  • Code Duplication · Duplicated block (22 lines × 2 locations) src/renderer/webgl/renderNodes/ShaderQuad.js
  • Code Duplication · Duplicated block (22 lines × 2 locations) src/tilemaps/components/IsometricCullTiles.js
  • Code Duplication · Duplicated block (21 lines × 2 locations) src/filters/Glow.js
  • Code Duplication · Duplicated block with local edits (21 matched lines × 2 locations) src/gameobjects/text/MeasureText.js
  • Code Duplication · Duplicated block (21 lines × 2 locations) src/gameobjects/text/TextWebGLRenderer.js
  • Code Duplication · Duplicated block (21 lines × 2 locations) src/geom/triangle/GetPoint.js
  • Code Duplication · Duplicated block (21 lines × 2 locations) src/input/InputPlugin.js
  • Code Duplication · Duplicated block (21 lines × 3 locations) src/renderer/webgl/renderNodes/transformer/TransformerImage.js
  • Code Duplication · Duplicated block (21 lines × 2 locations) src/textures/TextureManager.js
  • Code Duplication · Duplicated block (20 lines × 2 locations) src/cameras/2d/BaseCamera.js
  • Code Duplication · Duplicated block (20 lines × 4 locations) src/curves/EllipseCurve.js
  • Code Duplication · Duplicated block (20 lines × 3 locations) src/curves/EllipseCurve.js
  • Code Duplication · Duplicated block (20 lines × 4 locations) src/gameobjects/blitter/Blitter.js
  • Code Duplication · Duplicated block (20 lines × 2 locations) src/gameobjects/particles/ParticleEmitter.js
Rebuild cost: about €560,000 · Estimate
Cost to rebuild€190,000 to €940,000, for 3,104 to 9,846 hours of work, about 3.9 person-years for 2 to 8 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 62. 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.
SizeLarge: 216,652 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
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Raises the score by about 7 points · Medium effort · Type Safety
2
Swallowed exception (empty catch)
Raises the score by about 3 points · Medium effort · Exception handling
3
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security — so a security regression fails the build instead of landing.
Raises the score by about 3 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 €560,000 to build again, about 3.9 person-years of work. Its weakest lens is Code Health, at 53 (Adequate). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
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. Of all the actions in this report, it raises the score most for the work it takes: about 7 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

At a glance — Code Health · 53% · Adequate · gated by R1 ·

At a glance — Architecture · 83% · Strong ·

At a glance — Maturity · 66% · Adequate · gated by M2 ·

At a glance — Readiness · 66% · Adequate · gated by P3 ·

At a glance — Security · 84% · Strong ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures18High / Critical
A05:2025 — Injection10High / Critical

Roadmap

Top priorities: 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; Bring the 93 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with startListeners (cyclomatic 58), separateCircle (cyclomatic 45), HashSimplex.psrdnoise3d (cyclomatic 43); Swallowed exception (empty catch).

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

Do thisHelpsEffortDimension
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.+7.2 ptsMediumType Safety
Swallowed exception (empty catch)+3.1 ptsMediumException handling
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security — so a security regression fails the build instead of landing.+2.8 ptsMediumSecurity & performance tooling
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+2.8 ptsMediumArchitecture documentation
Bring the 93 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with startListeners (cyclomatic 58), separateCircle (cyclomatic 45), HashSimplex.psrdnoise3d (cyclomatic 43).+4.1 ptsHighCyclomatic Complexity
Resolve the 3 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (3).+0.6 ptsLowDependency Hygiene
Resolve the 2 Off-boarding risk finding(s) in Bus Factor.+0.5 ptsLowBus Factor
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.+0.9 ptsMediumDocumentation (README)

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopDependency Vulnerabilities: High CVE: REDACTED
src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js5.4MixedCognitive Complexity: updateRenderOptions (cognitive 16)
src/gameobjects/particles/ParticleEmitterWebGLRenderer.js5.5MixedChange Coupling: Boundary-crossing change coupling: ParticleEmitterWebGLRenderer.js ↔ TransformerTileSprite.js
src/gameobjects/particles/ParticleEmitter.js5.5MixedCyclomatic Complexity: setConfig (cyclomatic 21)
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED6.1MixedStatic Analysis (SAST): Medium: REDACTED
src/core/Config.js6.3MixedCyclomatic Complexity: Config (cyclomatic 19)
REDACTED6.3MixedStatic Analysis (SAST): Medium: REDACTED
src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js6.4MixedCyclomatic Complexity: _completeLayout (cyclomatic 25)
src/physics/matter-js/World.js6.5MixedCyclomatic Complexity: renderBody (cyclomatic 28)
src/gameobjects/text/Text.js6.6MixedCyclomatic Complexity: updateText (cyclomatic 31)
src/renderer/webgl/WebGLRenderer.js6.6MixedCyclomatic Complexity: createTextureFromSource (cyclomatic 17)
src/physics/arcade/World.js7.0MixedCyclomatic Complexity: separateCircle (cyclomatic 45)
src/gameobjects/bitmaptext/GetBitmapTextSize.js7.0MixedCyclomatic Complexity: GetBitmapTextSize.GetBitmapTextSize (cyclomatic 40)
src/renderer/webgl/renderNodes/Camera.js7.0MixedCyclomatic Complexity: run (cyclomatic 34)
src/input/InputPlugin.js7.0MixedCyclomatic Complexity: processOverOutEvents (cyclomatic 30)
src/renderer/webgl/renderNodes/BatchHandlerQuad.js7.0MixedCyclomatic Complexity: updateShaderConfig (cyclomatic 19)
src/gameobjects/blitter/BlitterWebGLRenderer.js7.0MixedChange Coupling: Boundary-crossing change coupling: BlitterWebGLRenderer.js ↔ TransformerTile.js
src/textures/DynamicTexture.js7.1MixedCyclomatic Complexity: _renderCanvas (cyclomatic 25)
src/math/HashSimplex.js7.1MixedCyclomatic Complexity: HashSimplex.psrdnoise3d (cyclomatic 43)

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

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

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

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

Could not be resolved — 8

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

Methodology & how to trust this report

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

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

What we checked — 53 dimensions across the health lenses
D1D2D3D4D6D10D12D13D14D15D16D19D24D27D28D29D30D34D35D43D44AX10AX3AX5GD1IC1M1M2M3M4P1P10P3P6R1R10R2R3R4R5R6R7R8R9X12X16X17X21X24X28X29X3X30

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, 771 of 782 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 01a1d623-1c2a-763d-a7fa-69fa66c0c8ff.

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.

  • 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 reliability not included — the JavaScript/TypeScript suite (vitest via `npm ci --ignore-scripts` in the repository root (23309 tests)) did not finish re-running within its budget: too large to re-run within its budget.
  • 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: it declares a published package (package.json), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • 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)` (216652 LoC, 889 module-visible types across 133 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.
  • 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.
  • P1 CI/CD gates — 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. A CI pipeline exists and the word "test" appears, but no explicit test-runner invocation (your stack's test command, or a test job) was matched — so either the gate runs tests through a step this pass could not recognise, or "test" is incidental here (a path, "latest", a reporter). Which of the two it is cannot be settled from this dimension's evidence; the coverage dimensions report whether a suite exists at all. You can widen what we reach: name the test runner explicitly in the pipeline step (your stack's test command, or a job named for the suite) so the gate is unambiguous to a reader and to this pass.
  • 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 none applies: this repository publishes a library and deploys nothing (no container, IaC or deployment manifest), so it holds no runtime state of its own. Any data-access dependency it declares is the store it is a CLIENT for, not one it operates. The DR control belongs to whoever runs that data.
  • 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. 538 further occurrence(s) are not listed individually; the score already reflects all 578.
  • 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. 218 further occurrence(s) are not listed individually; the score already reflects all 258.
  • R3 Large Files — 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. 79 further occurrence(s) are not listed individually; the score already reflects all 119.
  • R4 Test Coverage — 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. 371 further occurrence(s) are not listed individually; the score already reflects all 411.
  • R7 Dead Code — 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. 342 further occurrence(s) are not listed individually; the score already reflects all 382.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 2065 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled certificate validation, obsolete TLS versions, plaintext password storage and session cookies set without HttpOnly, Secure or SameSite, and none was found. The server controls this dimension also scores were not assessed, so no score is given.
  • X10 Duplicated predicate — 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. 8 further occurrence(s) are not listed individually; the score already reflects all 48.
  • X2 Cancellation propagation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X4 Structured logging — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, 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: 34 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • 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.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D19 Documentation Quality: Documentation quality 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.
  • 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.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

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

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

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

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

96 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was startListeners at 58. 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 GetBlendModes.GetBlendModes at 16 — they are counted neither in the figure above nor in this dimension's score. 3 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/cameras/2d/Camera.js (getPaddingWrapper at 16), src/physics/matter-js/MatterPhysics.js (alignBody at 16), src/renderer/canvas/utils/GetBlendModes.js (GetBlendModes.GetBlendModes at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

update (cyclomatic 19) · ×2src/animations/AnimationState.js:1498
startListeners (cyclomatic 58)src/input/mouse/MouseManager.js:353
separateCircle (cyclomatic 45)src/physics/arcade/World.js:1469
HashSimplex.psrdnoise3d (cyclomatic 43)src/math/HashSimplex.js:453
GetBitmapTextSize.GetBitmapTextSize (cyclomatic 40)src/gameobjects/bitmaptext/GetBitmapTextSize.js:28

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

What to do

  1. Bring the 93 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with startListeners (cyclomatic 58), separateCircle (cyclomatic 45), HashSimplex.psrdnoise3d (cyclomatic 43). — 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 93 together lifts Cyclomatic Complexity from 6.6 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

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

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

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

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

188 method(s) exceeded the cognitive complexity threshold of 15; the worst was ParseTilesets.ParseTilesets at 107.

update (cognitive 30) · ×2src/animations/AnimationState.js:1498
update (cognitive 19) · ×2src/renderer/webgl/wrappers/WebGLGlobalWrapper.js:68
update (cognitive 18) · ×2src/tweens/tween/Tween.js:653
ParseTilesets.ParseTilesets (cognitive 107)src/tilemaps/parsers/tiled/ParseTilesets.js:26
HashSimplex.psrdnoise3d (cognitive 87)src/math/HashSimplex.js:453

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

What to do

  1. Bring the 9 bodies over 60 down to 60 or less in Cognitive Complexity — start with ParseTilesets.ParseTilesets (cognitive 107), HashSimplex.psrdnoise3d (cognitive 87), ParseTileLayers.ParseTileLayers (cognitive 84). — 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 9 together lifts Cognitive Complexity from 4.2 to about 5.3/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes10.0 / 10Exemplary✓ Tool-verified

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

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

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

0 god class(es) detected.

✓ On the Gold path — maintain.

Detailed fixes: d3_recommendation.md.

D4 · Code Duplication10.0 / 10Exemplary✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

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

0 duplicated block group(s) detected.

✓ On the Gold path — maintain.

Detailed fixes: d4_recommendation.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 1 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D10 · Test Quality10.0 / 10Stronggated by 18 serious findings✓ 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

4 skipped (4 with a documented reason), 18 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 23328 tests.

No assertions: check ProcessY type · ×18tests/physics/arcade/_debug.test.js:14
Mock-dominated test: should call ctx.drawImage with correct arguments · ×116tests/tilemaps/TilemapLayerCanvasRenderer.test.js:474
Skipped (documented): should accept a Phaser.Textures.Texture instance as the second argument · ×4tests/filters/CombineColorMatrix.test.js:90

What to do

  1. Resolve the 116 Mock-dominated test finding(s) in Test Quality — start with CanvasSnapshot.test.js (20), Camera.test.js (12), ShaderWebGLRenderer.test.js (7). — One of this dimension's main actionable groups (116 recommendation-level).
  2. Resolve the 18 No assertions finding(s) in Test Quality — start with _debug.test.js (2), TileSpriteCreator.test.js, TextCreator.test.js. — One of this dimension's main actionable groups (18 warning-level).

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

0 outdated direct production npm dependency(ies) of 1 graded, 0 pinning defect(s), across 1 package.json (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: @types/source-mappackage.json:61
Deprecated: glob · ×3REDACTED:2386

What to do

  1. Resolve the 3 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (3). — One of this dimension's main actionable groups (3 recommendation-level).
  2. Resolve the 1 Deprecated finding(s) in Dependency Hygiene — start with package.json. — 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 1 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 1 package(s) this repository's committed lockfile installs for a consumer — its 1 production, optional and peer dependency(ies), across 1 product package.json manifest(s), and everything those install in turn. Its 23 `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. 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 Hotspots10.0 / 10Exemplary✓ Tool-verified

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

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

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

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D16 · Bus Factor8.4 / 10Strong✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

94 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/gameobjects/spritegpulayer/SpriteGPULayer.js. Counted over 585 of the 2058 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)

What to do

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

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

D19 · Documentation 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. 9 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D24 · Comment Value8.8 7.8 / 10Strong✓ 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 7.8 / 10 · rule-coverage 89% · ceiling Documented

46 of 3833 judged comments only repeat the code they sit on (1.2 %). 664 comment(s) in another language or script were not judged.

redundant comment · ×46src/filters/Mask.js:239
doc comments repeat the namessrc/display/ColorRamp.js:37

What to do

  1. Resolve the 46 redundant comment finding(s) in Comment Value — start with SubmitterSpriteGPULayer.js (4), DrawingContextPool.js (3), SubmitterTilemapGPULayer.js (3). — One of this dimension's main actionable groups (46 recommendation-level).

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

45 % 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)5.3 / 10Adequate✓ Tool-verified

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

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

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

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

11 finding(s): 0 critical, 2 high, 9 medium, 0 low. 1 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 1 file(s) — `.github/no-response.yml` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 8 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (3), REDACTED. — One of this dimension's main actionable groups (8 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 1 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 (1 issue-level, 0 of them charged here).

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

D30 · Dependency Vulnerabilities1.4 / 10Critical✓ Tool-verified

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

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

18 finding(s): 0 critical, 12 high, 6 medium, 0 low.

REDACTED
REDACTED
REDACTED

What to do

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

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

D34 · Knowledge Freshness9.7 / 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 9.7 / 10 · rule-coverage 100% · ceiling Documented

15 of 585 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/tilemaps/parsers/tiled/ParseTileLayers.js. Counted over 585 of the 2058 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×15src/tilemaps/parsers/tiled/ParseTileLayers.js:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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

D35 · Change Coupling9.9 / 10Adequategated by 4 critical findings✓ Tool-verified

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

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

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

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

Strongest change-coupling: RenderNodeManager.js↔index.js 92%; TransformerTile.js↔TransformerTileSprite.js 92%; Config.js↔RenderConfig.js 83%

Boundary-crossing change coupling: ParticleEmitterWebGLRenderer.js ↔ TransformerTileSprite.js · ×4src/gameobjects/particles/ParticleEmitterWebGLRenderer.js:1
Change coupling: TransformerTile.js ↔ TransformerTileSprite.js · ×5src/renderer/webgl/renderNodes/transformer/TransformerTile.js:1
Change coupling clique: FilterList.js, RenderNodeManager.js, index.jssrc/gameobjects/components/FilterList.js

What to do

  1. Resolve the 4 Boundary-crossing change coupling finding(s) in Change Coupling — start with ParticleEmitterWebGLRenderer.js (2), BlitterWebGLRenderer.js (2). — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 5 Change coupling finding(s) in Change Coupling — start with SubmitterTilemapGPULayer.js (2), TransformerTile.js, Config.js. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 1 Change coupling clique finding(s) in Change Coupling — start with FilterList.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.

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

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

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

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

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

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 & stubs9.0 / 10Strong✓ Tool-verified

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.

  • The `if` and its `else` contain the same statements, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body. — src/tilemaps/components/GetTileCornersFunction.js:36
  • A bare `eslint-disable` or `@ts-nocheck` with no rule list switches every lint rule or the whole type checker off for the rest of the file — hidden debt. Disable the specific rule on the specific line, with a justification, instead. (×2) — src/input/mouse/index.js:11, src/input/touch/index.js:11

What to do

  • Clear the softer debt: re-enable or delete skipped tests, decide whether each empty function is a deliberate no-op (and say so in a comment), and replace blanket `eslint-disable` / `@ts-nocheck` with targeted, justified suppressions.
M1 · Documentation (README)7.3 / 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 / 10Critical✓ Tool-verified

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

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

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

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 structure10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

P1 · CI/CD gates8.5 / 10Strong✓ Tool-verified

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.

What to do

  • Run the test suite in CI via an explicit runner step (`npm test` for the toolchain this pipeline already uses) and gate merges on it.
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

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

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

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 CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security 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.
  • `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — package.json:59

What to do

  • Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

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 · 3136 plain JS — the untyped files are src/actions/AddEffectBloom.js, src/actions/AddEffectShine.js, src/actions/AddMaskShape.js, src/actions/AlignTo.js, src/actions/Angle.js, src/actions/Call.js (+3130 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.8 / 10Strong✓ Tool-verified

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

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

  • 160 duplicated blocks under src/ have copies in at least two of the sibling directories animations, cache, cameras, core, curves, data (+19 more sibling(s) not listed) — 81 of them are reported below, and 79 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 160 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 160 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 160 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. — src/gameobjects/container/Container.js:588
  • 58 duplicated blocks under src/gameobjects/ have copies in at least two of the sibling directories bitmaptext, blitter, captureframe, components, container, customcontext (+23 more sibling(s) not listed) — 40 of them are reported below, and 18 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 58 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 58 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 58 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. — src/gameobjects/image/Image.js:50
  • 19 duplicated blocks under src/gameobjects/shape/ have copies in at least two of the sibling directories arc, curve, ellipse, grid, isobox, isotriangle (+5 more sibling(s) not listed) — 15 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 19 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 19 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 19 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. — src/gameobjects/shape/curve/CurveCanvasRenderer.js:25
  • 19 duplicated blocks under src/geom/ have copies in at least two of the sibling directories circle, ellipse, intersects, line, rectangle, triangle — 13 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 19 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 19 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 19 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. — src/geom/ellipse/Ellipse.js:37
  • 8 duplicated blocks under src/physics/ have copies in at least two of the sibling directories arcade, matter-js — 5 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 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 8 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. — src/physics/arcade/ArcadePhysics.js:99
  • 6 of the duplicated blocks reported below have copies in at least two of the sibling directories in, to under src/display/align/. 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. — src/display/align/in/BottomCenter.js:27
  • 5 duplicated blocks under src/renderer/ have copies in at least two of the sibling directories canvas, webgl — 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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. — src/renderer/canvas/CanvasRenderer.js:787
  • 5 duplicated blocks under src/renderer/webgl/renderNodes/ have copies in at least two of the sibling directories filters, submitter, transformer — 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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. — src/renderer/webgl/renderNodes/filters/BaseFilterShader.js:269
  • src/physics/arcade/ProcessX.js:8 · src/physics/arcade/ProcessY.js:8 — 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. — src/physics/arcade/ProcessX.js:8
  • src/gameobjects/container/Container.js:588 · src/structs/List.js:152 — the two spans are one implementation copied and then locally edited — 888 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. — src/gameobjects/container/Container.js:588
  • src/input/mouse/MouseManager.js:30 · src/input/touch/TouchManager.js:30 — the two spans are one implementation copied and then locally edited — 813 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. — src/input/mouse/MouseManager.js:30
  • src/renderer/webgl/renderNodes/DynamicTextureHandler.js:114 · src/textures/DynamicTexture.js:355 — the two spans are one implementation copied and then locally edited — 770 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. — src/renderer/webgl/renderNodes/DynamicTextureHandler.js:114
  • src/cameras/2d/effects/Flash.js:34 · src/cameras/2d/effects/RotateTo.js:43 — 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. — src/cameras/2d/effects/Flash.js:34
  • src/gameobjects/noise/noisecell2d/NoiseCell2D.js:7 · src/gameobjects/noise/noisecell3d/NoiseCell3D.js:7 · src/gameobjects/noise/noisecell4d/NoiseCell4D.js:7 — these 3 files are line-for-line copies of one another — 120 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — src/gameobjects/noise/noisecell2d/NoiseCell2D.js:7
  • src/gameobjects/noise/noisesimplex2d/NoiseSimplex2D.js:7 · src/gameobjects/noise/noisesimplex3d/NoiseSimplex3D.js:7 — these 2 files are line-for-line copies of one another — 109 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — src/gameobjects/noise/noisesimplex2d/NoiseSimplex2D.js:7
  • src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextCanvasRenderer.js:23 · src/gameobjects/bitmaptext/static/BitmapTextCanvasRenderer.js:23 — the two spans are one implementation copied and then locally edited — 623 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. — src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextCanvasRenderer.js:23
  • src/geom/ellipse/Ellipse.js:37 · src/geom/rectangle/Rectangle.js:36 — the two spans are one implementation copied and then locally edited — 525 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. — src/geom/ellipse/Ellipse.js:37
  • src/tweens/tween/Tween.js:426 · src/tweens/tween/TweenChain.js:315 — the two spans are one implementation copied and then locally edited — 447 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. — src/tweens/tween/Tween.js:426
  • src/tweens/tween/TweenData.js:228 · src/tweens/tween/TweenFrameData.js:160 — the two spans are one implementation copied and then locally edited — 468 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. — src/tweens/tween/TweenData.js:228
  • src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:364 · src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js:245 — the two spans are one implementation copied and then locally edited — 403 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. — src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:364
  • src/gameobjects/components/TransformMatrix.js:653 · src/math/Matrix3.js:136 — the two spans are one implementation copied and then locally edited — 411 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. — src/gameobjects/components/TransformMatrix.js:653
  • src/loader/filetypes/AtlasJSONFile.js:38 · src/loader/filetypes/AtlasXMLFile.js:38 · src/loader/filetypes/UnityAtlasFile.js:36 — 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. — src/loader/filetypes/AtlasJSONFile.js:38
  • src/loader/filetypes/MultiAtlasFile.js:41 · src/loader/filetypes/PCTAtlasFile.js:94 — the two spans are one implementation copied and then locally edited — 468 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. — src/loader/filetypes/MultiAtlasFile.js:41
  • src/textures/parsers/JSONArray.js:27 · src/textures/parsers/JSONHash.js:27 — the two spans are one implementation copied and then locally edited — 354 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. — src/textures/parsers/JSONArray.js:27
  • src/cameras/2d/effects/Fade.js:80 · src/cameras/2d/effects/Flash.js:66 — the two spans are one implementation copied and then locally edited — 449 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. — src/cameras/2d/effects/Fade.js:80
  • src/cameras/controls/FixedKeyControl.js:188 · src/cameras/controls/SmoothedKeyControl.js:278 — the two spans are one implementation copied and then locally edited — 297 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. — src/cameras/controls/FixedKeyControl.js:188
  • src/math/Vector2.js:406 · src/math/Vector3.js:506 — the two spans are one implementation copied and then locally edited — 366 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. — src/math/Vector2.js:406
  • src/cameras/2d/effects/RotateTo.js:209 · src/cameras/2d/effects/Zoom.js:174 — the two spans are one implementation copied and then locally edited — 327 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. — src/cameras/2d/effects/RotateTo.js:209
  • src/physics/arcade/tilemap/TileCheckX.js:27 · src/physics/arcade/tilemap/TileCheckY.js:27 — 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. — src/physics/arcade/tilemap/TileCheckX.js:27
  • src/gameobjects/shape/curve/CurveCanvasRenderer.js:25 · src/gameobjects/shape/polygon/PolygonCanvasRenderer.js:25 — 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. — src/gameobjects/shape/curve/CurveCanvasRenderer.js:25
  • src/renderer/webgl/renderNodes/submitter/SubmitterQuad.js:93 · src/renderer/webgl/renderNodes/submitter/SubmitterTileSprite.js:50 — 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. — src/renderer/webgl/renderNodes/submitter/SubmitterQuad.js:93
  • src/renderer/webgl/renderNodes/transformer/TransformerTile.js:32 · src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.js:37 — the two spans are one implementation copied and then locally edited — 353 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. — src/renderer/webgl/renderNodes/transformer/TransformerTile.js:32
  • src/cameras/2d/effects/Pan.js:214 · src/cameras/2d/effects/RotateTo.js:247 — the two spans are one implementation copied and then locally edited — 287 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. — src/cameras/2d/effects/Pan.js:214
  • src/geom/rectangle/Rectangle.js:42 · src/geom/triangle/Triangle.js:46 — the two spans are one implementation copied and then locally edited — 365 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. — src/geom/rectangle/Rectangle.js:42
  • src/gameobjects/shape/ellipse/EllipseCanvasRenderer.js:25 · src/gameobjects/shape/star/StarCanvasRenderer.js:25 — 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. — src/gameobjects/shape/ellipse/EllipseCanvasRenderer.js:25
  • src/curves/CubicBezierCurve.js:44 · src/curves/QuadraticBezierCurve.js:34 — the two spans are one implementation copied and then locally edited — 404 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. — src/curves/CubicBezierCurve.js:44
  • src/gameobjects/shape/grid/GridCanvasRenderer.js:36 · src/gameobjects/shape/grid/GridWebGLRenderer.js: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. — src/gameobjects/shape/grid/GridCanvasRenderer.js:36
  • src/geom/triangle/Triangle.js:289 · src/geom/triangle/Triangle.js:365 — 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. — src/geom/triangle/Triangle.js:289
  • src/tweens/builders/NumberTweenBuilder.js:38 · src/tweens/builders/TweenBuilder.js:50 — the two spans are one implementation copied and then locally edited — 372 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. — src/tweens/builders/NumberTweenBuilder.js:38
  • src/gameobjects/particles/ParticleEmitter.js:1319 · src/gameobjects/particles/ParticleEmitter.js:1427 — 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. — src/gameobjects/particles/ParticleEmitter.js:1319

What to do

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

  • separateCircle has cyclomatic complexity 45 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. — src/physics/arcade/World.js:1469
  • psrdnoise3d has cyclomatic complexity 43 and cognitive complexity 72; 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. — src/math/HashSimplex.js:453
  • GraphicsWebGLRenderer has cyclomatic complexity 40 and cognitive complexity 40; 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. — src/gameobjects/graphics/GraphicsWebGLRenderer.js:63
  • IsometricCullTiles has cyclomatic complexity 39 and cognitive complexity 66; 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. — src/tilemaps/components/IsometricCullTiles.js:22
  • GetBitmapTextSize has cyclomatic complexity 38 and cognitive complexity 82; 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. — src/gameobjects/bitmaptext/GetBitmapTextSize.js:28
  • update has cyclomatic complexity 37 and cognitive complexity 82; 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. — src/time/Timeline.js:288
  • init has cyclomatic complexity 36 and cognitive complexity 24; 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. — src/device/Features.js:81
  • GridWebGLRenderer has cyclomatic complexity 35 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. — src/gameobjects/shape/grid/GridWebGLRenderer.js:24
  • init has cyclomatic complexity 35 and cognitive complexity 35; 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. — src/device/OS.js:62
  • run has cyclomatic complexity 34 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. — src/renderer/webgl/renderNodes/Camera.js:120
  • GridCanvasRenderer has cyclomatic complexity 33 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. — src/gameobjects/shape/grid/GridCanvasRenderer.js:25
  • RunCull has cyclomatic complexity 33 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 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. — src/tilemaps/components/RunCull.js:20
  • addMember has cyclomatic complexity 33 and cognitive complexity 47; 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. — src/gameobjects/spritegpulayer/SpriteGPULayer.js:793
  • update has cyclomatic complexity 32 and cognitive complexity 41; 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. — src/cameras/controls/SmoothedKeyControl.js:347
  • ParseTilesets has cyclomatic complexity 31 and cognitive complexity 107; 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. — src/tilemaps/parsers/tiled/ParseTilesets.js:26
  • ParseTileLayers has cyclomatic complexity 31 and cognitive complexity 95; 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. — src/tilemaps/parsers/tiled/ParseTileLayers.js:44
  • updateText has cyclomatic complexity 31 and cognitive complexity 56; 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. — src/gameobjects/text/Text.js:1269
  • GraphicsCanvasRenderer has cyclomatic complexity 31 and cognitive complexity 22; 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. — src/gameobjects/graphics/GraphicsCanvasRenderer.js:26
  • removePack has cyclomatic complexity 30 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. — src/loader/LoaderPlugin.js:712
  • processOverOutEvents has cyclomatic complexity 30 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. — src/input/InputPlugin.js:1841
  • createFromObjects has cyclomatic complexity 30 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. — src/tilemaps/Tilemap.js:803
  • renderBody has cyclomatic complexity 28 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. — src/physics/matter-js/World.js:1954
  • separate has cyclomatic complexity 28 and cognitive complexity 34; 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. — src/physics/arcade/World.js:1354
  • PCTDecode has cyclomatic complexity 27 and cognitive complexity 57; 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. — src/textures/parsers/PCTDecode.js:154
  • GetValueOp has cyclomatic complexity 27 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. — src/tweens/builders/GetValueOp.js:70
  • AddEffectShine has cyclomatic complexity 26 and cognitive complexity 31; 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. — src/actions/AddEffectShine.js:86
  • Run has cyclomatic complexity 25 and cognitive complexity 44; 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. (×2) — src/physics/arcade/ProcessX.js:187, src/physics/arcade/ProcessY.js:183
  • run has cyclomatic complexity 25 and cognitive complexity 40; 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. — src/renderer/webgl/renderNodes/DynamicTextureHandler.js:68
  • CreateRenderer has cyclomatic complexity 25 and cognitive complexity 35; 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. — src/core/CreateRenderer.js:30
  • _renderCanvas has cyclomatic complexity 25 and cognitive complexity 34; 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. — src/textures/DynamicTexture.js:339
  • _completeLayout has cyclomatic complexity 25 and cognitive complexity 28; 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. — src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:296
  • _copyAndCompleteConfig has cyclomatic complexity 25 and cognitive complexity 26; 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. — src/renderer/webgl/renderNodes/BatchHandler.js:287
  • LineToRectangle has cyclomatic complexity 25 and cognitive complexity 24; 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. — src/geom/intersects/LineToRectangle.js:26
  • ParseGID has cyclomatic complexity 25 and cognitive complexity 16; 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. — src/tilemaps/parsers/tiled/ParseGID.js:31
  • HashSimplex has cyclomatic complexity 24 and cognitive complexity 26; 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. — src/math/HashSimplex.js:74
  • _setAnimatedValue has cyclomatic complexity 23 and cognitive complexity 35; 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. — src/gameobjects/spritegpulayer/SpriteGPULayer.js:1426
  • collideSpriteVsGroup has cyclomatic complexity 23 and cognitive complexity 34; 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. — src/physics/arcade/World.js:2048
  • batchSprite has cyclomatic complexity 23 and cognitive complexity 32; 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. — src/renderer/canvas/CanvasRenderer.js:713
  • setConstraintRenderStyle has cyclomatic complexity 23 and cognitive complexity 23; 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. — src/physics/matter-js/World.js:474
R3 · Large Files7.7 / 10Strong✓ 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.

  • src/gameobjects/particles/ParticleEmitter.js has 3500 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/particles/ParticleEmitter.js:1
  • src/input/InputPlugin.js has 2929 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/input/InputPlugin.js:1
  • src/physics/arcade/Body.js has 2459 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/physics/arcade/Body.js:1
  • src/tilemaps/Tilemap.js has 2411 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/tilemaps/Tilemap.js:1
  • src/renderer/webgl/WebGLRenderer.js has 2345 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/renderer/webgl/WebGLRenderer.js:1
  • src/physics/arcade/World.js has 2223 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/physics/arcade/World.js:1
  • src/gameobjects/video/Video.js has 2095 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/video/Video.js:1
  • src/physics/matter-js/World.js has 1965 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/physics/matter-js/World.js:1
  • src/animations/AnimationState.js has 1778 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/animations/AnimationState.js:1
  • src/cameras/2d/BaseCamera.js has 1771 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/cameras/2d/BaseCamera.js:1
  • src/scale/ScaleManager.js has 1634 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/scale/ScaleManager.js:1
  • src/gameobjects/group/Group.js has 1559 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/group/Group.js:1
  • src/math/Matrix4.js has 1556 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/math/Matrix4.js:1
  • src/textures/TextureManager.js has 1554 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/textures/TextureManager.js:1
  • src/scene/SceneManager.js has 1492 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/scene/SceneManager.js:1
  • src/gameobjects/spritegpulayer/SpriteGPULayer.js has 1466 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/spritegpulayer/SpriteGPULayer.js:1
  • src/gameobjects/graphics/Graphics.js has 1431 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/graphics/Graphics.js:1
  • src/gameobjects/text/Text.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. — src/gameobjects/text/Text.js:1
  • src/gameobjects/container/Container.js has 1327 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/container/Container.js:1
  • src/textures/DynamicTexture.js has 1182 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/textures/DynamicTexture.js:1
  • src/physics/matter-js/MatterPhysics.js has 1178 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/physics/matter-js/MatterPhysics.js:1
  • src/input/Pointer.js has 1169 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/input/Pointer.js:1
  • src/loader/LoaderPlugin.js has 1127 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/loader/LoaderPlugin.js:1
  • src/gameobjects/bitmaptext/static/BitmapText.js has 1117 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/bitmaptext/static/BitmapText.js:1
  • src/tilemaps/TilemapLayerBase.js has 1117 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/tilemaps/TilemapLayerBase.js:1
  • src/gameobjects/nineslice/NineSlice.js has 1086 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/nineslice/NineSlice.js:1
  • src/tweens/TweenManager.js has 1036 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/tweens/TweenManager.js:1
  • src/gameobjects/rope/Rope.js has 1024 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/rope/Rope.js:1
  • src/sound/webaudio/WebAudioSound.js has 995 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/sound/webaudio/WebAudioSound.js:1
  • src/scene/ScenePlugin.js has 993 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/scene/ScenePlugin.js:1
  • src/gameobjects/text/TextStyle.js has 969 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/text/TextStyle.js:1
  • src/renderer/webgl/renderNodes/BatchHandlerQuad.js has 964 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/renderer/webgl/renderNodes/BatchHandlerQuad.js:1
  • src/gameobjects/GameObject.js has 960 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/GameObject.js:1
  • src/math/Vector3.js has 959 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/math/Vector3.js:1
  • src/physics/arcade/StaticBody.js has 954 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/physics/arcade/StaticBody.js:1
  • src/gameobjects/components/TransformMatrix.js has 951 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/gameobjects/components/TransformMatrix.js:1
  • src/animations/AnimationManager.js has 945 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/animations/AnimationManager.js:1
  • src/input/InputManager.js has 935 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/input/InputManager.js:1
  • src/renderer/webgl/wrappers/WebGLGlobalWrapper.js has 930 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/renderer/webgl/wrappers/WebGLGlobalWrapper.js:1
  • src/math/Quaternion.js has 919 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/math/Quaternion.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 Coverage7.9 / 10Strong✓ 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.

  • tests/geom/intersects/GetTriangleToLine.test.js:2 imports '../../../src/geom/Triangle', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — tests/geom/intersects/GetTriangleToLine.test.js:2
  • 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. (×39) — src/phaser-core.js:1, src/phaser-no-physics.js:1, src/actions/typedefs/AddEffectBloomConfig.js:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness8.9 / 10Strong✓ 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 · Tooling10.0 / 10Exemplary✓ Tool-verified

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

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

  • This repository declares test tooling, and the ✓ above records that declaration — but tests/geom/intersects/GetTriangleToLine.test.js cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — tests/geom/intersects/GetTriangleToLine.test.js:2
R7 · Dead Code9.9 / 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.

  • Unreachable from the 343 application, 4 tooling and 1098 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
  • no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×39) — src/phaser-core.js, src/phaser-no-physics.js, src/actions/typedefs/AddEffectBloomConfig.js, …

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 Hygiene9.5 / 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.

  • Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports5.4 / 10Adequate✓ 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.

  • src/cameras/2d/Camera.js → src/gameobjects/components/index.js → src/gameobjects/components/Filters.js → src/cameras/2d/Camera.js — src/cameras/2d/Camera.js:11
  • src/renderer/index.js → src/renderer/webgl/index.js → src/renderer/webgl/WebGLRenderer.js → src/renderer/webgl/renderNodes/RenderNodeManager.js → src/renderer/webgl/renderNodes/BatchHandlerPointLight.js → src/renderer/webgl/renderNodes/BatchHandler.js → src/renderer/index.js (one verified cycle inside a mutually-dependent group of 13 files) — src/renderer/index.js:29

What to do

  • Break each cycle by extracting the shared piece into a module both sides can import.
X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

  • `GetValueOp` is exported and takes `propertyValue: object` from its caller, and it calls itself at line 264 (`GetValueOp`) with a piece of `propertyValue` (and at line 292, line 296, line 303) — and nowhere in `GetValueOp` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `GetValueOp` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/tweens/builders/GetValueOp.js:264

What to do

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

  • `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) — src/gameobjects/domelement/DOMElement.js:756, src/gameobjects/domelement/DOMElement.js:933
  • `this.xhrLoader.responseText` 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. — src/loader/filetypes/CSSFile.js:84

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

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

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

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

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

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

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

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

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

  • 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. (×2) — src/device/Audio.js:112, src/device/Video.js:98

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.

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 Health53%Adequate — gated by R1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture83%StrongSolid.
Maturity66%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness66%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security84%StrongStrongest area.
Unscored — 1 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.

  • X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for

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

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 73 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's 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.
  • AX2 Stateful singletons — Not applicable: TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
  • AX6 Interface segregation — no exported interface declares behaviour
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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
  • D17 Explicit Debt — explicit-debt markers are read through a C# workspace today, so they were not read for this repository's language — this asserts nothing about how many markers the code carries. Not scored — this is a gap in the analyzer, not a finding about this repository
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D21 Naming Consistency — N/A — too few peers to establish a naming convention (3531 declarations, no unit with a dominant convention).
  • 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.
  • D36 Supply-chain Provenance & Signing — The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • 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: the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows only 1 of the 3 signals this lens looks for (1 CQRS handler(s))
  • ED5 Idempotency — 1 mutating command handler(s)/consumer(s) detected and 2 handler method(s) walked, but no persistent write was recognised in any of them — idempotency not assessed
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P2 Observability — This repository's JavaScript/TypeScript source (1 module(s), 2065 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a package.json, 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.
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • S1 Web-Security Posture — Not assessed: 2065 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation, obsolete TLS versions, passwords stored or checked as plaintext and session cookies set without HttpOnly, Secure or SameSite, and none was found. That half of the dimension is clean, but it is not scored on its own: a C# repository with the same clean reading is scored on its server controls as well, or is N/A for having no web surface, and neither can be decided here. 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.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X20 Mistyped argument guard — This check 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
  • X25 Inert configuration knob — 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 — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. TypeScript/JavaScript runs every callback on the one thread that owns its objects: a callback runs only when the body waiting on it has yielded, never alongside it, and a worker thread receives a COPY of what it is sent. A SharedArrayBuffer carries raw bytes, never an Array, Map or Set, so no collection is reachable from two threads at once. Not a gap in the analyzer and not a finding about your code.
  • 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. 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 — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — Not applicable: this check asks whether the null-typed discipline a language offers is switched on, and how much of that the assertion operator takes back, and in this repository's languages there is no such switch and no such operator. Plain JavaScript carries no type annotations and commits no tsconfig, so it states no null-typed discipline for this check to grade: there is nothing here that switches null checking on or off, and TypeScript (or `// @ts-check`) is how a repository acquires one — advice, not a defect this card measures. Not a gap in the analyzer and not a finding about your code.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 20 finding(s)
D30 · Dependency Vulnerabilities · High CVE · ×12
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Boundary-crossing change coupling · ×4
  • Boundary-crossing change coupling: ParticleEmitterWebGLRenderer.js ↔ TransformerTileSprite.js src/gameobjects/particles/ParticleEmitterWebGLRenderer.js:1 — `src/gameobjects/particles/ParticleEmitterWebGLRenderer.js` (context gameobjects) and `src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.js` (context renderer) sit in DIFFERENT parts of the tree yet change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `7738d163` Fix camera transform matrix order issues. Without these fixes, object…; `2a477646` Fix parent matrix application.; `e2cecb76` Add TransformMatrix#copyWithScrollFactorFrom and use it. This unifies… — run `git show` on any of them.
  • Boundary-crossing change coupling: ParticleEmitterWebGLRenderer.js ↔ TransformerTile.js src/gameobjects/particles/ParticleEmitterWebGLRenderer.js:1 — `src/gameobjects/particles/ParticleEmitterWebGLRenderer.js` (context gameobjects) and `src/renderer/webgl/renderNodes/transformer/TransformerTile.js` (context renderer) sit in DIFFERENT parts of the tree yet change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `7738d163` Fix camera transform matrix order issues. Without these fixes, object…; `2a477646` Fix parent matrix application.; `e2cecb76` Add TransformMatrix#copyWithScrollFactorFrom and use it. This unifies… — run `git show` on any of them.
  • Boundary-crossing change coupling: BlitterWebGLRenderer.js ↔ TransformerTile.js src/gameobjects/blitter/BlitterWebGLRenderer.js:1 — `src/gameobjects/blitter/BlitterWebGLRenderer.js` (context gameobjects) and `src/renderer/webgl/renderNodes/transformer/TransformerTile.js` (context renderer) sit in DIFFERENT parts of the tree yet change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `7738d163` Fix camera transform matrix order issues. Without these fixes, object…; `2a477646` Fix parent matrix application.; `e2cecb76` Add TransformMatrix#copyWithScrollFactorFrom and use it. This unifies… — run `git show` on any of them.
  • Boundary-crossing change coupling: BlitterWebGLRenderer.js ↔ TransformerTileSprite.js src/gameobjects/blitter/BlitterWebGLRenderer.js:1 — `src/gameobjects/blitter/BlitterWebGLRenderer.js` (context gameobjects) and `src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.js` (context renderer) sit in DIFFERENT parts of the tree yet change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `7738d163` Fix camera transform matrix order issues. Without these fixes, object…; `2a477646` Fix parent matrix application.; `e2cecb76` Add TransformMatrix#copyWithScrollFactorFrom and use it. This unifies… — run `git show` on any of them.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
R9 · Circular Imports · Import cycle (3 files) · ×1
  • Import cycle (3 files) src/cameras/2d/Camera.js:11 — src/cameras/2d/Camera.js → src/gameobjects/components/index.js → src/gameobjects/components/Filters.js → src/cameras/2d/Camera.js
R9 · Circular Imports · Import cycle (6 files) · ×1
  • Import cycle (6 files) src/renderer/index.js:29 — src/renderer/index.js → src/renderer/webgl/index.js → src/renderer/webgl/WebGLRenderer.js → src/renderer/webgl/renderNodes/RenderNodeManager.js → src/renderer/webgl/renderNodes/BatchHandlerPointLight.js → src/renderer/webgl/renderNodes/BatchHandler.js → src/renderer/index.js (one verified cycle inside a mutually-dependent group of 13 files)
Serious — 527 finding(s)
R4 · Test Coverage · No test reaches this file · ×39
  • No test reaches this file src/phaser-core.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.
  • No test reaches this file src/phaser-no-physics.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.
  • No test reaches this file src/actions/typedefs/AddEffectBloomConfig.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.
  • No test reaches this file src/actions/typedefs/AddEffectBloomReturn.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.
  • No test reaches this file src/actions/typedefs/AddEffectShineConfig.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.
  • No test reaches this file src/actions/typedefs/AddEffectShineReturn.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.
  • No test reaches this file src/actions/typedefs/AddMaskShapeConfig.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.
  • No test reaches this file src/actions/typedefs/CallCallback.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.
  • No test reaches this file src/actions/typedefs/FitToRegionItemCoverage.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.
  • No test reaches this file src/actions/typedefs/GridAlignConfig.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.
  • No test reaches this file src/actions/typedefs/index.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.
  • No test reaches this file src/animations/typedefs/Animation.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.
  • No test reaches this file src/animations/typedefs/AnimationFrame.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.
  • No test reaches this file src/animations/typedefs/GenerateFrameNames.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.
  • No test reaches this file src/animations/typedefs/GenerateFrameNumbers.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.
  • No test reaches this file src/animations/typedefs/JSONAnimation.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.
  • No test reaches this file src/animations/typedefs/JSONAnimationFrame.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.
  • No test reaches this file src/animations/typedefs/JSONAnimations.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.
  • No test reaches this file src/animations/typedefs/PlayAnimationConfig.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.
  • No test reaches this file src/animations/typedefs/index.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.
  • No test reaches this file src/cameras/2d/typedefs/CameraConfig.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.
  • No test reaches this file src/cameras/2d/typedefs/CameraFadeCallback.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.
  • No test reaches this file src/cameras/2d/typedefs/CameraFlashCallback.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.
  • No test reaches this file src/cameras/2d/typedefs/CameraPaddingWrapper.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.
  • No test reaches this file src/cameras/2d/typedefs/CameraPanCallback.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.
  • + 14 more in this group — see findings.md.
R7 · Dead Code · Dead file (~0 LoC) · ×37
  • Dead file (~0 LoC) src/actions/typedefs/AddEffectBloomConfig.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/AddEffectBloomReturn.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/AddEffectShineConfig.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/AddEffectShineReturn.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/AddMaskShapeConfig.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/CallCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/FitToRegionItemCoverage.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/GridAlignConfig.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/actions/typedefs/index.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/animations/typedefs/AnimationFrame.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/animations/typedefs/JSONAnimation.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/animations/typedefs/JSONAnimationFrame.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/animations/typedefs/JSONAnimations.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/animations/typedefs/index.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraConfig.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraFadeCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraFlashCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraPaddingWrapper.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraPanCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraRotateCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraShakeCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/CameraZoomCallback.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/JSONCamera.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/JSONCameraBounds.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~0 LoC) src/cameras/2d/typedefs/index.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • + 12 more in this group — see findings.md.
D10 · Test Quality · No assertions · ×18
  • No assertions: check ProcessY type tests/physics/arcade/_debug.test.js:14 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: shows what TileCheckX is tests/physics/arcade/tilemap/_debug.test.js:6 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/tilesprite/TileSpriteCreator.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/text/TextCreator.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/text/TextFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/shape/triangle/TriangleFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/shape/rectangle/RectangleFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/shape/curve/CurveFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/shader/ShaderCreator.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/pathfollower/PathFollowerFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/particles/ParticleEmitterFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/noise/noisecell3d/NoiseCell3DCreator.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/noise/noisecell3d/NoiseCell3DFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/noise/noisecell2d/NoiseCell2DFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/layer/LayerFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/graphics/GraphicsFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/blitter/BlitterFactory.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should be importable tests/gameobjects/bitmaptext/static/BitmapTextCreator.test.js:5 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×5
  • Change coupling: TransformerTile.js ↔ TransformerTileSprite.js src/renderer/webgl/renderNodes/transformer/TransformerTile.js:1 — `src/renderer/webgl/renderNodes/transformer/TransformerTile.js` and `src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.js` change together 92% of the time (11 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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 11 shared commits counted here, the most recent 3 are `9f6546bf` Do vertex rounding in Transformer nodes.; `7738d163` Fix camera transform matrix order issues. Without these fixes, object…; `2a477646` Fix parent matrix application. — run `git show` on any of them.
  • Change coupling: Config.js ↔ RenderConfig.js src/core/Config.js:1 — `src/core/Config.js` and `src/core/typedefs/RenderConfig.js` change together 83% of the time (20 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are `530f7818` Add Stencil game object, stencil settings, and alpha strategies.; `991e45aa` Handle mipmap texture minification in framebuffers. Don't apply mipma…; `8f8c12e4` jsdoc fixes — run `git show` on any of them.
  • Change coupling: SubmitterTilemapGPULayer.js ↔ TransformerTile.js src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js:1 — `src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js` and `src/renderer/webgl/renderNodes/transformer/TransformerTile.js` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `2a477646` Fix parent matrix application.; `e2cecb76` Add TransformMatrix#copyWithScrollFactorFrom and use it. This unifies…; `40f977ee` Correctly handle parent matrix for Tilemaps. Tilemaps didn't historic… — run `git show` on any of them.
  • Change coupling: SubmitterTilemapGPULayer.js ↔ TransformerTileSprite.js src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js:1 — `src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js` and `src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.js` change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `2a477646` Fix parent matrix application.; `e2cecb76` Add TransformMatrix#copyWithScrollFactorFrom and use it. This unifies…; `40f977ee` Correctly handle parent matrix for Tilemaps. Tilemaps didn't historic… — run `git show` on any of them.
  • Change coupling: ParticleEmitter.js ↔ ParticleEmitterConfig.js src/gameobjects/particles/ParticleEmitter.js:1 — `src/gameobjects/particles/ParticleEmitter.js` and `src/gameobjects/particles/typedefs/ParticleEmitterConfig.js` change together 59% of the time (16 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are `2546ded0` Change `Tint#tintFill` and `setTintFill` to `tintMode` and `setTintMo…; `62eb820b` Type clarification for emit zone data; `2d32b53c` Added the use of Vector2Like — run `git show` on any of them.
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×3
  • Untrusted text written into markup unescaped src/gameobjects/domelement/DOMElement.js:756 — `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 src/gameobjects/domelement/DOMElement.js:933 — `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 src/loader/filetypes/CSSFile.js:84 — `this.xhrLoader.responseText` 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.
D1 · Cyclomatic Complexity · update (cyclomatic 19) · ×2
  • update (cyclomatic 19) src/animations/AnimationState.js:1498 — update 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.
  • update (cyclomatic 19) src/renderer/webgl/wrappers/WebGLGlobalWrapper.js:68 — update 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.
D2 · Cognitive Complexity · update (cognitive 30) · ×2
  • update (cognitive 30) src/animations/AnimationState.js:1498 — update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 2 (6 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.
  • update (cognitive 30) src/time/Clock.js:368 — update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 18). 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 · update (cognitive 19) · ×2
  • update (cognitive 19) src/renderer/webgl/wrappers/WebGLGlobalWrapper.js:68 — update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 2 (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.
  • update (cognitive 19) src/tweens/tween/TweenChain.js:393 — update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 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 · update (cognitive 18) · ×2
  • update (cognitive 18) src/tweens/tween/Tween.js:653 — update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (2 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.
  • update (cognitive 18) src/sound/webaudio/WebAudioSoundManager.js:438 — update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7 (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.
R10 · Code Duplication · Duplicated block with local edits (106 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (106 matched lines × 2 locations) src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextCanvasRenderer.js:23 — src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextCanvasRenderer.js:23 · src/gameobjects/bitmaptext/static/BitmapTextCanvasRenderer.js:23 — the two spans are one implementation copied and then locally edited — 623 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 (106 matched lines × 2 locations) src/geom/ellipse/Ellipse.js:37 — src/geom/ellipse/Ellipse.js:37 · src/geom/rectangle/Rectangle.js:36 — the two spans are one implementation copied and then locally edited — 525 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 (102 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (102 matched lines × 2 locations) src/tweens/tween/Tween.js:426 — src/tweens/tween/Tween.js:426 · src/tweens/tween/TweenChain.js:315 — the two spans are one implementation copied and then locally edited — 447 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 (102 matched lines × 2 locations) src/tweens/tween/TweenData.js:228 — src/tweens/tween/TweenData.js:228 · src/tweens/tween/TweenFrameData.js:160 — the two spans are one implementation copied and then locally edited — 468 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 (69 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (69 matched lines × 2 locations) src/loader/filetypes/MultiAtlasFile.js:41 — src/loader/filetypes/MultiAtlasFile.js:41 · src/loader/filetypes/PCTAtlasFile.js:94 — the two spans are one implementation copied and then locally edited — 468 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 (69 matched lines × 2 locations) src/textures/parsers/JSONArray.js:27 — src/textures/parsers/JSONArray.js:27 · src/textures/parsers/JSONHash.js:27 — the two spans are one implementation copied and then locally edited — 354 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 (57 lines × 2 locations) · ×2
  • Duplicated block (57 lines × 2 locations) src/gameobjects/shape/curve/CurveCanvasRenderer.js:25 — src/gameobjects/shape/curve/CurveCanvasRenderer.js:25 · src/gameobjects/shape/polygon/PolygonCanvasRenderer.js:25 — 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 (57 lines × 2 locations) src/renderer/webgl/renderNodes/submitter/SubmitterQuad.js:93 — src/renderer/webgl/renderNodes/submitter/SubmitterQuad.js:93 · src/renderer/webgl/renderNodes/submitter/SubmitterTileSprite.js:50 — 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.
R2 · Cyclomatic Complexity · Complex function Run (cyclomatic 25, cognitive 44) · ×2
  • Complex function Run (cyclomatic 25, cognitive 44) src/physics/arcade/ProcessX.js:187 — Run has cyclomatic complexity 25 and cognitive complexity 44; 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.
  • Complex function Run (cyclomatic 25, cognitive 44) src/physics/arcade/ProcessY.js:183 — Run has cyclomatic complexity 25 and cognitive complexity 44; 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×2
  • Swallowed exception (empty catch) src/device/Audio.js:112 — 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) src/device/Video.js:98 — 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.
D1 · Cyclomatic Complexity · startListeners (cyclomatic 58) · ×1
  • startListeners (cyclomatic 58) src/input/mouse/MouseManager.js:353 — startListeners has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 9 of the 58 points are its own statements and the rest belongs to 9 function items inside it that branch (onMouseDown, onMouseDownWindow, onMouseUpWindow, …). 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 · separateCircle (cyclomatic 45) · ×1
  • separateCircle (cyclomatic 45) src/physics/arcade/World.js:1469 — separateCircle 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 · HashSimplex.psrdnoise3d (cyclomatic 43) · ×1
  • HashSimplex.psrdnoise3d (cyclomatic 43) src/math/HashSimplex.js:453 — HashSimplex.psrdnoise3d has cyclomatic complexity 43 (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 · GetBitmapTextSize.GetBitmapTextSize (cyclomatic 40) · ×1
  • GetBitmapTextSize.GetBitmapTextSize (cyclomatic 40) src/gameobjects/bitmaptext/GetBitmapTextSize.js:28 — GetBitmapTextSize.GetBitmapTextSize has cyclomatic complexity 40 (threshold 15). Of this number, 38 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 · GraphicsWebGLRenderer.GraphicsWebGLRenderer (cyclomatic 40) · ×1
  • GraphicsWebGLRenderer.GraphicsWebGLRenderer (cyclomatic 40) src/gameobjects/graphics/GraphicsWebGLRenderer.js:63 — GraphicsWebGLRenderer.GraphicsWebGLRenderer has cyclomatic complexity 40 (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 · Features.init (cyclomatic 39) · ×1
  • Features.init (cyclomatic 39) src/device/Features.js:81 — Features.init has cyclomatic complexity 39 (threshold 15). Of this number, 36 points are the body's own statements and 3 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 · IsometricCullTiles.IsometricCullTiles (cyclomatic 39) · ×1
  • IsometricCullTiles.IsometricCullTiles (cyclomatic 39) src/tilemaps/components/IsometricCullTiles.js:22 — IsometricCullTiles.IsometricCullTiles 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 · update (cyclomatic 37) · ×1
  • update (cyclomatic 37) src/time/Timeline.js:288 — update 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 · OS.init (cyclomatic 35) · ×1
  • OS.init (cyclomatic 35) src/device/OS.js:62 — OS.init 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 · GridWebGLRenderer.GridWebGLRenderer (cyclomatic 35) · ×1
  • GridWebGLRenderer.GridWebGLRenderer (cyclomatic 35) src/gameobjects/shape/grid/GridWebGLRenderer.js:24 — GridWebGLRenderer.GridWebGLRenderer 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 · run (cyclomatic 34) · ×1
  • run (cyclomatic 34) src/renderer/webgl/renderNodes/Camera.js:120 — run has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GridCanvasRenderer.GridCanvasRenderer (cyclomatic 33) · ×1
  • GridCanvasRenderer.GridCanvasRenderer (cyclomatic 33) src/gameobjects/shape/grid/GridCanvasRenderer.js:25 — GridCanvasRenderer.GridCanvasRenderer 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 · RunCull.RunCull (cyclomatic 33) · ×1
  • RunCull.RunCull (cyclomatic 33) src/tilemaps/components/RunCull.js:20 — RunCull.RunCull has cyclomatic complexity 33 (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 · addMember (cyclomatic 33) · ×1
  • addMember (cyclomatic 33) src/gameobjects/spritegpulayer/SpriteGPULayer.js:793 — addMember 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 · update (cyclomatic 32) · ×1
  • update (cyclomatic 32) src/cameras/controls/SmoothedKeyControl.js:347 — update 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 · GraphicsCanvasRenderer.GraphicsCanvasRenderer (cyclomatic 31) · ×1
  • GraphicsCanvasRenderer.GraphicsCanvasRenderer (cyclomatic 31) src/gameobjects/graphics/GraphicsCanvasRenderer.js:26 — GraphicsCanvasRenderer.GraphicsCanvasRenderer has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ParseTileLayers.ParseTileLayers (cyclomatic 31) · ×1
  • ParseTileLayers.ParseTileLayers (cyclomatic 31) src/tilemaps/parsers/tiled/ParseTileLayers.js:44 — ParseTileLayers.ParseTileLayers has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ParseTilesets.ParseTilesets (cyclomatic 31) · ×1
  • ParseTilesets.ParseTilesets (cyclomatic 31) src/tilemaps/parsers/tiled/ParseTilesets.js:26 — ParseTilesets.ParseTilesets has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createFromObjects (cyclomatic 31) · ×1
  • createFromObjects (cyclomatic 31) src/tilemaps/Tilemap.js:803 — createFromObjects has cyclomatic complexity 31 (threshold 15). Of this number, 30 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 · updateText (cyclomatic 31) · ×1
  • updateText (cyclomatic 31) src/gameobjects/text/Text.js:1269 — updateText has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · processOverOutEvents (cyclomatic 30) · ×1
  • processOverOutEvents (cyclomatic 30) src/input/InputPlugin.js:1841 — processOverOutEvents has cyclomatic complexity 30 (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 · removePack (cyclomatic 30) · ×1
  • removePack (cyclomatic 30) src/loader/LoaderPlugin.js:712 — removePack has cyclomatic complexity 30 (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 · StaggerBuilder.StaggerBuilder (cyclomatic 29) · ×1
  • StaggerBuilder.StaggerBuilder (cyclomatic 29) src/tweens/builders/StaggerBuilder.js:52 — StaggerBuilder.StaggerBuilder has cyclomatic complexity 29 (threshold 15). Of this number, 15 points are the body's own statements and 14 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 · separate (cyclomatic 28) · ×1
  • separate (cyclomatic 28) src/physics/arcade/World.js:1354 — separate 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 · renderBody (cyclomatic 28) · ×1
  • renderBody (cyclomatic 28) src/physics/matter-js/World.js:1954 — renderBody 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 · PCTDecode.PCTDecode (cyclomatic 27) · ×1
  • PCTDecode.PCTDecode (cyclomatic 27) src/textures/parsers/PCTDecode.js:154 — PCTDecode.PCTDecode has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GetValueOp.GetValueOp (cyclomatic 27) · ×1
  • GetValueOp.GetValueOp (cyclomatic 27) src/tweens/builders/GetValueOp.js:70 — GetValueOp.GetValueOp has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · AddEffectShine.AddEffectShine (cyclomatic 26) · ×1
  • AddEffectShine.AddEffectShine (cyclomatic 26) src/actions/AddEffectShine.js:86 — AddEffectShine.AddEffectShine 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 · CreateRenderer.CreateRenderer (cyclomatic 25) · ×1
  • CreateRenderer.CreateRenderer (cyclomatic 25) src/core/CreateRenderer.js:30 — CreateRenderer.CreateRenderer has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LineToRectangle.LineToRectangle (cyclomatic 25) · ×1
  • LineToRectangle.LineToRectangle (cyclomatic 25) src/geom/intersects/LineToRectangle.js:26 — LineToRectangle.LineToRectangle 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 · ProcessX.Run (cyclomatic 25) · ×1
  • ProcessX.Run (cyclomatic 25) src/physics/arcade/ProcessX.js:187 — ProcessX.Run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ProcessY.Run (cyclomatic 25) · ×1
  • ProcessY.Run (cyclomatic 25) src/physics/arcade/ProcessY.js:183 — ProcessY.Run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ParseGID.ParseGID (cyclomatic 25) · ×1
  • ParseGID.ParseGID (cyclomatic 25) src/tilemaps/parsers/tiled/ParseGID.js:31 — ParseGID.ParseGID 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 · _renderCanvas (cyclomatic 25) · ×1
  • _renderCanvas (cyclomatic 25) src/textures/DynamicTexture.js:339 — _renderCanvas has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _completeLayout (cyclomatic 25) · ×1
  • _completeLayout (cyclomatic 25) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:296 — _completeLayout 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 · _copyAndCompleteConfig (cyclomatic 25) · ×1
  • _copyAndCompleteConfig (cyclomatic 25) src/renderer/webgl/renderNodes/BatchHandler.js:287 — _copyAndCompleteConfig 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 · run (cyclomatic 25) · ×1
  • run (cyclomatic 25) src/renderer/webgl/renderNodes/DynamicTextureHandler.js:68 — run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HashSimplex.HashSimplex (cyclomatic 24) · ×1
  • HashSimplex.HashSimplex (cyclomatic 24) src/math/HashSimplex.js:74 — HashSimplex.HashSimplex 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 · RectangleToTriangle.RectangleToTriangle (cyclomatic 23) · ×1
  • RectangleToTriangle.RectangleToTriangle (cyclomatic 23) src/geom/intersects/RectangleToTriangle.js:29 — RectangleToTriangle.RectangleToTriangle has cyclomatic complexity 23 (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 · collideSpriteVsGroup (cyclomatic 23) · ×1
  • collideSpriteVsGroup (cyclomatic 23) src/physics/arcade/World.js:2048 — collideSpriteVsGroup 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 · setConstraintRenderStyle (cyclomatic 23) · ×1
  • setConstraintRenderStyle (cyclomatic 23) src/physics/matter-js/World.js:474 — setConstraintRenderStyle has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · setEventsProxy (cyclomatic 23) · ×1
  • setEventsProxy (cyclomatic 23) src/physics/matter-js/World.js:568 — setEventsProxy has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 646, 583, 697, …). 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 · _setAnimatedValue (cyclomatic 23) · ×1
  • _setAnimatedValue (cyclomatic 23) src/gameobjects/spritegpulayer/SpriteGPULayer.js:1426 — _setAnimatedValue 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 · batchSprite (cyclomatic 23) · ×1
  • batchSprite (cyclomatic 23) src/renderer/canvas/CanvasRenderer.js:713 — batchSprite 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 · GetFirst.GetFirst (cyclomatic 22) · ×1
  • GetFirst.GetFirst (cyclomatic 22) src/utils/array/GetFirst.js:34 — GetFirst.GetFirst has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SpriteSheetFromAtlas.SpriteSheetFromAtlas (cyclomatic 22) · ×1
  • SpriteSheetFromAtlas.SpriteSheetFromAtlas (cyclomatic 22) src/textures/parsers/SpriteSheetFromAtlas.js:32 — SpriteSheetFromAtlas.SpriteSheetFromAtlas 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 · SeparateTile.SeparateTile (cyclomatic 22) · ×1
  • SeparateTile.SeparateTile (cyclomatic 22) src/physics/arcade/tilemap/SeparateTile.js:33 — SeparateTile.SeparateTile 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 · collideObjects (cyclomatic 22) · ×1
  • collideObjects (cyclomatic 22) src/physics/arcade/World.js:1816 — collideObjects has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · createFromConfig (cyclomatic 22) · ×1
  • createFromConfig (cyclomatic 22) src/gameobjects/group/Group.js:387 — createFromConfig 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 · NoiseSimplex3D (cyclomatic 22) · ×1
  • NoiseSimplex3D (cyclomatic 22) src/gameobjects/noise/noisesimplex3d/NoiseSimplex3D.js:67 — NoiseSimplex3D 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 · NoiseSimplex2D (cyclomatic 22) · ×1
  • NoiseSimplex2D (cyclomatic 22) src/gameobjects/noise/noisesimplex2d/NoiseSimplex2D.js:65 — NoiseSimplex2D 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 · DynamicBitmapTextWebGLRenderer.DynamicBitmapTextWebGLRenderer (cyclomatic 21) · ×1
  • DynamicBitmapTextWebGLRenderer.DynamicBitmapTextWebGLRenderer (cyclomatic 21) src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextWebGLRenderer.js:41 — DynamicBitmapTextWebGLRenderer.DynamicBitmapTextWebGLRenderer 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 · DynamicBitmapTextCanvasRenderer.DynamicBitmapTextCanvasRenderer (cyclomatic 21) · ×1
  • DynamicBitmapTextCanvasRenderer.DynamicBitmapTextCanvasRenderer (cyclomatic 21) src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextCanvasRenderer.js:23 — DynamicBitmapTextCanvasRenderer.DynamicBitmapTextCanvasRenderer 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 · GetOverlapX.GetOverlapX (cyclomatic 21) · ×1
  • GetOverlapX.GetOverlapX (cyclomatic 21) src/physics/arcade/GetOverlapX.js:23 — GetOverlapX.GetOverlapX 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 · GetOverlapY.GetOverlapY (cyclomatic 21) · ×1
  • GetOverlapY.GetOverlapY (cyclomatic 21) src/physics/arcade/GetOverlapY.js:23 — GetOverlapY.GetOverlapY 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 · ParseWangsets.ParseWangsets (cyclomatic 21) · ×1
  • ParseWangsets.ParseWangsets (cyclomatic 21) src/tilemaps/parsers/tiled/ParseWangsets.js:25 — ParseWangsets.ParseWangsets 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 · setConfig (cyclomatic 21) · ×1
  • setConfig (cyclomatic 21) src/gameobjects/particles/ParticleEmitter.js:983 — setConfig 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 · postUpdate (cyclomatic 21) · ×1
  • postUpdate (cyclomatic 21) src/physics/arcade/Body.js:1241 — postUpdate 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 · update (cyclomatic 21) · ×1
  • update (cyclomatic 21) src/input/keyboard/KeyboardPlugin.js:731 — update 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 · collideHandler (cyclomatic 20) · ×1
  • collideHandler (cyclomatic 20) src/physics/arcade/World.js:1909 — collideHandler 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 · setMethods (cyclomatic 20) · ×1
  • setMethods (cyclomatic 20) src/gameobjects/particles/EmitterOp.js:447 — setMethods has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · startListeners (cyclomatic 20) · ×1
  • startListeners (cyclomatic 20) src/input/keyboard/KeyboardManager.js:182 — startListeners has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (onKeyDown, onKeyUp). 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 · update (cyclomatic 20) · ×1
  • update (cyclomatic 20) src/tweens/tween/TweenData.js:218 — update has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BitmapTextCanvasRenderer.BitmapTextCanvasRenderer (cyclomatic 19) · ×1
  • BitmapTextCanvasRenderer.BitmapTextCanvasRenderer (cyclomatic 19) src/gameobjects/bitmaptext/static/BitmapTextCanvasRenderer.js:23 — BitmapTextCanvasRenderer.BitmapTextCanvasRenderer 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 · GetTilesWithin.GetTilesWithin (cyclomatic 19) · ×1
  • GetTilesWithin.GetTilesWithin (cyclomatic 19) src/tilemaps/components/GetTilesWithin.js:27 — GetTilesWithin.GetTilesWithin 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 · TweenBuilder.TweenBuilder (cyclomatic 19) · ×1
  • TweenBuilder.TweenBuilder (cyclomatic 19) src/tweens/builders/TweenBuilder.js:50 — TweenBuilder.TweenBuilder has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body's own statements and 7 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 · preUpdate (cyclomatic 19) · ×1
  • preUpdate (cyclomatic 19) src/gameobjects/particles/ParticleEmitter.js:2816 — preUpdate 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 · setBodyRenderStyle (cyclomatic 19) · ×1
  • setBodyRenderStyle (cyclomatic 19) src/physics/matter-js/World.js:387 — setBodyRenderStyle 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 · updateShaderConfig (cyclomatic 19) · ×1
  • updateShaderConfig (cyclomatic 19) src/renderer/webgl/renderNodes/BatchHandlerQuad.js:469 — updateShaderConfig 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 · setSlices (cyclomatic 19) · ×1
  • setSlices (cyclomatic 19) src/gameobjects/nineslice/NineSlice.js:428 — setSlices 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 · Config (cyclomatic 19) · ×1
  • Config (cyclomatic 19) src/core/Config.js:39 — Config 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 · Gamepad (cyclomatic 19) · ×1
  • Gamepad (cyclomatic 19) src/input/gamepad/Gamepad.js:36 — Gamepad 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 · Video.init (cyclomatic 18) · ×1
  • Video.init (cyclomatic 18) src/device/Video.js:45 — Video.init has cyclomatic complexity 18 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HashCell.worley (cyclomatic 18) · ×1
  • HashCell.worley (cyclomatic 18) src/math/HashCell.js:73 — HashCell.worley 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 · addTilesetImage (cyclomatic 18) · ×1
  • addTilesetImage (cyclomatic 18) src/tilemaps/Tilemap.js:398 — addTilesetImage 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 · computeVelocity (cyclomatic 18) · ×1
  • computeVelocity (cyclomatic 18) src/physics/arcade/World.js:1221 — computeVelocity 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 · startCapture (cyclomatic 18) · ×1
  • startCapture (cyclomatic 18) src/textures/DynamicTexture.js:885 — startCapture 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 · setSource (cyclomatic 18) · ×1
  • setSource (cyclomatic 18) src/textures/Texture.js:512 — setSource has cyclomatic complexity 18 (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 · AddMaskShape.AddMaskShape (cyclomatic 17) · ×1
  • AddMaskShape.AddMaskShape (cyclomatic 17) src/actions/AddMaskShape.js:60 — AddMaskShape.AddMaskShape 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 · DebugHeader.DebugHeader (cyclomatic 17) · ×1
  • DebugHeader.DebugHeader (cyclomatic 17) src/core/DebugHeader.js:24 — DebugHeader.DebugHeader 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 · CalculateFacesAt.CalculateFacesAt (cyclomatic 17) · ×1
  • CalculateFacesAt.CalculateFacesAt (cyclomatic 17) src/tilemaps/components/CalculateFacesAt.js:23 — CalculateFacesAt.CalculateFacesAt 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 · TilemapLayerCanvasRenderer.TilemapLayerCanvasRenderer (cyclomatic 17) · ×1
  • TilemapLayerCanvasRenderer.TilemapLayerCanvasRenderer (cyclomatic 17) src/tilemaps/TilemapLayerCanvasRenderer.js:27 — TilemapLayerCanvasRenderer.TilemapLayerCanvasRenderer 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 · createTextureFromSource (cyclomatic 17) · ×1
  • createTextureFromSource (cyclomatic 17) src/renderer/webgl/WebGLRenderer.js:1684 — createTextureFromSource 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 · setDataSource (cyclomatic 17) · ×1
  • setDataSource (cyclomatic 17) src/textures/Texture.js:562 — setDataSource 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 · GetValue.GetValue (cyclomatic 16) · ×1
  • GetValue.GetValue (cyclomatic 16) src/utils/object/GetValue.js:43 — GetValue.GetValue 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 · ContainerWebGLRenderer.ContainerWebGLRenderer (cyclomatic 16) · ×1
  • ContainerWebGLRenderer.ContainerWebGLRenderer (cyclomatic 16) src/gameobjects/container/ContainerWebGLRenderer.js:27 — ContainerWebGLRenderer.ContainerWebGLRenderer 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 · TriangleToTriangle.TriangleToTriangle (cyclomatic 16) · ×1
  • TriangleToTriangle.TriangleToTriangle (cyclomatic 16) src/geom/intersects/TriangleToTriangle.js:24 — TriangleToTriangle.TriangleToTriangle 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 · TileCheckX.TileCheckX (cyclomatic 16) · ×1
  • TileCheckX.TileCheckX (cyclomatic 16) src/physics/arcade/tilemap/TileCheckX.js:27 — TileCheckX.TileCheckX 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 · TileCheckY.TileCheckY (cyclomatic 16) · ×1
  • TileCheckY.TileCheckY (cyclomatic 16) src/physics/arcade/tilemap/TileCheckY.js:27 — TileCheckY.TileCheckY 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 · setHitArea (cyclomatic 16) · ×1
  • setHitArea (cyclomatic 16) src/input/InputPlugin.js:2357 — setHitArea 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 · setStyle (cyclomatic 16) · ×1
  • setStyle (cyclomatic 16) src/gameobjects/text/TextStyle.js:384 — setStyle 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.
D12 · Dependency Hygiene · Deprecated · ×1
  • Deprecated: @types/source-map package.json:61 — @types/source-map 0.5.7, declared in package.json, is marked deprecated by its publisher: "This is a stub types definition for source-map (https://github.com/mozilla/source-map). source-map provides its own type definitions, so you don't need @types/source-map installed!". Replace it with the package or version that message names, or record why this one must stay.
D2 · Cognitive Complexity · ParseTilesets.ParseTilesets (cognitive 107) · ×1
  • ParseTilesets.ParseTilesets (cognitive 107) src/tilemaps/parsers/tiled/ParseTilesets.js:26 — ParseTilesets.ParseTilesets has cognitive complexity 107 (threshold 15). Drivers by points: if/else 18 (73 pts), loops 6 (26 pts), boolean chains 8 (nesting depth added 75). 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 · HashSimplex.psrdnoise3d (cognitive 87) · ×1
  • HashSimplex.psrdnoise3d (cognitive 87) src/math/HashSimplex.js:453 — HashSimplex.psrdnoise3d has cognitive complexity 87 (threshold 15). Drivers by points: ternaries 18 (54 pts), loops 13 (21 pts), if/else 7 (11 pts), boolean chains 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ParseTileLayers.ParseTileLayers (cognitive 84) · ×1
  • ParseTileLayers.ParseTileLayers (cognitive 84) src/tilemaps/parsers/tiled/ParseTileLayers.js:44 — ParseTileLayers.ParseTileLayers has cognitive complexity 84 (threshold 15). Drivers by points: if/else 22 (58 pts), loops 7 (22 pts), boolean chains 4 (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 · update (cognitive 82) · ×1
  • update (cognitive 82) src/time/Timeline.js:288 — update has cognitive complexity 82 (threshold 15). Drivers by points: if/else 24 (62 pts), boolean chains 9, loops 4 (8 pts), ternaries 1 (3 pts) (nesting depth added 44). 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 · GridCanvasRenderer.GridCanvasRenderer (cognitive 78) · ×1
  • GridCanvasRenderer.GridCanvasRenderer (cognitive 78) src/gameobjects/shape/grid/GridCanvasRenderer.js:25 — GridCanvasRenderer.GridCanvasRenderer has cognitive complexity 78 (threshold 15). Drivers by points: if/else 14 (48 pts), loops 6 (20 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 50). 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 · removePack (cognitive 76) · ×1
  • removePack (cognitive 76) src/loader/LoaderPlugin.js:712 — removePack has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (57 pts), loops 3 (9 pts), ternaries 2 (9 pts), boolean chains 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GetBitmapTextSize.GetBitmapTextSize (cognitive 69) · ×1
  • GetBitmapTextSize.GetBitmapTextSize (cognitive 69) src/gameobjects/bitmaptext/GetBitmapTextSize.js:28 — GetBitmapTextSize.GetBitmapTextSize has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (59 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 33). Of this number, 66 points are the body's own statements and 3 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 · IsometricCullTiles.IsometricCullTiles (cognitive 66) · ×1
  • IsometricCullTiles.IsometricCullTiles (cognitive 66) src/tilemaps/components/IsometricCullTiles.js:22 — IsometricCullTiles.IsometricCullTiles has cognitive complexity 66 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 8 (20 pts), boolean chains 8 (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 · ParseWangsets.ParseWangsets (cognitive 62) · ×1
  • ParseWangsets.ParseWangsets (cognitive 62) src/tilemaps/parsers/tiled/ParseWangsets.js:25 — ParseWangsets.ParseWangsets has cognitive complexity 62 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 6 (20 pts), boolean chains 4 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GridWebGLRenderer.GridWebGLRenderer (cognitive 60) · ×1
  • GridWebGLRenderer.GridWebGLRenderer (cognitive 60) src/gameobjects/shape/grid/GridWebGLRenderer.js:24 — GridWebGLRenderer.GridWebGLRenderer has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 6 (14 pts), boolean chains 10, ternaries 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PCTDecode.PCTDecode (cognitive 57) · ×1
  • PCTDecode.PCTDecode (cognitive 57) src/textures/parsers/PCTDecode.js:154 — PCTDecode.PCTDecode has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (41 pts), loops 4 (13 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · updateText (cognitive 56) · ×1
  • updateText (cognitive 56) src/gameobjects/text/Text.js:1269 — updateText has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (41 pts), loops 3 (9 pts), boolean chains 6 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · processOverOutEvents (cognitive 54) · ×1
  • processOverOutEvents (cognitive 54) src/input/InputPlugin.js:1841 — processOverOutEvents has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 11, loops 4 (6 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · separateCircle (cognitive 54) · ×1
  • separateCircle (cognitive 54) src/physics/arcade/World.js:1469 — separateCircle has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 19 (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 · createFromObjects (cognitive 52) · ×1
  • createFromObjects (cognitive 52) src/tilemaps/Tilemap.js:803 — createFromObjects has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 12, ternaries 3 (6 pts), loops 3 (5 pts) (nesting depth added 21). Of this number, 50 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 · run (cognitive 52) · ×1
  • run (cognitive 52) src/renderer/webgl/renderNodes/Camera.js:120 — run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 3 (8 pts), boolean chains 7, ternaries 1 (3 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 · renderBody (cognitive 50) · ×1
  • renderBody (cognitive 50) src/physics/matter-js/World.js:1954 — renderBody has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (2 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.
D2 · Cognitive Complexity · GetValueOp.GetValueOp (cognitive 49) · ×1
  • GetValueOp.GetValueOp (cognitive 49) src/tweens/builders/GetValueOp.js:70 — GetValueOp.GetValueOp has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 4, match/switch 1 (3 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 · RunCull.RunCull (cognitive 48) · ×1
  • RunCull.RunCull (cognitive 48) src/tilemaps/components/RunCull.js:20 — RunCull.RunCull has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 8 (20 pts), boolean chains 8 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · addMember (cognitive 47) · ×1
  • addMember (cognitive 47) src/gameobjects/spritegpulayer/SpriteGPULayer.js:793 — addMember has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (23 pts), ternaries 15 (18 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · update (cognitive 46) · ×1
  • update (cognitive 46) src/input/keyboard/KeyboardPlugin.js:731 — update has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (40 pts), boolean chains 5, loops 1 (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 · SpriteSheetFromAtlas.SpriteSheetFromAtlas (cognitive 45) · ×1
  • SpriteSheetFromAtlas.SpriteSheetFromAtlas (cognitive 45) src/textures/parsers/SpriteSheetFromAtlas.js:32 — SpriteSheetFromAtlas.SpriteSheetFromAtlas has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (32 pts), ternaries 2 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProcessX.Run (cognitive 44) · ×1
  • ProcessX.Run (cognitive 44) src/physics/arcade/ProcessX.js:187 — ProcessX.Run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 6 (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 · ProcessY.Run (cognitive 44) · ×1
  • ProcessY.Run (cognitive 44) src/physics/arcade/ProcessY.js:183 — ProcessY.Run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 6 (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 · startListeners (cognitive 43) · ×1
  • startListeners (cognitive 43) src/input/mouse/MouseManager.js:353 — startListeners has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 16, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 9 of the 43 points are its own statements and the rest belongs to 9 function items inside it that branch (onMouseDown, onMouseUp, onMouseMove, …). 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 · update (cognitive 41) · ×1
  • update (cognitive 41) src/cameras/controls/SmoothedKeyControl.js:347 — update has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 6 (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 · GraphicsWebGLRenderer.GraphicsWebGLRenderer (cognitive 40) · ×1
  • GraphicsWebGLRenderer.GraphicsWebGLRenderer (cognitive 40) src/gameobjects/graphics/GraphicsWebGLRenderer.js:63 — GraphicsWebGLRenderer.GraphicsWebGLRenderer has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (10 pts), boolean chains 7, match/switch 1 (2 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 · run (cognitive 40) · ×1
  • run (cognitive 40) src/renderer/webgl/renderNodes/DynamicTextureHandler.js:68 — run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · update (cognitive 40) · ×1
  • update (cognitive 40) src/tweens/tween/TweenData.js:218 — update has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setEventsProxy (cognitive 39) · ×1
  • setEventsProxy (cognitive 39) src/physics/matter-js/World.js:568 — setEventsProxy has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 1 (2 pts) (nesting depth added 17). Most of this is not in the body itself: 1 of the 39 points is its own statement and the rest belongs to 14 function literals inside it that branch (lines 646, 583, 697, …). 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 · collideObjects (cognitive 37) · ×1
  • collideObjects (cognitive 37) src/physics/arcade/World.js:1816 — collideObjects has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 9 (14 pts), boolean chains 6 (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 · FindByIndex.FindByIndex (cognitive 36) · ×1
  • FindByIndex.FindByIndex (cognitive 36) src/tilemaps/components/FindByIndex.js:24 — FindByIndex.FindByIndex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _setAnimatedValue (cognitive 35) · ×1
  • _setAnimatedValue (cognitive 35) src/gameobjects/spritegpulayer/SpriteGPULayer.js:1426 — _setAnimatedValue has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 8, ternaries 2 (4 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 · updateShaderConfig (cognitive 35) · ×1
  • updateShaderConfig (cognitive 35) src/renderer/webgl/renderNodes/BatchHandlerQuad.js:469 — updateShaderConfig has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 3 (9 pts), loops 1 (2 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 · OS.init (cognitive 34) · ×1
  • OS.init (cognitive 34) src/device/OS.js:62 — OS.init has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 11 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · separate (cognitive 34) · ×1
  • separate (cognitive 34) src/physics/arcade/World.js:1354 — separate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 10 (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 · collideSpriteVsGroup (cognitive 34) · ×1
  • collideSpriteVsGroup (cognitive 34) src/physics/arcade/World.js:2048 — collideSpriteVsGroup has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 4, loops 2 (4 pts), ternaries 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _renderCanvas (cognitive 34) · ×1
  • _renderCanvas (cognitive 34) src/textures/DynamicTexture.js:339 — _renderCanvas has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 2, match/switch 1 (2 pts), loops 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 · advancedWordWrap (cognitive 33) · ×1
  • advancedWordWrap (cognitive 33) src/gameobjects/text/Text.js:425 — advancedWordWrap has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (8 pts), ternaries 1 (4 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 · CreateRenderer.CreateRenderer (cognitive 32) · ×1
  • CreateRenderer.CreateRenderer (cognitive 32) src/core/CreateRenderer.js:30 — CreateRenderer.CreateRenderer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 6 (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 · batchSprite (cognitive 32) · ×1
  • batchSprite (cognitive 32) src/renderer/canvas/CanvasRenderer.js:713 — batchSprite has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (30 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 · AddEffectShine.AddEffectShine (cognitive 31) · ×1
  • AddEffectShine.AddEffectShine (cognitive 31) src/actions/AddEffectShine.js:86 — AddEffectShine.AddEffectShine has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, 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 · TweenBuilder.TweenBuilder (cognitive 31) · ×1
  • TweenBuilder.TweenBuilder (cognitive 31) src/tweens/builders/TweenBuilder.js:50 — TweenBuilder.TweenBuilder has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). Of this number, 19 points are the body's own statements and 12 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 · computeVelocity (cognitive 31) · ×1
  • computeVelocity (cognitive 31) src/physics/arcade/World.js:1221 — computeVelocity has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · getHandler (cognitive 31) · ×1
  • getHandler (cognitive 31) src/gameobjects/group/Group.js:942 — getHandler has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2 (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.
D2 · Cognitive Complexity · GetOverlapX.GetOverlapX (cognitive 30) · ×1
  • GetOverlapX.GetOverlapX (cognitive 30) src/physics/arcade/GetOverlapX.js:23 — GetOverlapX.GetOverlapX has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 9 (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 · GetOverlapY.GetOverlapY (cognitive 30) · ×1
  • GetOverlapY.GetOverlapY (cognitive 30) src/physics/arcade/GetOverlapY.js:23 — GetOverlapY.GetOverlapY has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 9 (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 · GetTilesWithin.GetTilesWithin (cognitive 30) · ×1
  • GetTilesWithin.GetTilesWithin (cognitive 30) src/tilemaps/components/GetTilesWithin.js:27 — GetTilesWithin.GetTilesWithin has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 2 (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 · createFromAseprite (cognitive 30) · ×1
  • createFromAseprite (cognitive 30) src/animations/AnimationManager.js:406 — createFromAseprite has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 16). Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 428). 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 · DynamicBitmapTextWebGLRenderer.DynamicBitmapTextWebGLRenderer (cognitive 29) · ×1
  • DynamicBitmapTextWebGLRenderer.DynamicBitmapTextWebGLRenderer (cognitive 29) src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextWebGLRenderer.js:41 — DynamicBitmapTextWebGLRenderer.DynamicBitmapTextWebGLRenderer has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 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.
D2 · Cognitive Complexity · SetCollisionByProperty.SetCollisionByProperty (cognitive 29) · ×1
  • SetCollisionByProperty.SetCollisionByProperty (cognitive 29) src/tilemaps/components/SetCollisionByProperty.js:28 — SetCollisionByProperty.SetCollisionByProperty has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 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 · SeparateTile.SeparateTile (cognitive 28) · ×1
  • SeparateTile.SeparateTile (cognitive 28) src/physics/arcade/tilemap/SeparateTile.js:33 — SeparateTile.SeparateTile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7 (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 · preUpdate (cognitive 28) · ×1
  • preUpdate (cognitive 28) src/gameobjects/particles/ParticleEmitter.js:2816 — preUpdate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · renderBodyAxes (cognitive 28) · ×1
  • renderBodyAxes (cognitive 28) src/physics/matter-js/World.js:1739 — renderBodyAxes has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (15 pts), ternaries 2 (8 pts), if/else 3 (5 pts) (nesting depth added 18). 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 · addToCache (cognitive 28) · ×1
  • addToCache (cognitive 28) src/loader/filetypes/CompressedTextureFile.js:207 — addToCache has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 15). 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 · _completeLayout (cognitive 28) · ×1
  • _completeLayout (cognitive 28) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:296 — _completeLayout has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 16, if/else 4 (6 pts), loops 4 (6 pts) (nesting depth added 4). 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 · BlitterCanvasRenderer.BlitterCanvasRenderer (cognitive 27) · ×1
  • BlitterCanvasRenderer.BlitterCanvasRenderer (cognitive 27) src/gameobjects/blitter/BlitterCanvasRenderer.js:21 — BlitterCanvasRenderer.BlitterCanvasRenderer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, 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 · postUpdate (cognitive 27) · ×1
  • postUpdate (cognitive 27) src/physics/arcade/Body.js:1241 — postUpdate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7 (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 · setSlices (cognitive 27) · ×1
  • setSlices (cognitive 27) src/gameobjects/nineslice/NineSlice.js:428 — setSlices has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (25 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 · Audio.init (cognitive 26) · ×1
  • Audio.init (cognitive 26) src/device/Audio.js:46 — Audio.init has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, error handling 1 (nesting depth added 11). Of this number, 22 points are the body's own statements and 4 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 · HashCell.worley (cognitive 26) · ×1
  • HashCell.worley (cognitive 26) src/math/HashCell.js:73 — HashCell.worley has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2, match/switch 1 (2 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 · HashSimplex (cognitive 26) · ×1
  • HashSimplex (cognitive 26) src/math/HashSimplex.js:74 — HashSimplex has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (7 pts), loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 4). 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 · _copyAndCompleteConfig (cognitive 26) · ×1
  • _copyAndCompleteConfig (cognitive 26) src/renderer/webgl/renderNodes/BatchHandler.js:287 — _copyAndCompleteConfig has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 19, if/else 3 (4 pts), loops 2 (3 pts) (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 · setRenderOptions (cognitive 26) · ×1
  • setRenderOptions (cognitive 26) src/renderer/webgl/renderNodes/submitter/SubmitterQuad.js:231 — setRenderOptions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (25 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 · GetValue.GetValue (cognitive 25) · ×1
  • GetValue.GetValue (cognitive 25) src/utils/object/GetValue.js:43 — GetValue.GetValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DebugHeader.DebugHeader (cognitive 25) · ×1
  • DebugHeader.DebugHeader (cognitive 25) src/core/DebugHeader.js:24 — DebugHeader.DebugHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DynamicBitmapTextCanvasRenderer.DynamicBitmapTextCanvasRenderer (cognitive 25) · ×1
  • DynamicBitmapTextCanvasRenderer.DynamicBitmapTextCanvasRenderer (cognitive 25) src/gameobjects/bitmaptext/dynamic/DynamicBitmapTextCanvasRenderer.js:23 — DynamicBitmapTextCanvasRenderer.DynamicBitmapTextCanvasRenderer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 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 · RenderDebug.RenderDebug (cognitive 25) · ×1
  • RenderDebug.RenderDebug (cognitive 25) src/tilemaps/components/RenderDebug.js:27 — RenderDebug.RenderDebug has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 5 (7 pts), 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 · updateScale (cognitive 25) · ×1
  • updateScale (cognitive 25) src/scale/ScaleManager.js:1030 — updateScale has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (6 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 · createFromConfig (cognitive 25) · ×1
  • createFromConfig (cognitive 25) src/gameobjects/group/Group.js:387 — createFromConfig has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), loops 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 · GetFirst.GetFirst (cognitive 24) · ×1
  • GetFirst.GetFirst (cognitive 24) src/utils/array/GetFirst.js:34 — GetFirst.GetFirst has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (5 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 · GridAlign.GridAlign (cognitive 24) · ×1
  • GridAlign.GridAlign (cognitive 24) src/actions/GridAlign.js:40 — GridAlign.GridAlign has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LineToRectangle.LineToRectangle (cognitive 24) · ×1
  • LineToRectangle.LineToRectangle (cognitive 24) src/geom/intersects/LineToRectangle.js:26 — LineToRectangle.LineToRectangle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 11 (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 · emitParticle (cognitive 24) · ×1
  • emitParticle (cognitive 24) src/gameobjects/particles/ParticleEmitter.js:2698 — emitParticle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · addToScene (cognitive 24) · ×1
  • addToScene (cognitive 24) src/plugins/PluginManager.js:227 — addToScene has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (5 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 · addMultiToCache (cognitive 24) · ×1
  • addMultiToCache (cognitive 24) src/loader/filetypes/CompressedTextureFile.js:283 — addMultiToCache has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · run (cognitive 24) · ×1
  • run (cognitive 24) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:552 — run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (5 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 · QuickSelect.QuickSelect (cognitive 23) · ×1
  • QuickSelect.QuickSelect (cognitive 23) src/utils/array/QuickSelect.js:44 — QuickSelect.QuickSelect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (9 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 · Features.init (cognitive 23) · ×1
  • Features.init (cognitive 23) src/device/Features.js:81 — Features.init has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 7, error handling 2 (3 pts) (nesting depth added 1). Of this number, 19 points are the body's own statements and 4 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.
D2 · Cognitive Complexity · ContainerWebGLRenderer.ContainerWebGLRenderer (cognitive 23) · ×1
  • ContainerWebGLRenderer.ContainerWebGLRenderer (cognitive 23) src/gameobjects/container/ContainerWebGLRenderer.js:27 — ContainerWebGLRenderer.ContainerWebGLRenderer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · getBounds (cognitive 23) · ×1
  • getBounds (cognitive 23) src/gameobjects/particles/ParticleEmitter.js:2994 — getBounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (7 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 · processOverEvents (cognitive 23) · ×1
  • processOverEvents (cognitive 23) src/input/InputPlugin.js:1676 — processOverEvents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · processOutEvents (cognitive 23) · ×1
  • processOutEvents (cognitive 23) src/input/InputPlugin.js:1758 — processOutEvents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setConstraintRenderStyle (cognitive 23) · ×1
  • setConstraintRenderStyle (cognitive 23) src/physics/matter-js/World.js:474 — setConstraintRenderStyle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 6 (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 · Config (cognitive 23) · ×1
  • Config (cognitive 23) src/core/Config.js:39 — Config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · renderWebGLFilters (cognitive 23) · ×1
  • renderWebGLFilters (cognitive 23) src/gameobjects/components/Filters.js:306 — renderWebGLFilters has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AddMaskShape.AddMaskShape (cognitive 22) · ×1
  • AddMaskShape.AddMaskShape (cognitive 22) src/actions/AddMaskShape.js:60 — AddMaskShape.AddMaskShape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (3 pts), boolean chains 2, match/switch 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 · BitmapTextCanvasRenderer.BitmapTextCanvasRenderer (cognitive 22) · ×1
  • BitmapTextCanvasRenderer.BitmapTextCanvasRenderer (cognitive 22) src/gameobjects/bitmaptext/static/BitmapTextCanvasRenderer.js:23 — BitmapTextCanvasRenderer.BitmapTextCanvasRenderer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1, ternaries 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 · GraphicsCanvasRenderer.GraphicsCanvasRenderer (cognitive 22) · ×1
  • GraphicsCanvasRenderer.GraphicsCanvasRenderer (cognitive 22) src/gameobjects/graphics/GraphicsCanvasRenderer.js:26 — GraphicsCanvasRenderer.GraphicsCanvasRenderer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CreateFromTiles.CreateFromTiles (cognitive 22) · ×1
  • CreateFromTiles.CreateFromTiles (cognitive 22) src/tilemaps/components/CreateFromTiles.js:29 — CreateFromTiles.CreateFromTiles has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (6 pts) (nesting depth added 8). Of this number, 19 points are the body's own statements and 3 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 · SetCollisionBetween.SetCollisionBetween (cognitive 22) · ×1
  • SetCollisionBetween.SetCollisionBetween (cognitive 22) src/tilemaps/components/SetCollisionBetween.js:27 — SetCollisionBetween.SetCollisionBetween has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TilemapLayerCanvasRenderer.TilemapLayerCanvasRenderer (cognitive 22) · ×1
  • TilemapLayerCanvasRenderer.TilemapLayerCanvasRenderer (cognitive 22) src/tilemaps/TilemapLayerCanvasRenderer.js:27 — TilemapLayerCanvasRenderer.TilemapLayerCanvasRenderer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), boolean chains 4, 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 · StaggerBuilder.StaggerBuilder (cognitive 22) · ×1
  • StaggerBuilder.StaggerBuilder (cognitive 22) src/tweens/builders/StaggerBuilder.js:52 — StaggerBuilder.StaggerBuilder has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (5 pts), ternaries 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · updatePoll (cognitive 22) · ×1
  • updatePoll (cognitive 22) src/input/InputPlugin.js:589 — updatePoll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · collideHandler (cognitive 22) · ×1
  • collideHandler (cognitive 22) src/physics/arcade/World.js:1909 — collideHandler has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6 (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 · renderBodies (cognitive 22) · ×1
  • renderBodies (cognitive 22) src/physics/matter-js/World.js:1852 — renderBodies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, 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 · parseConfig (cognitive 22) · ×1
  • parseConfig (cognitive 22) src/scale/ScaleManager.js:475 — parseConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · onFileComplete (cognitive 22) · ×1
  • onFileComplete (cognitive 22) src/loader/filetypes/CompressedTextureFile.js:115 — onFileComplete has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (3 pts), boolean chains 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 · AddAt.AddAt (cognitive 21) · ×1
  • AddAt.AddAt (cognitive 21) src/utils/array/AddAt.js:33 — AddAt.AddAt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · JSONArray.JSONArray (cognitive 21) · ×1
  • JSONArray.JSONArray (cognitive 21) src/textures/parsers/JSONArray.js:24 — JSONArray.JSONArray has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 2, ternaries 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 · JSONHash.JSONHash (cognitive 21) · ×1
  • JSONHash.JSONHash (cognitive 21) src/textures/parsers/JSONHash.js:24 — JSONHash.JSONHash has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2, 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 · TileCheckX.TileCheckX (cognitive 21) · ×1
  • TileCheckX.TileCheckX (cognitive 21) src/physics/arcade/tilemap/TileCheckX.js:27 — TileCheckX.TileCheckX has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4 (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 · TileCheckY.TileCheckY (cognitive 21) · ×1
  • TileCheckY.TileCheckY (cognitive 21) src/physics/arcade/tilemap/TileCheckY.js:27 — TileCheckY.TileCheckY has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4 (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 · setConfig (cognitive 21) · ×1
  • setConfig (cognitive 21) src/gameobjects/particles/ParticleEmitter.js:983 — setConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 2, loops 2 (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 · processDragMoveEvent (cognitive 21) · ×1
  • processDragMoveEvent (cognitive 21) src/input/InputPlugin.js:1317 — processDragMoveEvent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 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 · setHitArea (cognitive 21) · ×1
  • setHitArea (cognitive 21) src/input/InputPlugin.js:2357 — setHitArea has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 2 (4 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 · renderCollisions (cognitive 21) · ×1
  • renderCollisions (cognitive 21) src/physics/matter-js/World.js:1578 — renderCollisions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NoiseSimplex3D (cognitive 21) · ×1
  • NoiseSimplex3D (cognitive 21) src/gameobjects/noise/noisesimplex3d/NoiseSimplex3D.js:67 — NoiseSimplex3D has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 5, ternaries 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 · NoiseSimplex2D (cognitive 21) · ×1
  • NoiseSimplex2D (cognitive 21) src/gameobjects/noise/noisesimplex2d/NoiseSimplex2D.js:65 — NoiseSimplex2D has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 5, ternaries 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 · MatrixToString.MatrixToString (cognitive 20) · ×1
  • MatrixToString.MatrixToString (cognitive 20) src/utils/array/matrix/MatrixToString.js:39 — MatrixToString.MatrixToString has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 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 · Add.Add (cognitive 20) · ×1
  • Add.Add (cognitive 20) src/utils/array/Add.js:30 — Add.Add has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NumberArray.NumberArray (cognitive 20) · ×1
  • NumberArray.NumberArray (cognitive 20) src/utils/array/NumberArray.js:33 — NumberArray.NumberArray has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 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 · MarchingAnts.MarchingAnts (cognitive 20) · ×1
  • MarchingAnts.MarchingAnts (cognitive 20) src/geom/rectangle/MarchingAnts.js:32 — MarchingAnts.MarchingAnts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), boolean chains 1, 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 · ParticleEmitterWebGLRenderer.ParticleEmitterWebGLRenderer (cognitive 20) · ×1
  • ParticleEmitterWebGLRenderer.ParticleEmitterWebGLRenderer (cognitive 20) src/gameobjects/particles/ParticleEmitterWebGLRenderer.js:34 — ParticleEmitterWebGLRenderer.ParticleEmitterWebGLRenderer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MeasureText.MeasureText (cognitive 20) · ×1
  • MeasureText.MeasureText (cognitive 20) src/gameobjects/text/MeasureText.js:19 — MeasureText.MeasureText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (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.
D2 · Cognitive Complexity · CalculateFacesAt.CalculateFacesAt (cognitive 20) · ×1
  • CalculateFacesAt.CalculateFacesAt (cognitive 20) src/tilemaps/components/CalculateFacesAt.js:23 — CalculateFacesAt.CalculateFacesAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6 (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 · setBodyRenderStyle (cognitive 20) · ×1
  • setBodyRenderStyle (cognitive 20) src/physics/matter-js/World.js:387 — setBodyRenderStyle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 5, ternaries 2 (4 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 · renderConstraint (cognitive 20) · ×1
  • renderConstraint (cognitive 20) src/physics/matter-js/World.js:2169 — renderConstraint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 1 (4 pts), loops 1 (3 pts), boolean chains 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 · requestVideoFrame (cognitive 20) · ×1
  • requestVideoFrame (cognitive 20) src/gameobjects/video/Video.js:872 — requestVideoFrame has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setSize (cognitive 20) · ×1
  • setSize (cognitive 20) src/textures/DynamicTexture.js:222 — setSize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · draw (cognitive 20) · ×1
  • draw (cognitive 20) src/textures/DynamicTexture.js:793 — draw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setPoints (cognitive 20) · ×1
  • setPoints (cognitive 20) src/gameobjects/rope/Rope.js:724 — setPoints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · updateUVs (cognitive 20) · ×1
  • updateUVs (cognitive 20) src/gameobjects/rope/Rope.js:813 — updateUVs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 pts), 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 · addToCache (cognitive 20) · ×1
  • addToCache (cognitive 20) src/loader/filetypes/MultiAtlasFile.js:162 — addToCache has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (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.
D2 · Cognitive Complexity · CompressedTextureFile.FileTypesManager.register("texture") (cognitive 19) · ×1
  • CompressedTextureFile.FileTypesManager.register("texture") (cognitive 19) src/loader/filetypes/CompressedTextureFile.js:512 — CompressedTextureFile.FileTypesManager.register("texture") has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (AddEntry). 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 · HexagonalTileToWorldXY.HexagonalTileToWorldXY (cognitive 19) · ×1
  • HexagonalTileToWorldXY.HexagonalTileToWorldXY (cognitive 19) src/tilemaps/components/HexagonalTileToWorldXY.js:25 — HexagonalTileToWorldXY.HexagonalTileToWorldXY has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · processDownEvents (cognitive 19) · ×1
  • processDownEvents (cognitive 19) src/input/InputPlugin.js:1021 — processDownEvents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, 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 · processMoveEvents (cognitive 19) · ×1
  • processMoveEvents (cognitive 19) src/input/InputPlugin.js:1536 — processMoveEvents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, 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 · processUpEvents (cognitive 19) · ×1
  • processUpEvents (cognitive 19) src/input/InputPlugin.js:2021 — processUpEvents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, 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 · addTilesetImage (cognitive 19) · ×1
  • addTilesetImage (cognitive 19) src/tilemaps/Tilemap.js:398 — addTilesetImage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4 (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 · loadHandler (cognitive 19) · ×1
  • loadHandler (cognitive 19) src/gameobjects/video/Video.js:757 — loadHandler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 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 · basicWordWrap (cognitive 19) · ×1
  • basicWordWrap (cognitive 19) src/gameobjects/text/Text.js:547 — basicWordWrap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 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 · overlap (cognitive 19) · ×1
  • overlap (cognitive 19) src/physics/matter-js/MatterPhysics.js:772 — overlap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), ternaries 1 (3 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 · addPack (cognitive 19) · ×1
  • addPack (cognitive 19) src/loader/LoaderPlugin.js:634 — addPack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), ternaries 1 (4 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 · preRender (cognitive 19) · ×1
  • preRender (cognitive 19) src/cameras/2d/Camera.js:522 — preRender has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 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 · setAlphas (cognitive 19) · ×1
  • setAlphas (cognitive 19) src/gameobjects/rope/Rope.js:525 — setAlphas has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setMethods (cognitive 19) · ×1
  • setMethods (cognitive 19) src/gameobjects/particles/EmitterOp.js:447 — setMethods has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 2, if/else 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · fire (cognitive 19) · ×1
  • fire (cognitive 19) src/gameobjects/particles/Particle.js:443 — fire has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, ternaries 2, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · (anonymous) (cognitive 19) · ×1
  • (anonymous) (cognitive 19) src/loader/filetypes/CompressedTextureFile.js:512 — (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (AddEntry). 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 · refreshPads (cognitive 19) · ×1
  • refreshPads (cognitive 19) src/input/gamepad/GamepadPlugin.js:341 — refreshPads has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _completeConfig (cognitive 19) · ×1
  • _completeConfig (cognitive 19) src/renderer/webgl/renderNodes/ShaderQuad.js:155 — _completeConfig has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5 (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 · Video.init (cognitive 18) · ×1
  • Video.init (cognitive 18) src/device/Video.js:45 — Video.init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GetEaseFunction.GetEaseFunction (cognitive 18) · ×1
  • GetEaseFunction.GetEaseFunction (cognitive 18) src/tweens/builders/GetEaseFunction.js:29 — GetEaseFunction.GetEaseFunction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setExtensions (cognitive 18) · ×1
  • setExtensions (cognitive 18) src/renderer/webgl/WebGLRenderer.js:862 — setExtensions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 4 (5 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 · createTextureFromSource (cognitive 18) · ×1
  • createTextureFromSource (cognitive 18) src/renderer/webgl/WebGLRenderer.js:1684 — createTextureFromSource has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 5, ternaries 3 (4 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 · startCapture (cognitive 18) · ×1
  • startCapture (cognitive 18) src/textures/DynamicTexture.js:885 — startCapture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · onTouchMove (cognitive 18) · ×1
  • onTouchMove (cognitive 18) src/input/InputManager.js:598 — onTouchMove has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setStyle (cognitive 18) · ×1
  • setStyle (cognitive 18) src/gameobjects/text/TextStyle.js:384 — setStyle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · getFrames (cognitive 18) · ×1
  • getFrames (cognitive 18) src/animations/Animation.js:395 — getFrames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setCropUVs (cognitive 18) · ×1
  • setCropUVs (cognitive 18) src/textures/Frame.js:549 — setCropUVs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resize (cognitive 18) · ×1
  • resize (cognitive 18) src/renderer/webgl/DrawingContext.js:262 — resize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 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 · Gamepad (cognitive 18) · ×1
  • Gamepad (cognitive 18) src/input/gamepad/Gamepad.js:36 — Gamepad has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 16, loops 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 · FindClosestInSorted.FindClosestInSorted (cognitive 17) · ×1
  • FindClosestInSorted.FindClosestInSorted (cognitive 17) src/utils/array/FindClosestInSorted.js:22 — FindClosestInSorted.FindClosestInSorted has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · HashSimplex.psrdnoise2d (cognitive 17) · ×1
  • HashSimplex.psrdnoise2d (cognitive 17) src/math/HashSimplex.js:235 — HashSimplex.psrdnoise2d has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 6 (7 pts), boolean chains 1, 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 · SpriteSheet.SpriteSheet (cognitive 17) · ×1
  • SpriteSheet.SpriteSheet (cognitive 17) src/textures/parsers/SpriteSheet.js:36 — SpriteSheet.SpriteSheet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BitmapTextWebGLRenderer.BitmapTextWebGLRenderer (cognitive 17) · ×1
  • BitmapTextWebGLRenderer.BitmapTextWebGLRenderer (cognitive 17) src/gameobjects/bitmaptext/static/BitmapTextWebGLRenderer.js:41 — BitmapTextWebGLRenderer.BitmapTextWebGLRenderer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (3 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 · IsoTriangleCanvasRenderer.IsoTriangleCanvasRenderer (cognitive 17) · ×1
  • IsoTriangleCanvasRenderer.IsoTriangleCanvasRenderer (cognitive 17) src/gameobjects/shape/isotriangle/IsoTriangleCanvasRenderer.js:24 — IsoTriangleCanvasRenderer.IsoTriangleCanvasRenderer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 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 · GetLineToCircle.GetLineToCircle (cognitive 17) · ×1
  • GetLineToCircle.GetLineToCircle (cognitive 17) src/geom/intersects/GetLineToCircle.js:24 — GetLineToCircle.GetLineToCircle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetCollision.SetCollision (cognitive 17) · ×1
  • SetCollision.SetCollision (cognitive 17) src/tilemaps/components/SetCollision.js:29 — SetCollision.SetCollision has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · collideSpriteVsTilesHandler (cognitive 17) · ×1
  • collideSpriteVsTilesHandler (cognitive 17) src/physics/arcade/World.js:2323 — collideSpriteVsTilesHandler has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1, 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 · drawDebug (cognitive 17) · ×1
  • drawDebug (cognitive 17) src/physics/arcade/Body.js:1875 — drawDebug has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 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 · fileProcessComplete (cognitive 17) · ×1
  • fileProcessComplete (cognitive 17) src/loader/LoaderPlugin.js:1080 — fileProcessComplete has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (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 · _processUniformRequest (cognitive 17) · ×1
  • _processUniformRequest (cognitive 17) src/renderer/webgl/wrappers/WebGLProgramWrapper.js:477 — _processUniformRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · init (cognitive 17) · ×1
  • init (cognitive 17) src/textures/TextureSource.js:225 — init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 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 · ShiftPosition.ShiftPosition (cognitive 16) · ×1
  • ShiftPosition.ShiftPosition (cognitive 16) src/actions/ShiftPosition.js:43 — ShiftPosition.ShiftPosition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GetScreenOrientation.GetScreenOrientation (cognitive 16) · ×1
  • GetScreenOrientation.GetScreenOrientation (cognitive 16) src/dom/GetScreenOrientation.js:26 — GetScreenOrientation.GetScreenOrientation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (5 pts), boolean chains 3 (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 · PCTDecode.expandNames (cognitive 16) · ×1
  • PCTDecode.expandNames (cognitive 16) src/textures/parsers/PCTDecode.js:81 — PCTDecode.expandNames has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 3 (4 pts), loops 2 (4 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 · AssignTileProperties.AssignTileProperties (cognitive 16) · ×1
  • AssignTileProperties.AssignTileProperties (cognitive 16) src/tilemaps/parsers/tiled/AssignTileProperties.js:23 — AssignTileProperties.AssignTileProperties has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 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 · BuildTilesetIndex.BuildTilesetIndex (cognitive 16) · ×1
  • BuildTilesetIndex.BuildTilesetIndex (cognitive 16) src/tilemaps/parsers/tiled/BuildTilesetIndex.js:24 — BuildTilesetIndex.BuildTilesetIndex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (6 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 · ParseGID.ParseGID (cognitive 16) · ×1
  • ParseGID.ParseGID (cognitive 16) src/tilemaps/parsers/tiled/ParseGID.js:31 — ParseGID.ParseGID has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. 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 · addEmitZone (cognitive 16) · ×1
  • addEmitZone (cognitive 16) src/gameobjects/particles/ParticleEmitter.js:1858 — addEmitZone has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 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 · processWheelEvent (cognitive 16) · ×1
  • processWheelEvent (cognitive 16) src/input/InputPlugin.js:1606 — processWheelEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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 · addCompressedTexture (cognitive 16) · ×1
  • addCompressedTexture (cognitive 16) src/textures/TextureManager.js:564 — addCompressedTexture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 8). Of this number, 11 points are the body's own statements and 5 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 · setPadding (cognitive 16) · ×1
  • setPadding (cognitive 16) src/gameobjects/text/Text.js:1143 — setPadding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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 · createSceneFromObject (cognitive 16) · ×1
  • createSceneFromObject (cognitive 16) src/scene/SceneManager.js:731 — createSceneFromObject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · constrain (cognitive 16) · ×1
  • constrain (cognitive 16) src/structs/Size.js:470 — constrain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 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.
D2 · Cognitive Complexity · updateRenderOptions (cognitive 16) · ×1
  • updateRenderOptions (cognitive 16) src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js:368 — updateRenderOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · unlock (cognitive 16) · ×1
  • unlock (cognitive 16) src/sound/html5/HTML5AudioSoundManager.js:169 — unlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3, boolean chains 2 (nesting depth added 3). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 255, a function literal at line 175, a function literal at line 215, …). 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.
D30 · Dependency Vulnerabilities · Medium vulnerability · ×1
  • REDACTED
D35 · Change Coupling · Change coupling clique · ×1
  • Change coupling clique: FilterList.js, RenderNodeManager.js, index.js src/gameobjects/components/FilterList.js — 3 files — `src/gameobjects/components/FilterList.js`, `src/renderer/webgl/renderNodes/RenderNodeManager.js`, `src/renderer/webgl/renderNodes/index.js` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
IC1 · Incompleteness & stubs · Both branches are identical · ×1
  • Both branches are identical — the condition decides nothing src/tilemaps/components/GetTileCornersFunction.js:36 — The `if` and its `else` contain the same statements, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 0 typed · 3136 plain JS — the untyped files are src/actions/AddEffectBloom.js, src/actions/AddEffectShine.js, src/actions/AddMaskShape.js, src/actions/AlignTo.js, src/actions/Angle.js, src/actions/Call.js (+3130 more).
R10 · Code Duplication · Duplication concentrated across 25 sibling directories (160 clone groups) · ×1
  • Duplication concentrated across 25 sibling directories (160 clone groups) src/gameobjects/container/Container.js:588 — 160 duplicated blocks under src/ have copies in at least two of the sibling directories animations, cache, cameras, core, curves, data (+19 more sibling(s) not listed) — 81 of them are reported below, and 79 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 160 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 160 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 160 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 · Duplication concentrated across 29 sibling directories (58 clone groups) · ×1
  • Duplication concentrated across 29 sibling directories (58 clone groups) src/gameobjects/image/Image.js:50 — 58 duplicated blocks under src/gameobjects/ have copies in at least two of the sibling directories bitmaptext, blitter, captureframe, components, container, customcontext (+23 more sibling(s) not listed) — 40 of them are reported below, and 18 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 58 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 58 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 58 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 · Duplication concentrated across 11 sibling directories (19 clone groups) · ×1
  • Duplication concentrated across 11 sibling directories (19 clone groups) src/gameobjects/shape/curve/CurveCanvasRenderer.js:25 — 19 duplicated blocks under src/gameobjects/shape/ have copies in at least two of the sibling directories arc, curve, ellipse, grid, isobox, isotriangle (+5 more sibling(s) not listed) — 15 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 19 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 19 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 19 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 · Duplication concentrated across 6 sibling directories (19 clone groups) · ×1
  • Duplication concentrated across 6 sibling directories (19 clone groups) src/geom/ellipse/Ellipse.js:37 — 19 duplicated blocks under src/geom/ have copies in at least two of the sibling directories circle, ellipse, intersects, line, rectangle, triangle — 13 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 19 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 19 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 19 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 · Duplication concentrated across 2 sibling directories (8 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (8 clone groups) src/physics/arcade/ArcadePhysics.js:99 — 8 duplicated blocks under src/physics/ have copies in at least two of the sibling directories arcade, matter-js — 5 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 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 8 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 · Duplication concentrated across 2 sibling directories (6 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (6 clone groups) src/display/align/in/BottomCenter.js:27 — 6 of the duplicated blocks reported below have copies in at least two of the sibling directories in, to under src/display/align/. 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 · Duplication concentrated across 2 sibling directories (5 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (5 clone groups) src/renderer/canvas/CanvasRenderer.js:787 — 5 duplicated blocks under src/renderer/ have copies in at least two of the sibling directories canvas, webgl — 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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 · Duplication concentrated across 3 sibling directories (5 clone groups) · ×1
  • Duplication concentrated across 3 sibling directories (5 clone groups) src/renderer/webgl/renderNodes/filters/BaseFilterShader.js:269 — 5 duplicated blocks under src/renderer/webgl/renderNodes/ have copies in at least two of the sibling directories filters, submitter, transformer — 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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 (219 lines × 2 locations) · ×1
  • Duplicated block (219 lines × 2 locations) src/physics/arcade/ProcessX.js:8 — src/physics/arcade/ProcessX.js:8 · src/physics/arcade/ProcessY.js:8 — 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 (184 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (184 matched lines × 2 locations) src/gameobjects/container/Container.js:588 — src/gameobjects/container/Container.js:588 · src/structs/List.js:152 — the two spans are one implementation copied and then locally edited — 888 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 (146 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (146 matched lines × 2 locations) src/input/mouse/MouseManager.js:30 — src/input/mouse/MouseManager.js:30 · src/input/touch/TouchManager.js:30 — the two spans are one implementation copied and then locally edited — 813 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 (134 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (134 matched lines × 2 locations) src/renderer/webgl/renderNodes/DynamicTextureHandler.js:114 — src/renderer/webgl/renderNodes/DynamicTextureHandler.js:114 · src/textures/DynamicTexture.js:355 — the two spans are one implementation copied and then locally edited — 770 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 (128 lines × 2 locations) · ×1
  • Duplicated block (128 lines × 2 locations) src/cameras/2d/effects/Flash.js:34 — src/cameras/2d/effects/Flash.js:34 · src/cameras/2d/effects/RotateTo.js:43 — 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 · Wholesale file copy (120 identical lines × 3 files) · ×1
  • Wholesale file copy (120 identical lines × 3 files) src/gameobjects/noise/noisecell2d/NoiseCell2D.js:7 — src/gameobjects/noise/noisecell2d/NoiseCell2D.js:7 · src/gameobjects/noise/noisecell3d/NoiseCell3D.js:7 · src/gameobjects/noise/noisecell4d/NoiseCell4D.js:7 — these 3 files are line-for-line copies of one another — 120 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Wholesale file copy (109 identical lines × 2 files) · ×1
  • Wholesale file copy (109 identical lines × 2 files) src/gameobjects/noise/noisesimplex2d/NoiseSimplex2D.js:7 — src/gameobjects/noise/noisesimplex2d/NoiseSimplex2D.js:7 · src/gameobjects/noise/noisesimplex3d/NoiseSimplex3D.js:7 — these 2 files are line-for-line copies of one another — 109 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (93 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (93 matched lines × 2 locations) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:364 — src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:364 · src/renderer/webgl/renderNodes/submitter/SubmitterTilemapGPULayer.js:245 — the two spans are one implementation copied and then locally edited — 403 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 (72 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (72 matched lines × 2 locations) src/gameobjects/components/TransformMatrix.js:653 — src/gameobjects/components/TransformMatrix.js:653 · src/math/Matrix3.js:136 — the two spans are one implementation copied and then locally edited — 411 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 (70 lines × 3 locations) · ×1
  • Duplicated block (70 lines × 3 locations) src/loader/filetypes/AtlasJSONFile.js:38 — src/loader/filetypes/AtlasJSONFile.js:38 · src/loader/filetypes/AtlasXMLFile.js:38 · src/loader/filetypes/UnityAtlasFile.js:36 — 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.
R10 · Code Duplication · Duplicated block with local edits (68 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (68 matched lines × 2 locations) src/cameras/2d/effects/Fade.js:80 — src/cameras/2d/effects/Fade.js:80 · src/cameras/2d/effects/Flash.js:66 — the two spans are one implementation copied and then locally edited — 449 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 (62 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (62 matched lines × 2 locations) src/cameras/controls/FixedKeyControl.js:188 — src/cameras/controls/FixedKeyControl.js:188 · src/cameras/controls/SmoothedKeyControl.js:278 — the two spans are one implementation copied and then locally edited — 297 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 (60 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (60 matched lines × 2 locations) src/math/Vector2.js:406 — src/math/Vector2.js:406 · src/math/Vector3.js:506 — the two spans are one implementation copied and then locally edited — 366 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 (58 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (58 matched lines × 2 locations) src/cameras/2d/effects/RotateTo.js:209 — src/cameras/2d/effects/RotateTo.js:209 · src/cameras/2d/effects/Zoom.js:174 — the two spans are one implementation copied and then locally edited — 327 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 (58 lines × 2 locations) · ×1
  • Duplicated block (58 lines × 2 locations) src/physics/arcade/tilemap/TileCheckX.js:27 — src/physics/arcade/tilemap/TileCheckX.js:27 · src/physics/arcade/tilemap/TileCheckY.js:27 — 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 (57 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (57 matched lines × 2 locations) src/renderer/webgl/renderNodes/transformer/TransformerTile.js:32 — src/renderer/webgl/renderNodes/transformer/TransformerTile.js:32 · src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.js:37 — the two spans are one implementation copied and then locally edited — 353 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 (56 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (56 matched lines × 2 locations) src/cameras/2d/effects/Pan.js:214 — src/cameras/2d/effects/Pan.js:214 · src/cameras/2d/effects/RotateTo.js:247 — the two spans are one implementation copied and then locally edited — 287 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 (55 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (55 matched lines × 2 locations) src/geom/rectangle/Rectangle.js:42 — src/geom/rectangle/Rectangle.js:42 · src/geom/triangle/Triangle.js:46 — the two spans are one implementation copied and then locally edited — 365 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 (54 lines × 2 locations) · ×1
  • Duplicated block (54 lines × 2 locations) src/gameobjects/shape/ellipse/EllipseCanvasRenderer.js:25 — src/gameobjects/shape/ellipse/EllipseCanvasRenderer.js:25 · src/gameobjects/shape/star/StarCanvasRenderer.js:25 — 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 with local edits (53 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (53 matched lines × 2 locations) src/curves/CubicBezierCurve.js:44 — src/curves/CubicBezierCurve.js:44 · src/curves/QuadraticBezierCurve.js:34 — the two spans are one implementation copied and then locally edited — 404 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 (52 lines × 2 locations) · ×1
  • Duplicated block (52 lines × 2 locations) src/gameobjects/shape/grid/GridCanvasRenderer.js:36 — src/gameobjects/shape/grid/GridCanvasRenderer.js:36 · src/gameobjects/shape/grid/GridWebGLRenderer.js: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.
R10 · Code Duplication · Duplicated block (50 lines × 2 locations) · ×1
  • Duplicated block (50 lines × 2 locations) src/geom/triangle/Triangle.js:289 — src/geom/triangle/Triangle.js:289 · src/geom/triangle/Triangle.js:365 — 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.
R10 · Code Duplication · Duplicated block with local edits (50 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (50 matched lines × 2 locations) src/tweens/builders/NumberTweenBuilder.js:38 — src/tweens/builders/NumberTweenBuilder.js:38 · src/tweens/builders/TweenBuilder.js:50 — the two spans are one implementation copied and then locally edited — 372 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 (48 lines × 2 locations) · ×1
  • Duplicated block (48 lines × 2 locations) src/gameobjects/particles/ParticleEmitter.js:1319 — src/gameobjects/particles/ParticleEmitter.js:1319 · src/gameobjects/particles/ParticleEmitter.js:1427 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R2 · Cyclomatic Complexity · Complex function separateCircle (cyclomatic 45, cognitive 54) · ×1
  • Complex function separateCircle (cyclomatic 45, cognitive 54) src/physics/arcade/World.js:1469 — separateCircle has cyclomatic complexity 45 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 psrdnoise3d (cyclomatic 43, cognitive 72) · ×1
  • Complex function psrdnoise3d (cyclomatic 43, cognitive 72) src/math/HashSimplex.js:453 — psrdnoise3d has cyclomatic complexity 43 and cognitive complexity 72; 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 GraphicsWebGLRenderer (cyclomatic 40, cognitive 40) · ×1
  • Complex function GraphicsWebGLRenderer (cyclomatic 40, cognitive 40) src/gameobjects/graphics/GraphicsWebGLRenderer.js:63 — GraphicsWebGLRenderer has cyclomatic complexity 40 and cognitive complexity 40; 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 IsometricCullTiles (cyclomatic 39, cognitive 66) · ×1
  • Complex function IsometricCullTiles (cyclomatic 39, cognitive 66) src/tilemaps/components/IsometricCullTiles.js:22 — IsometricCullTiles has cyclomatic complexity 39 and cognitive complexity 66; 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 GetBitmapTextSize (cyclomatic 38, cognitive 82) · ×1
  • Complex function GetBitmapTextSize (cyclomatic 38, cognitive 82) src/gameobjects/bitmaptext/GetBitmapTextSize.js:28 — GetBitmapTextSize has cyclomatic complexity 38 and cognitive complexity 82; 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 37, cognitive 82) · ×1
  • Complex function update (cyclomatic 37, cognitive 82) src/time/Timeline.js:288 — update has cyclomatic complexity 37 and cognitive complexity 82; 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 init (cyclomatic 36, cognitive 24) · ×1
  • Complex function init (cyclomatic 36, cognitive 24) src/device/Features.js:81 — init has cyclomatic complexity 36 and cognitive complexity 24; 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 GridWebGLRenderer (cyclomatic 35, cognitive 76) · ×1
  • Complex function GridWebGLRenderer (cyclomatic 35, cognitive 76) src/gameobjects/shape/grid/GridWebGLRenderer.js:24 — GridWebGLRenderer has cyclomatic complexity 35 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 init (cyclomatic 35, cognitive 35) · ×1
  • Complex function init (cyclomatic 35, cognitive 35) src/device/OS.js:62 — init has cyclomatic complexity 35 and cognitive complexity 35; 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 run (cyclomatic 34, cognitive 52) · ×1
  • Complex function run (cyclomatic 34, cognitive 52) src/renderer/webgl/renderNodes/Camera.js:120 — run has cyclomatic complexity 34 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 GridCanvasRenderer (cyclomatic 33, cognitive 98) · ×1
  • Complex function GridCanvasRenderer (cyclomatic 33, cognitive 98) src/gameobjects/shape/grid/GridCanvasRenderer.js:25 — GridCanvasRenderer has cyclomatic complexity 33 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 RunCull (cyclomatic 33, cognitive 48) · ×1
  • Complex function RunCull (cyclomatic 33, cognitive 48) src/tilemaps/components/RunCull.js:20 — RunCull has cyclomatic complexity 33 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 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 addMember (cyclomatic 33, cognitive 47) · ×1
  • Complex function addMember (cyclomatic 33, cognitive 47) src/gameobjects/spritegpulayer/SpriteGPULayer.js:793 — addMember has cyclomatic complexity 33 and cognitive complexity 47; 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 32, cognitive 41) · ×1
  • Complex function update (cyclomatic 32, cognitive 41) src/cameras/controls/SmoothedKeyControl.js:347 — update has cyclomatic complexity 32 and cognitive complexity 41; 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 ParseTilesets (cyclomatic 31, cognitive 107) · ×1
  • Complex function ParseTilesets (cyclomatic 31, cognitive 107) src/tilemaps/parsers/tiled/ParseTilesets.js:26 — ParseTilesets has cyclomatic complexity 31 and cognitive complexity 107; 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 ParseTileLayers (cyclomatic 31, cognitive 95) · ×1
  • Complex function ParseTileLayers (cyclomatic 31, cognitive 95) src/tilemaps/parsers/tiled/ParseTileLayers.js:44 — ParseTileLayers has cyclomatic complexity 31 and cognitive complexity 95; 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 updateText (cyclomatic 31, cognitive 56) · ×1
  • Complex function updateText (cyclomatic 31, cognitive 56) src/gameobjects/text/Text.js:1269 — updateText has cyclomatic complexity 31 and cognitive complexity 56; 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 GraphicsCanvasRenderer (cyclomatic 31, cognitive 22) · ×1
  • Complex function GraphicsCanvasRenderer (cyclomatic 31, cognitive 22) src/gameobjects/graphics/GraphicsCanvasRenderer.js:26 — GraphicsCanvasRenderer has cyclomatic complexity 31 and cognitive complexity 22; 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 removePack (cyclomatic 30, cognitive 76) · ×1
  • Complex function removePack (cyclomatic 30, cognitive 76) src/loader/LoaderPlugin.js:712 — removePack has cyclomatic complexity 30 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 processOverOutEvents (cyclomatic 30, cognitive 54) · ×1
  • Complex function processOverOutEvents (cyclomatic 30, cognitive 54) src/input/InputPlugin.js:1841 — processOverOutEvents has cyclomatic complexity 30 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 createFromObjects (cyclomatic 30, cognitive 50) · ×1
  • Complex function createFromObjects (cyclomatic 30, cognitive 50) src/tilemaps/Tilemap.js:803 — createFromObjects has cyclomatic complexity 30 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 renderBody (cyclomatic 28, cognitive 50) · ×1
  • Complex function renderBody (cyclomatic 28, cognitive 50) src/physics/matter-js/World.js:1954 — renderBody has cyclomatic complexity 28 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 separate (cyclomatic 28, cognitive 34) · ×1
  • Complex function separate (cyclomatic 28, cognitive 34) src/physics/arcade/World.js:1354 — separate has cyclomatic complexity 28 and cognitive complexity 34; 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 PCTDecode (cyclomatic 27, cognitive 57) · ×1
  • Complex function PCTDecode (cyclomatic 27, cognitive 57) src/textures/parsers/PCTDecode.js:154 — PCTDecode has cyclomatic complexity 27 and cognitive complexity 57; 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 GetValueOp (cyclomatic 27, cognitive 49) · ×1
  • Complex function GetValueOp (cyclomatic 27, cognitive 49) src/tweens/builders/GetValueOp.js:70 — GetValueOp has cyclomatic complexity 27 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 AddEffectShine (cyclomatic 26, cognitive 31) · ×1
  • Complex function AddEffectShine (cyclomatic 26, cognitive 31) src/actions/AddEffectShine.js:86 — AddEffectShine has cyclomatic complexity 26 and cognitive complexity 31; 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 run (cyclomatic 25, cognitive 40) · ×1
  • Complex function run (cyclomatic 25, cognitive 40) src/renderer/webgl/renderNodes/DynamicTextureHandler.js:68 — run has cyclomatic complexity 25 and cognitive complexity 40; 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 CreateRenderer (cyclomatic 25, cognitive 35) · ×1
  • Complex function CreateRenderer (cyclomatic 25, cognitive 35) src/core/CreateRenderer.js:30 — CreateRenderer has cyclomatic complexity 25 and cognitive complexity 35; 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 _renderCanvas (cyclomatic 25, cognitive 34) · ×1
  • Complex function _renderCanvas (cyclomatic 25, cognitive 34) src/textures/DynamicTexture.js:339 — _renderCanvas has cyclomatic complexity 25 and cognitive complexity 34; 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 _completeLayout (cyclomatic 25, cognitive 28) · ×1
  • Complex function _completeLayout (cyclomatic 25, cognitive 28) src/renderer/webgl/renderNodes/submitter/SubmitterSpriteGPULayer.js:296 — _completeLayout has cyclomatic complexity 25 and cognitive complexity 28; 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 _copyAndCompleteConfig (cyclomatic 25, cognitive 26) · ×1
  • Complex function _copyAndCompleteConfig (cyclomatic 25, cognitive 26) src/renderer/webgl/renderNodes/BatchHandler.js:287 — _copyAndCompleteConfig has cyclomatic complexity 25 and cognitive complexity 26; 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 LineToRectangle (cyclomatic 25, cognitive 24) · ×1
  • Complex function LineToRectangle (cyclomatic 25, cognitive 24) src/geom/intersects/LineToRectangle.js:26 — LineToRectangle has cyclomatic complexity 25 and cognitive complexity 24; 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 ParseGID (cyclomatic 25, cognitive 16) · ×1
  • Complex function ParseGID (cyclomatic 25, cognitive 16) src/tilemaps/parsers/tiled/ParseGID.js:31 — ParseGID has cyclomatic complexity 25 and cognitive complexity 16; 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 HashSimplex (cyclomatic 24, cognitive 26) · ×1
  • Complex function HashSimplex (cyclomatic 24, cognitive 26) src/math/HashSimplex.js:74 — HashSimplex has cyclomatic complexity 24 and cognitive complexity 26; 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 _setAnimatedValue (cyclomatic 23, cognitive 35) · ×1
  • Complex function _setAnimatedValue (cyclomatic 23, cognitive 35) src/gameobjects/spritegpulayer/SpriteGPULayer.js:1426 — _setAnimatedValue has cyclomatic complexity 23 and cognitive complexity 35; 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 collideSpriteVsGroup (cyclomatic 23, cognitive 34) · ×1
  • Complex function collideSpriteVsGroup (cyclomatic 23, cognitive 34) src/physics/arcade/World.js:2048 — collideSpriteVsGroup has cyclomatic complexity 23 and cognitive complexity 34; 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 batchSprite (cyclomatic 23, cognitive 32) · ×1
  • Complex function batchSprite (cyclomatic 23, cognitive 32) src/renderer/canvas/CanvasRenderer.js:713 — batchSprite has cyclomatic complexity 23 and cognitive complexity 32; 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 setConstraintRenderStyle (cyclomatic 23, cognitive 23) · ×1
  • Complex function setConstraintRenderStyle (cyclomatic 23, cognitive 23) src/physics/matter-js/World.js:474 — setConstraintRenderStyle has cyclomatic complexity 23 and cognitive complexity 23; 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 · src/gameobjects/particles/ParticleEmitter.js · ×1
  • src/gameobjects/particles/ParticleEmitter.js: 3500 lines of code src/gameobjects/particles/ParticleEmitter.js:1 — src/gameobjects/particles/ParticleEmitter.js has 3500 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 · src/input/InputPlugin.js · ×1
  • src/input/InputPlugin.js: 2929 lines of code src/input/InputPlugin.js:1 — src/input/InputPlugin.js has 2929 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 · src/physics/arcade/Body.js · ×1
  • src/physics/arcade/Body.js: 2459 lines of code src/physics/arcade/Body.js:1 — src/physics/arcade/Body.js has 2459 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 · src/tilemaps/Tilemap.js · ×1
  • src/tilemaps/Tilemap.js: 2411 lines of code src/tilemaps/Tilemap.js:1 — src/tilemaps/Tilemap.js has 2411 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 · src/renderer/webgl/WebGLRenderer.js · ×1
  • src/renderer/webgl/WebGLRenderer.js: 2345 lines of code src/renderer/webgl/WebGLRenderer.js:1 — src/renderer/webgl/WebGLRenderer.js has 2345 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 · src/physics/arcade/World.js · ×1
  • src/physics/arcade/World.js: 2223 lines of code src/physics/arcade/World.js:1 — src/physics/arcade/World.js has 2223 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 · src/gameobjects/video/Video.js · ×1
  • src/gameobjects/video/Video.js: 2095 lines of code src/gameobjects/video/Video.js:1 — src/gameobjects/video/Video.js has 2095 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 · src/physics/matter-js/World.js · ×1
  • src/physics/matter-js/World.js: 1965 lines of code src/physics/matter-js/World.js:1 — src/physics/matter-js/World.js has 1965 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 · src/animations/AnimationState.js · ×1
  • src/animations/AnimationState.js: 1778 lines of code src/animations/AnimationState.js:1 — src/animations/AnimationState.js has 1778 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 · src/cameras/2d/BaseCamera.js · ×1
  • src/cameras/2d/BaseCamera.js: 1771 lines of code src/cameras/2d/BaseCamera.js:1 — src/cameras/2d/BaseCamera.js has 1771 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 · src/scale/ScaleManager.js · ×1
  • src/scale/ScaleManager.js: 1634 lines of code src/scale/ScaleManager.js:1 — src/scale/ScaleManager.js has 1634 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 · src/gameobjects/group/Group.js · ×1
  • src/gameobjects/group/Group.js: 1559 lines of code src/gameobjects/group/Group.js:1 — src/gameobjects/group/Group.js has 1559 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 · src/math/Matrix4.js · ×1
  • src/math/Matrix4.js: 1556 lines of code src/math/Matrix4.js:1 — src/math/Matrix4.js has 1556 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 · src/textures/TextureManager.js · ×1
  • src/textures/TextureManager.js: 1554 lines of code src/textures/TextureManager.js:1 — src/textures/TextureManager.js has 1554 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 · src/scene/SceneManager.js · ×1
  • src/scene/SceneManager.js: 1492 lines of code src/scene/SceneManager.js:1 — src/scene/SceneManager.js has 1492 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 · src/gameobjects/spritegpulayer/SpriteGPULayer.js · ×1
  • src/gameobjects/spritegpulayer/SpriteGPULayer.js: 1466 lines of code src/gameobjects/spritegpulayer/SpriteGPULayer.js:1 — src/gameobjects/spritegpulayer/SpriteGPULayer.js has 1466 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 · src/gameobjects/graphics/Graphics.js · ×1
  • src/gameobjects/graphics/Graphics.js: 1431 lines of code src/gameobjects/graphics/Graphics.js:1 — src/gameobjects/graphics/Graphics.js has 1431 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 · src/gameobjects/text/Text.js · ×1
  • src/gameobjects/text/Text.js: 1406 lines of code src/gameobjects/text/Text.js:1 — src/gameobjects/text/Text.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 · src/gameobjects/container/Container.js · ×1
  • src/gameobjects/container/Container.js: 1327 lines of code src/gameobjects/container/Container.js:1 — src/gameobjects/container/Container.js has 1327 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 · src/textures/DynamicTexture.js · ×1
  • src/textures/DynamicTexture.js: 1182 lines of code src/textures/DynamicTexture.js:1 — src/textures/DynamicTexture.js has 1182 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 · src/physics/matter-js/MatterPhysics.js · ×1
  • src/physics/matter-js/MatterPhysics.js: 1178 lines of code src/physics/matter-js/MatterPhysics.js:1 — src/physics/matter-js/MatterPhysics.js has 1178 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 · src/input/Pointer.js · ×1
  • src/input/Pointer.js: 1169 lines of code src/input/Pointer.js:1 — src/input/Pointer.js has 1169 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 · src/loader/LoaderPlugin.js · ×1
  • src/loader/LoaderPlugin.js: 1127 lines of code src/loader/LoaderPlugin.js:1 — src/loader/LoaderPlugin.js has 1127 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 · src/gameobjects/bitmaptext/static/BitmapText.js · ×1
  • src/gameobjects/bitmaptext/static/BitmapText.js: 1117 lines of code src/gameobjects/bitmaptext/static/BitmapText.js:1 — src/gameobjects/bitmaptext/static/BitmapText.js has 1117 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 · src/tilemaps/TilemapLayerBase.js · ×1
  • src/tilemaps/TilemapLayerBase.js: 1117 lines of code src/tilemaps/TilemapLayerBase.js:1 — src/tilemaps/TilemapLayerBase.js has 1117 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 · src/gameobjects/nineslice/NineSlice.js · ×1
  • src/gameobjects/nineslice/NineSlice.js: 1086 lines of code src/gameobjects/nineslice/NineSlice.js:1 — src/gameobjects/nineslice/NineSlice.js has 1086 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 · src/tweens/TweenManager.js · ×1
  • src/tweens/TweenManager.js: 1036 lines of code src/tweens/TweenManager.js:1 — src/tweens/TweenManager.js has 1036 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 · src/gameobjects/rope/Rope.js · ×1
  • src/gameobjects/rope/Rope.js: 1024 lines of code src/gameobjects/rope/Rope.js:1 — src/gameobjects/rope/Rope.js has 1024 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 · src/sound/webaudio/WebAudioSound.js · ×1
  • src/sound/webaudio/WebAudioSound.js: 995 lines of code src/sound/webaudio/WebAudioSound.js:1 — src/sound/webaudio/WebAudioSound.js has 995 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 · src/scene/ScenePlugin.js · ×1
  • src/scene/ScenePlugin.js: 993 lines of code src/scene/ScenePlugin.js:1 — src/scene/ScenePlugin.js has 993 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 · src/gameobjects/text/TextStyle.js · ×1
  • src/gameobjects/text/TextStyle.js: 969 lines of code src/gameobjects/text/TextStyle.js:1 — src/gameobjects/text/TextStyle.js has 969 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 · src/renderer/webgl/renderNodes/BatchHandlerQuad.js · ×1
  • src/renderer/webgl/renderNodes/BatchHandlerQuad.js: 964 lines of code src/renderer/webgl/renderNodes/BatchHandlerQuad.js:1 — src/renderer/webgl/renderNodes/BatchHandlerQuad.js has 964 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 · src/gameobjects/GameObject.js · ×1
  • src/gameobjects/GameObject.js: 960 lines of code src/gameobjects/GameObject.js:1 — src/gameobjects/GameObject.js has 960 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 · src/math/Vector3.js · ×1
  • src/math/Vector3.js: 959 lines of code src/math/Vector3.js:1 — src/math/Vector3.js has 959 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 · src/physics/arcade/StaticBody.js · ×1
  • src/physics/arcade/StaticBody.js: 954 lines of code src/physics/arcade/StaticBody.js:1 — src/physics/arcade/StaticBody.js has 954 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 · src/gameobjects/components/TransformMatrix.js · ×1
  • src/gameobjects/components/TransformMatrix.js: 951 lines of code src/gameobjects/components/TransformMatrix.js:1 — src/gameobjects/components/TransformMatrix.js has 951 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 · src/animations/AnimationManager.js · ×1
  • src/animations/AnimationManager.js: 945 lines of code src/animations/AnimationManager.js:1 — src/animations/AnimationManager.js has 945 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 · src/input/InputManager.js · ×1
  • src/input/InputManager.js: 935 lines of code src/input/InputManager.js:1 — src/input/InputManager.js has 935 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 · src/renderer/webgl/wrappers/WebGLGlobalWrapper.js · ×1
  • src/renderer/webgl/wrappers/WebGLGlobalWrapper.js: 930 lines of code src/renderer/webgl/wrappers/WebGLGlobalWrapper.js:1 — src/renderer/webgl/wrappers/WebGLGlobalWrapper.js has 930 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 · src/math/Quaternion.js · ×1
  • src/math/Quaternion.js: 919 lines of code src/math/Quaternion.js:1 — src/math/Quaternion.js has 919 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R4 · Test Coverage · This test file cannot be loaded · ×1
  • This test file cannot be loaded tests/geom/intersects/GetTriangleToLine.test.js:2 — tests/geom/intersects/GetTriangleToLine.test.js:2 imports '../../../src/geom/Triangle', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
R6 · Tooling · The declared test suite includes a file that cannot be loaded · ×1
  • The declared test suite includes a file that cannot be loaded tests/geom/intersects/GetTriangleToLine.test.js:2 — This repository declares test tooling, and the ✓ above records that declaration — but tests/geom/intersects/GetTriangleToLine.test.js cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
R7 · Dead Code · Dead file (~121 LoC) · ×1
  • Dead file (~121 LoC) src/phaser-core.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~70 LoC) · ×1
  • Dead file (~70 LoC) src/phaser-no-physics.js — no import path from any entry point (343 application, 4 tooling, 1098 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unused dependency 'source-map' · ×1
  • Unused dependency 'source-map' — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×1
  • Recursive walk over a caller-supplied document has no depth cap src/tweens/builders/GetValueOp.js:264 — `GetValueOp` is exported and takes `propertyValue: object` from its caller, and it calls itself at line 264 (`GetValueOp`) with a piece of `propertyValue` (and at line 292, line 296, line 303) — and nowhere in `GetValueOp` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `GetValueOp` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Minor — 230 finding(s)
D10 · Test Quality · Mock-dominated test · ×116
  • Mock-dominated test: should call ctx.drawImage with correct arguments tests/tilemaps/TilemapLayerCanvasRenderer.test.js:474 — This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should apply tileOffset to texture coordinates tests/tilemaps/TilemapLayerCanvasRenderer.test.js:498 — This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call finishBatch on manager tests/renderer/webgl/renderNodes/Camera.test.js:230 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should not call fillCameraNode when backgroundColor alphaGL is 0 tests/renderer/webgl/renderNodes/Camera.test.js:236 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call fillCameraNode when backgroundColor alphaGL is greater than 0 tests/renderer/webgl/renderNodes/Camera.test.js:243 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call fillCameraNode for flash effect when postRenderWebGL returns true tests/renderer/webgl/renderNodes/Camera.test.js:254 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call fillCameraNode for fade effect when postRenderWebGL returns true tests/renderer/webgl/renderNodes/Camera.test.js:265 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should use a framebuffer when forceFramebuffer is true tests/renderer/webgl/renderNodes/Camera.test.js:276 — This test sets up 3 test doubles (for example `vi.spyOn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should use a framebuffer when camera.forceComposite is true tests/renderer/webgl/renderNodes/Camera.test.js:283 — This test sets up 3 test doubles (for example `vi.spyOn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should use a framebuffer when camera alpha is less than 1 tests/renderer/webgl/renderNodes/Camera.test.js:291 — This test sets up 3 test doubles (for example `vi.spyOn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should not allocate a framebuffer when no framebuffer conditions are met tests/renderer/webgl/renderNodes/Camera.test.js:299 — This test sets up 3 test doubles (for example `vi.spyOn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should batch the framebuffer to parent when useFramebuffers is true tests/renderer/webgl/renderNodes/Camera.test.js:308 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should not batch when not using framebuffers tests/renderer/webgl/renderNodes/Camera.test.js:314 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should multiply camera matrixExternal by provided parentTransformMatrix tests/renderer/webgl/renderNodes/Camera.test.js:320 — This test sets up 4 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call copyWithScrollFactorFrom on calcMatrix tests/renderer/webgl/renderNodes/transformer/TransformerTile.test.js:159 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call applyITRS on spriteMatrix tests/renderer/webgl/renderNodes/transformer/TransformerTile.test.js:171 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call setQuad on calcMatrix tests/renderer/webgl/renderNodes/transformer/TransformerTile.test.js:177 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call multiply on calcMatrix twice when no parentMatrix tests/renderer/webgl/renderNodes/transformer/TransformerTile.test.js:183 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should call multiply on calcMatrix twice when parentMatrix is provided tests/renderer/webgl/renderNodes/transformer/TransformerTile.test.js:190 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should multiply by parentMatrix first when provided tests/renderer/webgl/renderNodes/transformer/TransformerTile.test.js:198 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should sample the correct pixel coordinates tests/renderer/snapshot/CanvasSnapshot.test.js:99 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should use absolute values for negative x and y tests/renderer/snapshot/CanvasSnapshot.test.js:112 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should round fractional coordinates tests/renderer/snapshot/CanvasSnapshot.test.js:125 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should default x and y to 0 when not provided tests/renderer/snapshot/CanvasSnapshot.test.js:138 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should not use CanvasPool in getPixel mode tests/renderer/snapshot/CanvasSnapshot.test.js:213 — This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • + 91 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×46
  • redundant comment src/filters/Mask.js:239 — "Draw the GameObject to the DynamicTexture." repeats the code it sits on: 4 of its 5 words (game, object, dynamic, texture) are already in `this._dynamicTexture.capture(gameObject, { transform: this.viewTransform, camera: camera });`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/gameobjects/bitmaptext/GetBitmapTextSize.js:109 — "Measure the width of the text" repeats the code it sits on: 3 of its 3 words (measure, width, text) are already in `var measureTextWidth = function (text, fontData)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/gameobjects/bitmaptext/GetBitmapTextSize.js:131 — "Split the text into lines" repeats the code it sits on: 3 of its 3 words (split, text, lines) are already in `lines = text.split('\n');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/gameobjects/stencil/Stencil.js:204 — "Add the stencil render step as the first render step." repeats the code it sits on: 4 of its 5 words (add, stencil, render, step) are already in `this.addRenderStep(this.stencilRenderStep, 0);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/gameobjects/text/Text.js:1286 — "Split text into lines" repeats the code it sits on: 3 of its 3 words (split, text, lines) are already in `var lines = outputText.split(this.splitRegExp);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/loader/filetypes/SVGFile.js:110 — "If there's no viewBox attribute, set one" repeats the code it sits on: 4 of its 5 words (view, box, attribute, set) are already in `svgXML.setAttribute('viewBox', '0 0 ' + svgWidth + ' ' + svgHeight);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/physics/matter-js/World.js:1204 — "sort frame delta history" repeats the code it sits on: 4 of its 4 words (sort, frame, delta, history) are already in `var deltaHistorySorted = runner.frameDeltaHistory.slice(0).sort();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/plugins/PluginManager.js:177 — "Any scene plugins to install?" repeats the code it sits on: 3 of its 3 words (scene, plugins, install) are already in `list = config.installScenePlugins;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/canvas/CanvasRenderer.js:833 — "Multiply by the Sprite matrix" repeats the code it sits on: 3 of its 3 words (multiply, sprite, matrix) are already in `camMatrix.multiply(spriteMatrix);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/DrawingContextPool.js:157 — "Extract the DrawingContext from the agePool" repeats the code it sits on: 4 of its 5 words (drawing, context, age, pool) are already in `index = this.agePool.indexOf(drawingContext);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/DrawingContextPool.js:182 — "Resize the DrawingContext" repeats the code it sits on: 3 of its 3 words (resize, drawing, context) are already in `drawingContext.resize(width, height);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/DrawingContextPool.js:213 — "Resize the DrawingContext" repeats the code it sits on: 3 of its 3 words (resize, drawing, context) are already in `drawingContext.resize(width, height);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/Utils.js:323 — "Self-shadowing uniforms." repeats the code it sits on: 3 of its 3 words (self, shadowing, uniforms) are already in `programManager.setUniform(`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/WebGLRenderer.js:821 — "Set up render nodes." repeats the code it sits on: 3 of its 3 words (set, render, nodes) are already in `this.renderNodes = new RenderNodeManager(this);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/WebGLRenderer.js:832 — "Set up drawing contexts." repeats the code it sits on: 3 of its 3 words (set, drawing, contexts) are already in `this.baseDrawingContext = new DrawingContext(this,`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandler.js:318 — "Set up vertex buffer layout." repeats the code it sits on: 4 of its 4 words (set, vertex, buffer, layout) are already in `var layoutSource = config.vertexBufferLayout || defaultConfig.vertexBufferLayout;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerPointLight.js:301 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerQuad.js:787 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerQuad.js:938 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerStrip.js:279 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerStrip.js:294 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerTileSprite.js:354 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/BatchHandlerTri.js:222 — "Increment the instance count." repeats the code it sits on: 3 of its 3 words (increment, instance, count) are already in `this.instanceCount++;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/Camera.js:225 — "Set up render options." repeats the code it sits on: 3 of its 3 words (set, render, options) are already in `var renderOptions = {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/renderer/webgl/renderNodes/Camera.js:365 — "Draw external filters." repeats the code it sits on: 3 of its 3 words (draw, external, filters) are already in `if (drawExternalFilters)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • + 21 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×40
  • Duplicated predicate src/geom/intersects/GetLineToPoints.js:62 — `!closestIntersect || tempIntersect.z < out.z` appears character-identically in 2 files — src/geom/intersects/GetLineToPoints.js, src/geom/intersects/GetLineToPolygon.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 src/input/mouse/MouseManager.js:369 — `!event.defaultPrevented && _this.enabled && manager && manager.enabled` appears character-identically in 2 files — src/input/mouse/MouseManager.js, src/input/touch/TouchManager.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 src/input/mouse/MouseManager.js:405 — `!event.defaultPrevented && _this.enabled && manager && manager.enabled && event.target !== canvas` appears character-identically in 2 files — src/input/mouse/MouseManager.js, src/input/touch/TouchManager.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 src/physics/arcade/Body.js:1436 — `!gameObject || !gameObject.hasTransformComponent` appears character-identically in 2 files — src/physics/arcade/Body.js, src/physics/arcade/StaticBody.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 src/utils/array/GetAll.js:44 — `!property || (property && value === undefined && child.hasOwnProperty(property)) || (property && value !== undefined && child[property] === …` appears character-identically in 2 files — src/utils/array/GetAll.js, src/utils/array/GetFirst.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 src/gameobjects/components/Texture.js:118 — `!this.frame.cutWidth || !this.frame.cutHeight` appears character-identically in 2 files — src/gameobjects/components/Texture.js, src/gameobjects/components/TextureCrop.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 src/tilemaps/components/IsometricCullTiles.js:55 — `!tile || tile.index === -1 || !tile.visible || tile.alpha === 0` appears character-identically in 2 files — src/tilemaps/components/IsometricCullTiles.js, src/tilemaps/components/RunCull.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 src/physics/matter-js/MatterGameObject.js:23 — `(!!def.get && typeof def.get === 'function') || (!!def.set && typeof def.set === 'function')` appears character-identically in 2 files — src/physics/matter-js/MatterGameObject.js, src/utils/Class.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 src/physics/arcade/SeparateX.js:39 — `(overlap !== 0) || (body1.embedded && body2.embedded)` appears character-identically in 2 files — src/physics/arcade/SeparateX.js, src/physics/arcade/SeparateY.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 src/physics/arcade/PhysicsGroup.js:74 — `Array.isArray(children) && IsPlainObject(children[0])` appears character-identically in 2 files — src/physics/arcade/PhysicsGroup.js, src/physics/arcade/StaticPhysicsGroup.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 src/gameobjects/shape/isobox/IsoBoxCanvasRenderer.js:30 — `SetTransform(renderer, ctx, src, camera, parentMatrix) && src.isFilled` appears character-identically in 2 files — src/gameobjects/shape/isobox/IsoBoxCanvasRenderer.js, src/gameobjects/shape/isotriangle/IsoTriangleCanvasRenderer.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 src/gameobjects/particles/ParticleEmitterCanvasRenderer.js:81 — `alpha <= 0 || particle.scaleX === 0 || particle.scaleY === 0` appears character-identically in 2 files — src/gameobjects/particles/ParticleEmitterCanvasRenderer.js, src/gameobjects/particles/ParticleEmitterWebGLRenderer.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 REDACTED:285 — `audioConfig.noAudio || (!deviceAudio.webAudio && !deviceAudio.audioData)` appears character-identically in 2 files — REDACTED, src/sound/SoundManagerCreator.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 src/renderer/canvas/CanvasRenderer.js:289 — `baseSize.width !== this.width || baseSize.height !== this.height` appears character-identically in 2 files — src/renderer/canvas/CanvasRenderer.js, src/renderer/webgl/WebGLRenderer.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 src/physics/arcade/GetOverlapX.js:57 — `body1.physicsType === CONST.STATIC_BODY && !overlapOnly` appears character-identically in 2 files — src/physics/arcade/GetOverlapX.js, src/physics/arcade/GetOverlapY.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 src/physics/arcade/GetOverlapX.js:51 — `body2.physicsType === CONST.STATIC_BODY && !overlapOnly` appears character-identically in 2 files — src/physics/arcade/GetOverlapX.js, src/physics/arcade/GetOverlapY.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 src/physics/arcade/Body.js:1514 — `center && gameObject && gameObject.getCenter` appears character-identically in 2 files — src/physics/arcade/Body.js, src/physics/arcade/StaticBody.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 src/renderer/webgl/renderNodes/transformer/TransformerImage.js:182 — `cmm[0] === 1 && cmm[1] === 0 && cmm[2] === 0 && cmm[3] === 1` appears character-identically in 5 files — src/renderer/webgl/renderNodes/transformer/TransformerImage.js, src/renderer/webgl/renderNodes/transformer/TransformerStamp.js, src/renderer/webgl/renderNodes/transformer/TransformerTile.js, src/renderer/webgl/renderNodes/transformer/TransformerTileSprite.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 src/gameobjects/noise/Noise.js:125 — `config.noiseColorStart !== undefined || config.noiseColorEnd !== undefined` appears character-identically in 6 files — src/gameobjects/noise/Noise.js, src/gameobjects/noise/noisecell2d/NoiseCell2D.js, src/gameobjects/noise/noisecell3d/NoiseCell3D.js, src/gameobjects/noise/noisecell4d/NoiseCell4D.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 src/renderer/webgl/renderNodes/texturer/TexturerImage.js:123 — `crop.flipX !== gameObject.flipX || crop.flipY !== gameObject.flipY` appears character-identically in 2 files — src/renderer/webgl/renderNodes/texturer/TexturerImage.js, src/renderer/webgl/renderNodes/texturer/TexturerTileSprite.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 src/tilemaps/parsers/tiled/ParseImageLayers.js:31 — `curGroupState.i < curGroupState.layers.length || groupStack.length > 0` appears character-identically in 3 files — src/tilemaps/parsers/tiled/ParseImageLayers.js, src/tilemaps/parsers/tiled/ParseObjectLayers.js, src/tilemaps/parsers/tiled/ParseTileLayers.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 src/gameobjects/graphics/GraphicsWebGLRenderer.js:294 — `customRenderNodes.FillRect || defaultRenderNodes.FillRect` appears character-identically in 2 files — src/gameobjects/graphics/GraphicsWebGLRenderer.js, src/gameobjects/shape/rectangle/RectangleWebGLRenderer.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 src/gameobjects/graphics/GraphicsWebGLRenderer.js:316 — `customRenderNodes.FillTri || defaultRenderNodes.FillTri` appears character-identically in 2 files — src/gameobjects/graphics/GraphicsWebGLRenderer.js, src/gameobjects/shape/triangle/TriangleWebGLRenderer.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 src/gameobjects/blitter/BlitterWebGLRenderer.js:103 — `customRenderNodes.Submitter || defaultRenderNodes.Submitter` appears character-identically in 12 files — src/gameobjects/blitter/BlitterWebGLRenderer.js, src/gameobjects/graphics/GraphicsWebGLRenderer.js, src/gameobjects/image/ImageWebGLRenderer.js, src/gameobjects/mesh2d/Mesh2DWebGLRenderer.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 src/gameobjects/image/ImageWebGLRenderer.js:33 — `customRenderNodes.Texturer || defaultRenderNodes.Texturer` appears character-identically in 5 files — src/gameobjects/image/ImageWebGLRenderer.js, src/gameobjects/sprite/SpriteWebGLRenderer.js, src/gameobjects/text/TextWebGLRenderer.js, src/gameobjects/tilesprite/TileSpriteWebGLRenderer.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.
  • + 15 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned file · ×15
  • Orphaned file src/tilemaps/parsers/tiled/ParseTileLayers.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/physics/arcade/tilemap/SeparateTile.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/gameobjects/text/MeasureText.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/parsers/tiled/ParseGID.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/ParseToTilemap.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/geom/intersects/GetCircleToCircle.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/parsers/tiled/ParseImageLayers.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/parsers/Parse.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/parsers/Parse2DArray.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/parsers/tiled/ParseObject.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/components/CalculateFacesWithin.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/components/SetCollisionByProperty.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/geom/intersects/GetLineToCircle.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/parsers/impact/ParseTileLayers.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/tilemaps/components/FindByIndex.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
D12 · Dependency Hygiene · Deprecated · ×3
  • Deprecated: glob REDACTED:2386 — glob 7.2.3 is resolved in REDACTED and is marked deprecated by its publisher: "Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting i@izs.me". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: inflight REDACTED:2600 — inflight 1.0.6 is resolved in REDACTED and is marked deprecated by its publisher: "This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: rimraf REDACTED:4135 — rimraf 2.7.1 is resolved in REDACTED and is marked deprecated by its publisher: "Rimraf versions prior to v4 are no longer supported". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
D16 · Bus Factor · Off-boarding risk · ×2
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 66 significant file(s) lose their only recent owner: src/input/Pointer.js, src/input/keyboard/KeyboardPlugin.js, src/structs/Size.js, src/sound/html5/HTML5AudioSound.js, src/core/Game.js, src/sound/BaseSoundManager.js, src/loader/filetypes/CompressedTextureFile.js, src/textures/CanvasTexture.js (+58 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 27 significant file(s) lose their only recent owner: src/gameobjects/spritegpulayer/SpriteGPULayer.js, src/renderer/webgl/renderNodes/BatchHandlerQuad.js, src/gameobjects/mesh2d/Mesh2D.js, src/gameobjects/components/Filters.js, src/renderer/webgl/DrawingContext.js, src/gameobjects/shader/Shader.js, src/math/HashSimplex.js, src/renderer/webgl/renderNodes/RenderNodeManager.js (+19 more). Pair on, review, or document these before any departure.
IC1 · Incompleteness & stubs · Blanket warning suppression · ×2
  • Blanket warning suppression src/input/mouse/index.js:11 — A bare `eslint-disable` or `@ts-nocheck` with no rule list switches every lint rule or the whole type checker off for the rest of the file — hidden debt. Disable the specific rule on the specific line, with a justification, instead.
  • Blanket warning suppression src/input/touch/index.js:11 — A bare `eslint-disable` or `@ts-nocheck` with no rule list switches every lint rule or the whole type checker off for the rest of the file — hidden debt. Disable the specific rule on the specific line, with a justification, instead.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (94 single-owned of 585 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 585 of the 2058 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/gameobjects/components/Size.js.
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 15 of 585 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 585 of the 2058 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: src/tilemaps/parsers/tiled/ParseTileLayers.js, src/physics/arcade/tilemap/SeparateTile.js, src/gameobjects/text/MeasureText.js, src/tilemaps/parsers/tiled/ParseGID.js, src/tilemaps/ParseToTilemap.js, src/geom/intersects/GetCircleToCircle.js, src/tilemaps/parsers/tiled/ParseImageLayers.js, src/tilemaps/parsers/Parse.js (and 7 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security 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 package.json:59 — `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
Minor — 5 finding(s)
D10 · Test Quality · Skipped (documented) · ×4
  • Skipped (documented): should accept a Phaser.Textures.Texture instance as the second argument tests/filters/CombineColorMatrix.test.js:90 — Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
  • Skipped (documented): should update glTexture when called with a Phaser.Textures.Texture instance tests/filters/CombineColorMatrix.test.js:145 — Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
  • Skipped (documented): should use glTexture directly when given a Phaser.Textures.Texture instance tests/filters/ImageLight.test.js:154 — Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
  • Skipped (documented): should use glTexture directly when given a Phaser.Textures.Texture instance as normal map tests/filters/ImageLight.test.js:195 — Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
D24 · Comment Value · doc comments repeat the names · ×1
  • doc comments repeat the names src/display/ColorRamp.js:37 — 201 of 8823 documented parameters and 30 of 5059 summaries in `phaser` only repeat the member or parameter name (e.g. "The current scene." for `scene`). Delete the restating tags, or add what the name does not say.

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-0fe47f7cfdd74baea4f21b77eb3fc28d/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-0fe47f7cfdd74baea4f21b77eb3fc28d/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude config --exclude scripts/tsgen/jsdoc-plugins --exclude scripts/tsgen/src --exclude scripts/tsgen/test/src --exclude src/physics/matter-js/lib --exclude src/physics/matter-js/poly-decomp --exclude src/polyfills --exclude src/renderer/webgl/shaders/additionMakers .11artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .18artifacts/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 01a1d623-1c2a-763d-a7fa-69fa66c0c8ff · 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