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

clientIO/joint

Measured 17 November 2026, 05:24 UTC, at code version 968356f

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

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

A large codebase: 134,023 lines of product code in 14 projects, tests not counted · Estimated rebuild effort: about 1.4 person-years · Weakest lens: Accessibility, 47.0

Findings by how serious they are

45 critical 472 serious 147 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 05:24 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 ▸

72of 72 dimensions measured by tools.
633of 664 findings point to an exact file and line, so you can open each one in the code. The other 31 concern the repository as a whole, such as missing documentation.
72dimensions across 7 lenses, read from 134,023 lines of product code in 14 projects.
Chapters

Executive summary

clientIO/joint falls short of our standard for production, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 52.7 out of 100 and is rated Adequate, and 39 of its 45 critical findings are security problems in the build pipeline and in its code.

Accessibility, at 47.0, is the weakest lens and counts most in the score. The best first step is adding text alternatives, worth about 4.8 points. Fixing focus, motion and contrast comes next, worth about 3.7 points. Raising Accessibility to 70 would lift the score to about 57.4.

Thirty-three pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Five secrets can leak from the build pipeline, and two parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, limiting each secret to its own step and having someone learn the forgotten files would close these risks. Fixing the weaknesses the scanner points to would fix the security weakness in the code. The two loops of files that import each other need breaking.

The product code is 134,023 lines, about €200,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.
Accessibility 47.0 · counts for 46%Security and Compliance 53.9 · counts for 25%Code Health 55.1 · counts for 14%Production Readiness 56.5 · counts for 8%Performance 70.7 · counts for 4%Maturity 75.2 · counts for 2%Architecture 86.1 · counts for 1%

If Accessibility rose from 47.0 to 70, the lowest score rated Strong, the score would rise from 52.7 to about 57.4.

Code composition: what the lines of code are
Product code 64%Tests 36%
Rebuild cost: about €200,000 · Estimate
Cost to rebuild€67,000 to €340,000, for 1,114 to 3,536 hours of work, about 1.4 person-years for 1 to 3 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.7 at a score of 53. 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: 134,023 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
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 4.8 points · Medium effort · Text alternatives
2
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Raises the score by about 3.7 points · Medium effort · Visual & motion safety
3
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Raises the score by about 3.3 points · Medium effort · Forms & labels

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 €200,000 to build again, about 1.4 person-years of work. Its weakest lens is Accessibility, at 47.0 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video. Of all the actions in this report, it raises the score most for the work it takes: about 4.8 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.4 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 7% to 15% on every change. The history of the code shows how much it changes: about 38,643 lines over the last 90 days, which is about 156,719 lines a year. At that pace, the extra work comes to an estimated 25.6 to 153.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

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

arch @joint/cli cli @joint/core core @joint/decorators decorators @joint/decorators->@joint/core @joint/eslint-config eslint-config @joint/layout-directed-graph layout-directed-graph @joint/layout-directed-graph->@joint/core @joint/layout-elk layout-elk @joint/layout-elk->@joint/core @joint/layout-msagl layout-msagl @joint/layout-msagl->@joint/core @joint/mock-svg mock-svg @joint/react react @joint/react->@joint/core @joint/router-avoid router-avoid @joint/router-avoid->@joint/core @joint/sanitize sanitize @joint/sanitize->@joint/core @joint/shapes-general shapes-general @joint/shapes-general->@joint/core @joint/shapes-general->@joint/decorators @joint/shapes-general-tools shapes-general-tools @joint/shapes-general-tools->@joint/core @joint/shapes-general-tools->@joint/decorators @joint/shapes-general-tools->@joint/shapes-general @joint/vitest-plugin-mock-svg vitest-plugin-mock-svg @joint/vitest-plugin-mock-svg->@joint/mock-svg

Architecture: which parts of the code depend on which

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

186 modules, with 168 dependencies between them. 2 loops run through 5 of the modules, marked above the diagonal.

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 joint-cli.src.constants2 joint-core.src.mvc3 joint-core.src.mvc.Listener4 joint-decorators.src.decorators5 joint-layout-elk.src.types.elkEnums6 joint-layout-elk.src.types.elkGraph7 joint-layout-msagl.src.types8 joint-react.src.mvc.paper_types9 joint-react.src.presets.can-connect10 joint-react.src.presets.link-labels11 joint-react.src.presets.link-routing12 joint-react.src.presets.link-style13 joint-react.src.presets.link-view14 joint-react.src.state.incremental_types15 joint-react.src.store.state-container16 joint-react.src.types.cell_types17 joint-react.src.types.feature_types18 joint-router-avoid.src.providers.Provider19 joint-cli.src.commands20 joint-cli.src.lib21 joint-layout-elk.src.layout22 joint-layout-msagl.src23 joint-react.src.mvc.paper24 joint-react.src.presets.link-attributes25 joint-react.src.presets.paper-events26 joint-router-avoid.src.RouterService27 joint-router-avoid.src.providers.WorkerProvider28 joint-layout-elk.src29 joint-react.src.components.paper.paper_types30 joint-react.src.presets31 joint-router-avoid.src.providers.Worker32 joint-react.src.store.paper-store33 joint-router-avoid.src.providers34 joint-react.src.store.measurement35 joint-react.src.store.graph-store36 joint-react.src.components.graph.graph-provider37 joint-react.src.hooks.use-create-features38 joint-react.src.store39 joint-react.src.hooks40 joint-react.src.utils
1 joint-cli.src.constants
2 joint-core.src.mvc
3 joint-core.src.mvc.Listener
4 joint-decorators.src.decorators
5 joint-layout-elk.src.types.elkEnums
6 joint-layout-elk.src.types.elkGraph
7 joint-layout-msagl.src.types
8 joint-react.src.mvc.paper_types
9 joint-react.src.presets.can-connect
10 joint-react.src.presets.link-labels
11 joint-react.src.presets.link-routing
12 joint-react.src.presets.link-style
13 joint-react.src.presets.link-view
14 joint-react.src.state.incremental_types
15 joint-react.src.store.state-container
16 joint-react.src.types.cell_types
17 joint-react.src.types.feature_types
18 joint-router-avoid.src.providers.Provider
19 joint-cli.src.commands1
20 joint-cli.src.lib2
21 joint-layout-elk.src.layout1
22 joint-layout-msagl.src1
23 joint-react.src.mvc.paper11
24 joint-react.src.presets.link-attributes11
25 joint-react.src.presets.paper-events11
26 joint-router-avoid.src.RouterService112
27 joint-router-avoid.src.providers.WorkerProvider21
28 joint-layout-elk.src72
29 joint-react.src.components.paper.paper_types1111
30 joint-react.src.presets121412112
31 joint-router-avoid.src.providers.Worker11
32 joint-react.src.store.paper-store1111212
33 joint-router-avoid.src.providers112
34 joint-react.src.store.measurement1
35 joint-react.src.store.graph-store111111
36 joint-react.src.components.graph.graph-provider111
37 joint-react.src.hooks.use-create-features12
38 joint-react.src.store214121
39 joint-react.src.hooks3111122
40 joint-react.src.utils11131
Uses a module listed above itPart of a loopThe module itself
1 joint-cli.src.constants2 joint-core.src.mvc3 joint-core.src.mvc.Listener4 joint-decorators.src.decorators5 joint-layout-elk.src.types.elkEnums6 joint-layout-elk.src.types.elkGraph7 joint-layout-msagl.src.types8 joint-react.src.mvc.paper_types9 joint-react.src.presets.can-connect10 joint-react.src.presets.link-labels11 joint-react.src.presets.link-routing12 joint-react.src.presets.link-style13 joint-react.src.presets.link-view14 joint-react.src.state.incremental_types15 joint-react.src.store.state-container16 joint-react.src.types.cell_types17 joint-react.src.types.feature_types18 joint-router-avoid.src.providers.Provider19 joint-cli.src.commands20 joint-cli.src.lib21 joint-layout-elk.src.layout22 joint-layout-msagl.src23 joint-react.src.mvc.paper24 joint-react.src.presets.link-attributes25 joint-react.src.presets.paper-events26 joint-router-avoid.src.RouterService27 joint-router-avoid.src.providers.WorkerProvider28 joint-layout-elk.src29 joint-react.src.components.paper.paper_types30 joint-react.src.presets31 joint-router-avoid.src.providers.Worker32 joint-react.src.store.paper-store33 joint-router-avoid.src.providers34 joint-react.src.store.measurement35 joint-react.src.store.graph-store36 joint-react.src.components.graph.graph-provider37 joint-react.src.hooks.use-create-features38 joint-react.src.store39 joint-react.src.hooks40 joint-react.src.utilsjoint-cli.src.constants1joint-core.src.mvc2joint-core.src.mvc.Listener3joint-decorators.src.decorators4joint-layout-elk.src.types.elkEnums5joint-layout-elk.src.types.elkGraph6joint-layout-msagl.src.types7joint-react.src.mvc.paper_types8joint-react.src.presets.can-connect9joint-react.src.presets.link-labels10joint-react.src.presets.link-routing11joint-react.src.presets.link-style12joint-react.src.presets.link-view13joint-react.src.state.incremental_types14joint-react.src.store.state-container15joint-react.src.types.cell_types16joint-react.src.types.feature_types17joint-router-avoid.src.providers.Provider18joint-cli.src.commands19joint-cli.src.lib20joint-layout-elk.src.layout21joint-layout-msagl.src22joint-react.src.mvc.paper23joint-react.src.presets.link-attributes24joint-react.src.presets.paper-events25joint-router-avoid.src.RouterService26joint-router-avoid.src.providers.WorkerProvider27joint-layout-elk.src28joint-react.src.components.paper.paper_types29joint-react.src.presets30joint-router-avoid.src.providers.Worker31joint-react.src.store.paper-store32joint-router-avoid.src.providers33joint-react.src.store.measurement34joint-react.src.store.graph-store35joint-react.src.components.graph.graph-provider36joint-react.src.hooks.use-create-features37joint-react.src.store38joint-react.src.hooks39joint-react.src.utils40121111111111221721111121412112111111212112111111111112214121311112211131+146 more modules (most-connected shown)

At a glance — Code Health · 55.1 · Adequate · gated by D2 ·

At a glance — Architecture · 86.1 · Strong ·

At a glance — Maturity · 75.2 · Strong ·

At a glance — Readiness · 56.5 · Adequate · gated by R8 ·

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

At a glance — Accessibility · 47.0 · Weak · gated by AC1 ·

At a glance — Performance · 70.7 · 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
A05:2025 — Injection59High / Critical
A03:2025 — Software Supply Chain Failures12Medium

Roadmap

Top priorities: Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video; Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1; Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.

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

Do thisHelpsEffortDimension
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.+4.8 ptsMediumText alternatives
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.+3.7 ptsMediumVisual & motion safety
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+3.3 ptsMediumForms & labels
Resolve the 20 Deprecated finding(s) in Dependency Hygiene — start with package.json (20).+1.4 ptsMediumDependency Hygiene
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+0.5 ptsLowStatic Analysis (SAST)
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED.+0.5 ptsLowStatic Analysis (SAST)
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.+0.5 ptsLowSupply-chain Provenance & Signing
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.+0.5 ptsLowSupply-chain Provenance & Signing

File quality

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

FileScoreBandWorst signal
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.5MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedDependency Vulnerabilities: Medium CVE: REDACTED
REDACTED6.1MixedStatic Analysis (SAST): Medium: REDACTED
packages/joint-core/src/g/path.mjs6.3MixedCyclomatic Complexity: path.Path (cyclomatic 24)
packages/joint-core/src/dia/Paper.mjs6.3MixedCyclomatic Complexity: updateViewsAsync (cyclomatic 22)
packages/joint-core/src/g/curve.mjs6.3MixedCyclomatic Complexity: closestPointT (cyclomatic 19)
packages/joint-core/src/dia/Graph.mjs6.5MixedCyclomatic Complexity: getConnectedLinks (cyclomatic 53)
packages/joint-core/package.json6.5MixedDependency Hygiene: Deprecated: core-js
packages/joint-sanitize/src/sanitizeGraph.mjs6.7MixedCyclomatic Complexity: sanitizeGraph.sanitizePorts (cyclomatic 24)
packages/joint-core/src/routers/manhattan.mjs6.9MixedCyclomatic Complexity: manhattan.findRoute (cyclomatic 31)
packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx6.9MixedCyclomatic Complexity: code-controlled-mode-peerjs.Main (cyclomatic 22)
packages/joint-core/src/routers/rightAngle.mjs7.0MixedCyclomatic Complexity: rightAngleRouter (cyclomatic 47)
packages/joint-core/src/util/utilHelpers.mjs7.0MixedCyclomatic Complexity: utilHelpers.compareAscending (cyclomatic 32)
packages/joint-core/src/mvc/Dom/Dom.mjs7.0MixedCyclomatic Complexity: Dom.$.event.remove (cyclomatic 35)

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

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

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

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

Could not be resolved — 4

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 72 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 1.0, 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 — 72 dimensions across the health lenses
D1D2D3D5D6D8D10D11D12D13D14D15D16D17D19D20D23D24D26D28D29D30D34D35D36D37D43AC1AC2AC3AC6AX10AX3AX4AX6GD1IC1M1M2M3M4P1P10P2P3P4P6PF1PF3R1R10R11R2R3R4R6R7R8R9X1X12X16X19X2X21X24X25X28X29X3X30X5

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, 633 of 664 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 01a1e7f7-2833-7458-bdf7-df6c3149f8f5.

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

Run transparency — what happened this run

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

  • D8 Code Coverage — 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. 89 test file(s) failed while being loaded here, so none of their cases ran (typically a native addon or generated module the package's install scripts build, which the analyzer's scripts-off install does not run). The 12 production file(s) those files import are unmeasured in this run, not untested, so their figures are left out of the per-file rows and the 93.0% whatever they read, rather than published as low coverage or counted toward the figure. You can widen what we reach: optional: commit the lcov report of a run where those test files load, and their modules are read from it.
  • D11 Test Reliability — 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. Test reliability for the mocha suite in packages/joint-layout-directed-graph/ was NOT MEASURED: the mocha run in packages/joint-layout-directed-graph/ produced no per-test report (Exception during run: Error: Cannot find module 'packages/joint-layout-directed-graph/node_modules/@joint/core/dist/joint.min.js'). This is OUR limitation, not a defect in the repository, and the suite is excluded from the measurement rather than counted against it.
  • D11 Test Reliability — 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. Test reliability for the mocha suite in packages/joint-sanitize/ was NOT MEASURED: the mocha run in packages/joint-sanitize/ produced no per-test report (> @joint/sanitize@4.3.4 test). This is OUR limitation, not a defect in the repository, and the suite is excluded from the measurement rather than counted against it.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `packages/joint-core/types/dia.d.ts`, `packages/joint-layout-directed-graph/rollup.config.mjs`, `packages/joint-layout-elk/rollup.config.mjs`, `packages/joint-layout-msagl/rollup.config.mjs`, `packages/joint-react/jest.config.js`, … (+20 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • D44 Platform End-of-Life — 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 dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • 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.
  • 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. 144 further occurrence(s) are not listed individually; the score already reflects all 184.
  • 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. 100 further occurrence(s) are not listed individually; the score already reflects all 140.
  • 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. 31 further occurrence(s) are not listed individually; the score already reflects all 71.
  • 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. 381 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.
  • 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, Rust, Go, Swift, Erlang, F# and Visual Basic source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP log through no library that carries a message's values as fields (pino, winston, bunyan, tslog, LogTape, roarr; Python's logging, structlog; PHP's PSR-3 loggers), so its log calls cannot be judged, 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: 2 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.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
  • 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.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
  • 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.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity4.4 / 10Weak✓ 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 4.4 / 10 · rule-coverage 100% · ceiling Prevented

121 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was rightAnglePath at 193. A further 4 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 utilHelpers.initCloneByTag at 21 — they are counted neither in the figure above nor in this dimension's score. 2 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: packages/joint-core/src/util/getRectPoint.mjs (getRectPoint at 21), packages/joint-core/src/util/getRectPoint.mjs (getRectPoint.getRectPoint at 21). 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.

(anonymous)::text (cyclomatic 55) · ×9REDACTED:487
rightAnglePath (cyclomatic 193)packages/joint-core/src/alg/rightAnglePath.mjs:583
breakText (cyclomatic 64)REDACTED:551
getConnectedLinks (cyclomatic 53)packages/joint-core/src/dia/Graph.mjs:836
number (cyclomatic 50)REDACTED:1412

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

What to do

  1. Bring the 2 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with rightAnglePath (cyclomatic 193), breakText (cyclomatic 64). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cyclomatic Complexity from 4.4 to about 6.1/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

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

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

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

175 method(s) exceeded the cognitive complexity threshold of 15; the worst was rightAnglePath at 296.

(anonymous)::text (cognitive 110) · ×10REDACTED:487
rightAnglePath (cognitive 296)packages/joint-core/src/alg/rightAnglePath.mjs:583
breakText (cognitive 162)REDACTED:551
resolveDirection (cognitive 80)packages/joint-core/src/routers/rightAngle.mjs:681
manhattan.findRoute (cognitive 76)packages/joint-core/src/routers/manhattan.mjs:560

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

What to do

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

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

D3 · God Classes9.4 / 10Stronggated by 16 serious findings✓ Tool-verified

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

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

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

16 god class(es) detected.

FunctionTooLong: rightAnglePath.rightAnglePath · ×7packages/joint-core/src/alg/rightAnglePath.mjs:583
FileTooLong: dia/Paper.mjs · ×7packages/joint-core/src/dia/Paper.mjs
ClassTooLong: rightAnglePathpackages/joint-core/src/alg/rightAnglePath.mjs:1
TooManyMethods: RouterServicepackages/joint-router-avoid/src/RouterService.mts:189

What to do

  1. Resolve the 7 FunctionTooLong finding(s) in God Classes — start with rightAnglePath.mjs, use-create-portal-paper.tsx, measurement.ts. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 7 FileTooLong finding(s) in God Classes — start with Paper.mjs, utilHelpers.mjs, path.mjs. — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 1 ClassTooLong finding(s) in God Classes — start with rightAnglePath.mjs. — One of this dimension's main actionable groups (1 warning-level).

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

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

14 production modules (npm), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence, with abstractness counted on 10 of the 14 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.8 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

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

1 of 50 classes have LCOM4 above 3.

Low cohesion: PaperView (LCOM4 4)packages/joint-react/src/mvc/paper.ts:23

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with paper.ts. — One of this dimension's main actionable groups (1 warning-level).

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

D8 · Code Coverage10.0 / 10Exemplary✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.

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

Line coverage 93.0%, branch coverage 90.1%. Measured from the JavaScript/TypeScript suite (jest in packages/joint-mock-svg/: not run; jest via `yarn install --immutable --mode=skip-build` in packages/joint-react/, the 3 run(s) test reliability made). Taken over 3 runs of the suite: a line counts as covered only when every run executed it.

✓ On the Gold path — maintain.

Detailed fixes: d8_recommendation.md.

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

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

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

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

3 skipped (3 with a documented reason), 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1132 tests.

Mock-dominated test: needs a replacement, since the mocked one never calls backpackages/joint-mock-svg/test/jest/src/customizations.test.ts:56
Skipped (documented): (unnamed test) · ×3packages/joint-core/test/ts/index.test.ts:314

✓ On the Gold path — maintain.

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

D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests pass reliably, with no flakiness.

Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.

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

0 flaky across 1 measured tier(s). JavaScript/TypeScript (mocha via `yarn install --immutable --mode=skip-build` in packages/joint-layout-directed-graph/; jest via `yarn install --immutable --mode=skip-build` in packages/joint-mock-svg/ (0 tests); jest via `yarn install --immutable --mode=skip-build` in packages/joint-react/ (115 tests); mocha via `yarn install --immutable --mode=skip-build` in packages/joint-sanitize/; vitest via `yarn install --immutable --mode=skip-build` in packages/joint-vitest-plugin-mock-svg/ (0 tests)): measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.md.

D12 · Dependency Hygiene6.2 / 10Adequate✓ 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 6.2 / 10 · rule-coverage 100% · ceiling Verified

17 outdated direct production npm dependency(ies) of 21 graded, 0 pinning defect(s), across 88 package.json (15 of them the product) and 1 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 7 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: eslint · ×20packages/joint-cli/package.json:26
Deprecated: @sinonjs/text-encoding · ×11REDACTED:8761
Outdated (npm): @angular/common · ×17

What to do

  1. Resolve the 20 Deprecated finding(s) in Dependency Hygiene — start with package.json (20). — One of this dimension's main actionable groups (20 warning-level).
  2. Resolve the 11 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (11). — One of this dimension's main actionable groups (11 recommendation-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 135 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 135 package(s) this repository's committed lockfile installs for a consumer — its 22 production, optional and peer dependency(ies), across 15 product package.json manifest(s), and everything those install in turn. Its 447 `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. 1 of them publish no licence this pass can read on registry.npmjs.org — an absent field, `UNLICENSED`, or a `SEE LICENSE IN <file>` pointer into a tarball this pass does not download; that is missing data, not a violation, and none of them is charged. No third-party code was found shipping without a manifest entry (vendored or copied-in directories, licence comments preserved in committed bundles, bundled module paths, compiled wasm modules). This repository publishes itself under MIT / MPL-2.0, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

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

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

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

Top hotspots: packages/joint-core/src/routers/rightAngle.mjs (2×44=88); packages/joint-react/src/store/graph-projection.ts (2×36=72); packages/joint-react/src/hooks/use-create-portal-paper.tsx (2×22=44)

Hotspot: packages/joint-core/src/routers/rightAngle.mjs · ×3packages/joint-core/src/routers/rightAngle.mjs:459

What to do

  1. Resolve the 3 Hotspot finding(s) in Churn × Complexity Hotspots — start with rightAngle.mjs, graph-projection.ts, use-create-portal-paper.tsx. — One of this dimension's main actionable groups (3 warning-level).

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

D16 · Bus Factor8.7 / 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.7 / 10 · rule-coverage 100% · ceiling Documented

26 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is packages/joint-router-avoid/src/RouterService.mts. Counted over 207 of the 442 production source files in this repository: 232 are under the ~2,400-byte size floor this dimension measures over, and the remaining 3 have no attributable history left to measure.

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.

D17 · Explicit Debt10.0 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

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

TodoComment · ×2packages/joint-core/test/ts/index.test.ts:349

What to do

  1. Resolve the 2 TodoComment finding(s) in Explicit Debt — start with index.test.ts, index.ts. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d17_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

2 of 2 documentation facets pass in full. 19 document(s) read across 15 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

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

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

No architecture decision records were found.

No ADRs foundpackages/joint-cli/package.json:7

What to do

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

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

D23 · Boundary Type-Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.

Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.

Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.

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

No domain types leak across context boundaries (74 contexts). Contexts: absolute-port-layout-dynamic-port-sizes-js, activity-diagram-js, anchors-ts, angular-element-view-ts, animated-process-flow-diagram-js, avoid-router-ts, bezier-js, callouts-js, chatgpt-timeline-js, circular-layout-js, connection-points-ts, connector-arrows-js and 62 more.

✓ On the Gold path — maintain.

Detailed fixes: d23_recommendation.md.

D24 · Comment Value9.1 8.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 8.8 / 10 · rule-coverage 97% · ceiling Documented

36 of 3811 judged comments only repeat the code they sit on (0.9 %). 158 comment(s) in another language or script were not judged.

redundant comment · ×32packages/joint-core/src/connectors/straight.mjs:26
doc comments repeat the names · ×5packages/joint-core/src/connectors/jumpover.mjs:131

What to do

  1. Resolve the 32 redundant comment finding(s) in Comment Value — start with HighlighterView.js (3), GraphLayerCollection.mjs (2), Paper.mjs (2). — One of this dimension's main actionable groups (32 recommendation-level).

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

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

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

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

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

2 of 14 build units (npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×2packages/joint-core/package.json:1

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

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

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

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

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

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

59 finding(s): 0 critical, 39 high, 14 medium, 6 low. 33 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 84 file(s) — `examples/genogram-ts/src/theme.ts` (line 33), `packages/joint-core/demo/archive/joint.dia.LegacyLinkView.js`, `packages/joint-core/demo/curves/index.html` (line 16), `REDACTED`, `packages/joint-core/src/dia/Paper.mjs`, … (+79 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D30 · Dependency Vulnerabilities8.7 / 10Strong✓ Tool-verified

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

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

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

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

REDACTED

What to do

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

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

D34 · Knowledge Freshness9.4 / 10Adequategated by 2 critical findings✓ 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.4 / 10 · rule-coverage 100% · ceiling Documented

12 of 210 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is packages/joint-core/src/g/path.mjs. Counted over 210 of the 442 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledge · ×2packages/joint-core/src/g/path.mjs:1
Orphaned file · ×10packages/joint-core/src/g/polyline.mjs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with path.mjs, curve.mjs. — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 10 Orphaned file finding(s) in Knowledge Freshness — start with polyline.mjs, rect.mjs, point.mjs. — One of this dimension's main actionable groups (10 recommendation-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

Strongest change-coupling: ToolsView.mjs↔joint.d.ts 70%; ElementView.mjs↔joint.d.ts 69%; HighlighterView.mjs↔joint.d.ts 58%

Change-coupling hub: joint.d.ts → ElementView.mjs, HighlighterView.mjs, ToolsView.mjspackages/joint-core/types/joint.d.ts

What to do

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

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

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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.

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives1.0 / 10Critical✓ Tool-verified

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

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

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

  • A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×4) — packages/joint-core/src/dia/Paper.mjs:202, packages/joint-core/src/dia/Paper.mjs:229, packages/joint-core/src/dia/Paper.mjs:251, …

What to do

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

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

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

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

  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:475

What to do

  • Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
AC3 · Page structure10.0 / 10Exemplary○ Nothing flagged

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

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

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

AC6 · Visual & motion safety5.4 / 10Adequate✓ Tool-verified

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

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

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

  • This element's Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:435
  • `.node` sets color: #dde6ed on background-color: #ed2637 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — packages/joint-react/stories/examples/index.css:1
  • `button` sets color: white on background-color: #007bff — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — examples/element-tags-and-badges-js/src/styles.scss:31
  • `.toolbar button` sets color: white on background-color: #3b82f6 — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — examples/angular-element-view-ts/src/app/app.component.css:27
  • `.router-switch` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — packages/joint-core/demo/routing/css/routing.css:20
  • `.html-element-field` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — packages/joint-core/demo/html/css/html.css:88
  • `.toolbar-button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. (×4) — packages/joint-core/demo/html/css/html.css:130, examples/layout-elk-dependency-graph-ts/src/styles.scss:28, examples/layout-elk-defaults-ts/src/styles.scss:48, …
  • `.joint-element .highlighted` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — packages/joint-core/demo/archive/logic/css/logic.css:86
  • `.toolbar button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — examples/vue-js/src/styles.css:25
  • `$el.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×4) — packages/joint-core/test/jointjs/mvc.Dom.js:39, packages/joint-core/test/jointjs/mvc.Dom.js:53, packages/joint-core/test/jointjs/mvc.Dom.js:67, …

What to do

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

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

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

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

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

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

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

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

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

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

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

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

M1 · Documentation (README)8.6 / 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

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
M2 · Architecture documentation5.0 / 10Adequate✓ Tool-verified

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

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

  • No Architecture Decision Records found — no conventional ADR directory, no 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 accuracy8.0 / 10Strong✓ Tool-verified

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.

  • packages/joint-react/README.md names React 18, but the manifest declares `react` ^19.1.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — packages/joint-react/README.md:45

What to do

  • Reconcile the README with reality: packages/joint-react/README.md names React 18, but the manifest declares `react` ^19.1.1.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

P10 · Library API & 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.

P2 · Observability7.0 / 10Strong✓ Tool-verified

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

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

  • `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 552 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/routers/rightAngle.mjs:552
  • `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 553 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/routers/rightAngle.mjs:553
  • `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 555 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/routers/rightAngle.mjs:555
  • `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 557 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/routers/rightAngle.mjs:557
  • `packages/joint-core/src/linkTools/Vertices.mjs` reports through `console.*` at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/linkTools/Vertices.mjs:113
  • `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 13 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/g/bezier.mjs:13
  • `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 25 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/g/bezier.mjs:25
  • `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 105 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/g/bezier.mjs:105
  • `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 133 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/g/bezier.mjs:133
  • `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 166 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/g/bezier.mjs:166
  • `packages/joint-core/src/dia/CellView.mjs` reports through `console.*` at line 834 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/dia/CellView.mjs:834
  • `packages/joint-core/src/cellTools/Control.mjs` reports through `console.*` at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/src/cellTools/Control.mjs:113
  • `packages/joint-core/demo/expand/shapes.js` reports through `console.*` at line 44 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — packages/joint-core/demo/expand/shapes.js:44

What to do

  • Route service-code `console.*` output through the module's structured logger (with named fields), so delivery outcomes and failures reach the log pipeline with a level.
P3 · Security & performance tooling4.0 / 10Weak✓ 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.

  • `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:26

What to do

  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

What to do

  • Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
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.

PF1 · Benchmark discipline8.5 / 10Strong✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

PF3 · Async & latency hygiene6.0 / 10Adequate✓ Tool-verified

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

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

  • `existsSync` in `download` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/joint-cli/src/commands/download.ts:26
  • `readdirSync` in `download` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/joint-cli/src/commands/download.ts:32
  • `existsSync` in `sparseCheckout` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/joint-cli/src/lib/git.ts:33

What to do

  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety5.5 / 10Adequate✓ 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.

  • 299 typed · 242 plain JS — the untyped files are packages/joint-core/grunt/config/aliases.js, packages/joint-core/grunt/config/clean.js, packages/joint-core/grunt/config/concat.js, packages/joint-core/grunt/config/copy.js, packages/joint-core/grunt/config/karma.js, packages/joint-core/grunt/config/qunit.js (+236 more).
R10 · Code Duplication6.7 / 10Adequate✓ Tool-verified

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

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

  • 9 duplicated blocks under packages/ have copies in at least two of the sibling directories joint-core, joint-layout-directed-graph, joint-layout-elk, joint-layout-msagl, joint-router-avoid, joint-sanitize — 3 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 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 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 9 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. — packages/joint-layout-directed-graph/karma.conf.js:39
  • 8 duplicated blocks under packages/joint-shapes-general/src/ have copies in at least two of the sibling directories arrow, card, cube, document, hexagon, note (+5 more sibling(s) not listed) — 6 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 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. — packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11
  • 5 duplicated blocks under packages/joint-core/src/ have copies in at least two of the sibling directories anchors, cellTools, dia, linkTools, mvc — 2 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 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. — packages/joint-core/src/cellTools/Control.mjs:140
  • packages/joint-core/src/g/bezier.mjs:27 · packages/joint-core/src/g/curve.mjs:43 — the two spans are one implementation copied and then locally edited — 629 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. — packages/joint-core/src/g/bezier.mjs:27
  • packages/joint-core/src/alg/rightAnglePath.mjs:37 · packages/joint-core/src/alg/rightAnglePath.mjs:87 — 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. — packages/joint-core/src/alg/rightAnglePath.mjs:37
  • packages/joint-core/src/connectors/curve.mjs:261 · packages/joint-core/src/connectors/curve.mjs:303 — 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. — packages/joint-core/src/connectors/curve.mjs:261
  • packages/joint-core/src/dia/Link.mjs:88 · packages/joint-core/src/dia/Link.mjs:129 — 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. — packages/joint-core/src/dia/Link.mjs:88
  • packages/joint-core/src/connectors/curve.mjs:100 · packages/joint-core/src/connectors/curve.mjs:140 — 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. — packages/joint-core/src/connectors/curve.mjs:100
  • packages/joint-core/src/g/path.mjs:269 · packages/joint-core/src/g/path.mjs:308 — 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. — packages/joint-core/src/g/path.mjs:269
  • packages/joint-core/src/alg/rightAnglePath.mjs:337 · packages/joint-core/src/alg/rightAnglePath.mjs:378 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/joint-core/src/alg/rightAnglePath.mjs:337
  • packages/joint-core/src/alg/rightAnglePath.mjs:421 · packages/joint-core/src/alg/rightAnglePath.mjs:462 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/joint-core/src/alg/rightAnglePath.mjs:421
  • packages/joint-core/src/connectors/curve.mjs:366 · packages/joint-core/src/connectors/curve.mjs:403 — 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. — packages/joint-core/src/connectors/curve.mjs:366
  • packages/joint-core/src/alg/rightAnglePath.mjs:703 · packages/joint-core/src/alg/rightAnglePath.mjs:803 — 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. — packages/joint-core/src/alg/rightAnglePath.mjs:703
  • packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:55 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55
  • packages/joint-router-avoid/src/providers/MainThreadProvider.mts:132 · packages/joint-router-avoid/src/providers/Worker.mts:289 — the two spans are one implementation copied and then locally edited — 177 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. — packages/joint-router-avoid/src/providers/MainThreadProvider.mts:132
  • packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5 · packages/joint-shapes-general-tools/src/StepOffsetControl.ts:5 — 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. — packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5
  • packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:50 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:55 — the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:50
  • packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts:5 · packages/joint-shapes-general-tools/src/TableDividerTool.ts:5 — the two spans are one implementation copied and then locally edited — 217 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. — packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts:5
  • packages/joint-core/src/dia/Paper.mjs:3682 · packages/joint-core/src/dia/Paper.mjs:3716 — 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. — packages/joint-core/src/dia/Paper.mjs:3682
  • packages/joint-router-avoid/src/providers/MainThreadProvider.mts:272 · packages/joint-router-avoid/src/providers/Worker.mts:184 — 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. — packages/joint-router-avoid/src/providers/MainThreadProvider.mts:272
  • packages/joint-core/src/cellTools/Button.mjs:66 · packages/joint-core/src/cellTools/HoverConnect.mjs:93 — 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. — packages/joint-core/src/cellTools/Button.mjs:66
  • packages/joint-core/src/dia/ElementView.mjs:577 · packages/joint-core/src/dia/LinkView.mjs:1318 — 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. — packages/joint-core/src/dia/ElementView.mjs:577
  • packages/joint-core/src/dia/ElementView.mjs:675 · packages/joint-core/src/dia/LinkView.mjs:1418 — 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. — packages/joint-core/src/dia/ElementView.mjs:675
  • packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:143 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:393 — 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. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:143
  • packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11 · packages/joint-shapes-general/src/trapezoid/trapezoid.ts:11 — 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. — packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11
  • packages/joint-core/src/alg/rightAnglePath.mjs:140 · packages/joint-core/src/alg/rightAnglePath.mjs:167 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/joint-core/src/alg/rightAnglePath.mjs:140
  • packages/joint-core/src/g/path.mjs:510 · packages/joint-core/src/g/polyline.mjs:202 — 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. — packages/joint-core/src/g/path.mjs:510
  • packages/joint-shapes-general-tools/src/NoteOffsetControl.ts:29 · packages/joint-shapes-general-tools/src/PlusOffsetControl.ts:29 — 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. — packages/joint-shapes-general-tools/src/NoteOffsetControl.ts:29
  • packages/joint-core/src/connectors/curve.mjs:198 · packages/joint-core/src/connectors/curve.mjs:238 — 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. — packages/joint-core/src/connectors/curve.mjs:198
  • packages/joint-core/src/dia/Link.mjs:170 · packages/joint-core/src/dia/Link.mjs:190 — 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. — packages/joint-core/src/dia/Link.mjs:170
  • packages/joint-core/src/g/path.mjs:373 · packages/joint-core/src/g/path.mjs:1010 · packages/joint-core/src/g/path.mjs:1080 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. — packages/joint-core/src/g/path.mjs:373
  • packages/joint-core/src/g/path.mjs:1591 · packages/joint-core/src/g/path.mjs:1906 — 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. — packages/joint-core/src/g/path.mjs:1591
  • packages/joint-core/src/mvc/Dom/methods.mjs:78 · packages/joint-core/src/mvc/Dom/methods.mjs:98 — 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. — packages/joint-core/src/mvc/Dom/methods.mjs:78
  • packages/joint-core/src/dia/Graph.mjs:858 · packages/joint-core/src/dia/Graph.mjs:884 — 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. — packages/joint-core/src/dia/Graph.mjs:858
  • packages/joint-core/src/dia/Graph.mjs:1209 · packages/joint-core/src/dia/Graph.mjs:1241 — 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. — packages/joint-core/src/dia/Graph.mjs:1209
  • packages/joint-core/src/dia/GraphHierarchyIndex.mjs:9 · packages/joint-core/src/dia/GraphTopologyIndex.mjs:9 — 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. — packages/joint-core/src/dia/GraphHierarchyIndex.mjs:9
  • packages/joint-core/src/g/ellipse.mjs:187 · packages/joint-core/src/g/rect.mjs:448 — 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. — packages/joint-core/src/g/ellipse.mjs:187
  • packages/joint-core/src/routers/rightAngle.mjs:688 · packages/joint-core/src/routers/rightAngle.mjs:711 — 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. — packages/joint-core/src/routers/rightAngle.mjs:688
  • packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:111 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:166 — 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. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:111
  • packages/joint-core/src/alg/rightAnglePath.mjs:753 · packages/joint-core/src/alg/rightAnglePath.mjs:853 — 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. — packages/joint-core/src/alg/rightAnglePath.mjs:753

What to do

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

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

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

  • packages/joint-layout-elk/src/elk.worker.mts:5 imports elkjs/lib/elk-worker.min.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — packages/joint-layout-elk/src/elk.worker.mts:5
  • packages/joint-layout-elk/src/mainThreadElk.mts:13 imports elkjs/lib/elk.bundled.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — packages/joint-layout-elk/src/mainThreadElk.mts:13

What to do

  • Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
R2 · Cyclomatic 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.

  • rightAnglePath has cyclomatic complexity 193 and cognitive complexity 296; 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. — packages/joint-core/src/alg/rightAnglePath.mjs:583
  • breakText has cyclomatic complexity 64 and cognitive complexity 162; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:551
  • text has cyclomatic complexity 55 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:487
  • number has cyclomatic complexity 48 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 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. — REDACTED:1412
  • rightAngleRouter has cyclomatic complexity 47 and cognitive complexity 65; 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. — packages/joint-core/src/routers/rightAngle.mjs:459
  • set has cyclomatic complexity 41 and cognitive complexity 62; 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. — packages/joint-core/src/mvc/Collection.mjs:102
  • remove has cyclomatic complexity 35 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. — packages/joint-core/src/mvc/Dom/Dom.mjs:392
  • processNodeAttributes has cyclomatic complexity 33 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. — packages/joint-core/src/dia/CellView.mjs:561
  • exists has cyclomatic complexity 33 and cognitive complexity 14; 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. — packages/joint-core/src/g/intersection.mjs:6
  • compareAscending has cyclomatic complexity 32 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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. — packages/joint-core/src/util/utilHelpers.mjs:804
  • findRoute has cyclomatic complexity 31 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/joint-core/src/routers/manhattan.mjs:560
  • onChanges 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. — packages/joint-react/src/store/graph-projection.ts:80
  • onHandleChanging has cyclomatic complexity 30 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. — packages/joint-core/src/linkTools/Segments.mjs:186
  • resolveDirection has cyclomatic complexity 28 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/joint-core/src/routers/rightAngle.mjs:681
  • baseClone has cyclomatic complexity 28 and cognitive complexity 43; 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. — packages/joint-core/src/util/utilHelpers.mjs:963
  • convexHull has cyclomatic complexity 26 and cognitive complexity 42; 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. — packages/joint-core/src/g/points.mjs:41
  • parseTransformString has cyclomatic complexity 25 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1546
  • toGeometryShape has cyclomatic complexity 25 and cognitive complexity 20; 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. — REDACTED:1134
  • Path has cyclomatic complexity 24 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. — packages/joint-core/src/g/path.mjs:10
  • updateDOMSubtreeAttributes has cyclomatic complexity 24 and cognitive complexity 45; 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. — packages/joint-core/src/dia/CellView.mjs:966
  • _createPortElement has cyclomatic complexity 24 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. — packages/joint-core/src/dia/ports.mjs:950
  • updateRelativeAttributes has cyclomatic complexity 24 and cognitive complexity 30; 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. — packages/joint-core/src/dia/CellView.mjs:660
  • add has cyclomatic complexity 23 and cognitive complexity 33; 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. — packages/joint-core/src/mvc/Dom/Dom.mjs:284
  • boundaryIntersection has cyclomatic complexity 23 and cognitive complexity 30; 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. — packages/joint-core/src/connectionPoints/index.mjs:152
  • updateViewsAsync has cyclomatic complexity 22 and cognitive complexity 37; 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. — packages/joint-core/src/dia/Paper.mjs:1750
  • getMiddleSide has cyclomatic complexity 22 and cognitive complexity 25; 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. — packages/joint-core/src/anchors/index.mjs:34
  • normalizeWheel has cyclomatic complexity 22 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:340
  • getFitToContentArea has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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. — packages/joint-core/src/dia/Paper.mjs:2395
  • pathToAbsolute has cyclomatic complexity 21 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. — REDACTED:2312
  • _snapArrowhead has cyclomatic complexity 21 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. — packages/joint-core/src/dia/LinkView.mjs:1696
  • equalObjects has cyclomatic complexity 21 and cognitive complexity 25; 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. — packages/joint-core/src/util/utilHelpers.mjs:489
  • resolveForTopSourceSide has cyclomatic complexity 21 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 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. — packages/joint-core/src/routers/rightAngle.mjs:125
  • resolveForBottomSourceSide has cyclomatic complexity 21 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 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. — packages/joint-core/src/routers/rightAngle.mjs:163
  • updateViewsBatch has cyclomatic complexity 20 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. — packages/joint-core/src/dia/Paper.mjs:1919
  • a2c has cyclomatic complexity 20 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. — REDACTED:2183
  • pointerdown has cyclomatic complexity 19 and cognitive complexity 37; 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. — packages/joint-core/src/dia/Paper.mjs:3503
  • annotateTextLine has cyclomatic complexity 19 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. — REDACTED:401
  • annotateString has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1873
  • closestPointT has cyclomatic complexity 19 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. — packages/joint-core/src/g/curve.mjs:310
  • divideAtLength has cyclomatic complexity 19 and cognitive complexity 27; 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. — packages/joint-core/src/g/path.mjs:394
R3 · Large Files6.8 / 10Adequate✓ 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.

  • packages/joint-core/src/dia/Paper.mjs has 3721 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/Paper.mjs:1
  • packages/joint-core/src/util/utilHelpers.mjs has 2087 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/util/utilHelpers.mjs:1
  • REDACTED has 2078 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/joint-core/src/dia/LinkView.mjs has 1723 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/LinkView.mjs:1
  • packages/joint-core/src/g/path.mjs has 1631 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/g/path.mjs:1
  • REDACTED has 1445 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/joint-core/src/dia/Graph.mjs has 1322 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/Graph.mjs:1
  • packages/joint-core/src/dia/CellView.mjs has 1214 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/CellView.mjs:1
  • packages/joint-core/src/alg/rightAnglePath.mjs 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. — packages/joint-core/src/alg/rightAnglePath.mjs:1
  • packages/joint-core/src/dia/ports.mjs has 932 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/ports.mjs:1
  • packages/joint-sanitize/src/sanitizeGraph.mjs has 894 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-sanitize/src/sanitizeGraph.mjs:1
  • packages/joint-core/src/dia/Cell.mjs has 771 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/Cell.mjs:1
  • packages/joint-core/src/shapes/standard.mjs has 728 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/shapes/standard.mjs:1
  • packages/joint-core/src/g/curve.mjs has 720 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/g/curve.mjs:1
  • packages/joint-core/src/dia/ElementView.mjs has 696 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/ElementView.mjs:1
  • packages/joint-core/src/routers/manhattan.mjs has 637 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/routers/manhattan.mjs:1
  • packages/joint-react/src/presets/paper-events.ts has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-react/src/presets/paper-events.ts:1
  • packages/joint-core/src/routers/rightAngle.mjs has 611 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/routers/rightAngle.mjs:1
  • packages/joint-core/src/mvc/Dom/Dom.mjs has 527 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/mvc/Dom/Dom.mjs:1
  • packages/joint-react/src/components/paper/paper.types.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-react/src/components/paper/paper.types.ts:1
  • packages/joint-core/src/dia/Link.mjs has 495 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/Link.mjs:1
  • packages/joint-react/src/hooks/use-create-portal-paper.tsx has 495 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-react/src/hooks/use-create-portal-paper.tsx:1
  • packages/joint-core/src/connectors/curve.mjs has 488 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/connectors/curve.mjs:1
  • packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:1
  • packages/joint-core/src/mvc/Collection.mjs has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/mvc/Collection.mjs:1
  • packages/joint-core/src/g/intersection.mjs has 468 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/g/intersection.mjs:1
  • packages/joint-core/src/g/rect.mjs has 450 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/g/rect.mjs:1
  • packages/joint-core/src/dia/Element.mjs has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/joint-core/src/dia/Element.mjs:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage8.1 / 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.

  • 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. (×40) — packages/joint-router-avoid/src/RouterService.mts:1, packages/joint-layout-elk/src/types/elkLayoutOptions.mts:1, packages/joint-router-avoid/src/providers/Worker.mts:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
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.

  • `examples/tree-shake` is TypeScript, but a type error in it cannot fail anything this repository runs: its `analyze-S` script (`ENTRY=S vite build`) compiles TypeScript with a transpile-only tool that strips types without checking them, and no script, config or CI step of the package runs `tsc --noEmit` or another type checker over it. Add a type check that can fail — a `typecheck` script running `tsc --noEmit` (or `vue-tsc`/`svelte-check`) that CI or the workspace pipeline runs, or a build step that checks before it bundles. — examples/tree-shake/package.json:18
R7 · Dead Code8.8 / 10Strong✓ 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.

  • 251 file(s) (~110462 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: packages/joint-core/src/core.mjs imports '../dist/version.mjs', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here. — packages/joint-core
  • Unreachable from the 280 application, 79 tooling and 259 test entry point(s) detected in this repo. Gate removals on `yarn run build` — an undetected custom entry would make these reachable.
  • no import path from any entry point (280 application, 79 tooling, 259 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 — packages/joint-react/stories/stories-utils.ts
  • Nothing imports this binding — it is safe to review for removal. (×6) — packages/joint-layout-elk/src/elkOptions.mts:84, packages/joint-layout-elk/src/elkOptions.mts:104, packages/joint-layout-elk/src/elkOptions.mts:128, …
  • Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/index.ts in the same commit, or the barrel will import a name that no longer exists. (×2) — packages/joint-react/src/selectors/cell-selectors.ts:141, packages/joint-react/src/selectors/cell-selectors.ts:156
  • Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists. (×5) — packages/joint-react/src/state/data-mapping/element-mapper.ts:65, packages/joint-react/src/state/data-mapping/element-mapper.ts:69, packages/joint-react/src/state/data-mapping/link-mapper.ts:67, …
  • This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. (×11) — packages/joint-core/test/ts/index.test.ts:86, packages/joint-core/test/ts/index.test.ts:89, packages/joint-core/test/ts/index.test.ts:182, …

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 Hygiene3.5 / 10Weak✓ Tool-verified

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

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

  • Imported but not declared in any reachable package.json — installs work only by hoisting accident. — packages/joint-core/scripts/parseDocs.js:18
  • Declared in packages/joint-core/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. (×9) — packages/joint-core/package.json:97, packages/joint-core/package.json:103, packages/joint-core/package.json:104, …

What to do

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

  • packages/joint-core/src/dia/GraphLayerView.mjs → packages/joint-core/src/dia/Paper.mjs → packages/joint-core/src/dia/GraphLayerView.mjs (one verified cycle inside a mutually-dependent group of 3 files) — packages/joint-core/src/dia/GraphLayerView.mjs:4
  • packages/joint-core/src/g/ellipse.mjs → packages/joint-core/src/g/rect.mjs → packages/joint-core/src/g/ellipse.mjs (one verified cycle inside a mutually-dependent group of 3 files) — packages/joint-core/src/g/ellipse.mjs:1

What to do

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

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

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

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

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

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

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

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

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

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation4.0 / 10Weak✓ Tool-verified

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

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

  • Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `fetchDemosConfig` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — packages/joint-cli/src/lib/github.ts:30
  • `listDemoFolders` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — packages/joint-cli/src/lib/github.ts:62

What to do

  • Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

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

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

X24 · Document value interpolated into markup unescaped4.9 / 10Weak✓ 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 the DOM library's `.html()` 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. — packages/joint-core/src/dia/attributes/index.mjs:56
  • `string` 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) — packages/joint-core/src/mvc/Dom/Dom.mjs:65, packages/joint-sanitize/src/sanitizeHTML.mjs:25
  • `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. — packages/joint-core/src/mvc/Dom/methods.mjs:70

What to do

  • Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

  • `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. (×3) — packages/joint-router-avoid/src/RouterService.mts:429, packages/joint-router-avoid/src/providers/WorkerProvider.mts:182, packages/joint-router-avoid/src/providers/WorkerProvider.mts:183
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×2) — packages/joint-react/src/presets/paper.ts:237, packages/joint-react/src/presets/paper.ts:326

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.

X5 · Nullable reference types5.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.

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

  • 16/34 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
  • ~1.8 `!` null assertions per 1k TypeScript source lines — 47 assertion(s) across the 26708 source line(s) of the 209 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/joint-react/src/store/graph-projection.ts (13), packages/joint-router-avoid/src/RouterService.mts (9), packages/joint-router-avoid/src/providers/MainThreadProvider.mts (7). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.

What to do

  • The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).

WCAG coverage — what static analysis assessed

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

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

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

Reference — by lens

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

LensScoreRatingImpact
Code Health55.1Adequate — gated by D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture86.1StrongStrongest area.
Maturity75.2StrongSolid.
Readiness56.5Adequate — gated by R8Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security53.9Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility47.0Weak — gated by AC1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance70.7StrongSolid.
Unscored — 3 check(s) recorded observations but carry no score

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

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — 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'.
  • X10 Duplicated predicate — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

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

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 53 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.

  • AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
  • AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
  • AX1 Captive dependencies — Not applicable: Angular's root injector cannot see a component-level provider, so a root service asking for one fails with NullInjectorError instead of capturing it.
  • 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).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the dev server (`npm run dev`) exited before it served a page. Likely cause (the repository): package.json has no "dev" script, so `npm run dev` could not start the app. Last output: "npm error Missing script: "dev" / npm error / npm error To see a list of scripts, run: / npm error npm run / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. The cause is in the repository, not in our sandbox: package.json has no "dev" script, so `npm run dev` could not start the app. Nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no data at rest for these controls to protect. If it does persist personal data (through a hosted backend configured outside this repository, for instance), the controls belong to wherever that data is stored.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository stands up no server (no Express, Fastify, Koa, Hono, NestJS or similar app, no Next.js/SvelteKit/Nuxt server route, no edge function), creates no Supabase tables and talks to no hosted backend. Access control is therefore N/A here — a browser application or library is authorized by the server it calls, not by itself; a client-side route guard hides a page and authorizes nothing. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound. If it does (through a hosted backend configured outside this repository, for instance), the limit belongs wherever that data is stored.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over. If it does (through a hosted backend configured outside this repository, for instance), the rights are served wherever that data is stored.
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D21 Naming Consistency — Naming consistency does not read html yet; not measured.
  • D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed JavaScript surface was not measured.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — symbol resolution incomplete — navigability not assessed
  • 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) — 25 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D4 Code Duplication — This repository's production source (.js, .mjs, .mts, .ts, .tsx, .vue) is not read by D4's token comparison, which compares .NET source: duplication in it is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream. Not scored here — read the R10 card for this repository's duplication.
  • 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.
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • 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
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (1 domain event(s); its domain events are published by services or handlers — no domain entity raises one)
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the 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 data present for 12 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • 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.
  • R5 Dependency Freshness — uses a yarn lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • S1 Web-Security Posture — Not assessed: 381 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.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — 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
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 45 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 8 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×2
  • Orphaned knowledge packages/joint-core/src/g/path.mjs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge packages/joint-core/src/g/curve.mjs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
R9 · Circular Imports · Import cycle (2 files) · ×2
  • Import cycle (2 files) packages/joint-core/src/dia/GraphLayerView.mjs:4 — packages/joint-core/src/dia/GraphLayerView.mjs → packages/joint-core/src/dia/Paper.mjs → packages/joint-core/src/dia/GraphLayerView.mjs (one verified cycle inside a mutually-dependent group of 3 files)
  • Import cycle (2 files) packages/joint-core/src/g/ellipse.mjs:1 — packages/joint-core/src/g/ellipse.mjs → packages/joint-core/src/g/rect.mjs → packages/joint-core/src/g/ellipse.mjs (one verified cycle inside a mutually-dependent group of 3 files)
AC2 · Forms & labels · <input> without a programmatic label · ×1
  • <input> without a programmatic label packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:475 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
R8 · Dependency Hygiene · Unlisted import 'cheerio' · ×1
  • Unlisted import 'cheerio' packages/joint-core/scripts/parseDocs.js:18 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Serious — 472 finding(s)
R4 · Test Coverage · No test reaches this file · ×40
  • No test reaches this file packages/joint-router-avoid/src/RouterService.mts: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 packages/joint-layout-elk/src/types/elkLayoutOptions.mts: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 packages/joint-router-avoid/src/providers/Worker.mts: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 packages/joint-router-avoid/src/providers/MainThreadProvider.mts: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 packages/joint-layout-elk/src/types/elkNodeOptions.mts: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 packages/joint-layout-msagl/src/utils.mts: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 packages/joint-router-avoid/src/providers/WorkerProvider.mts: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 packages/joint-decorators/src/parser.ts: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 packages/joint-router-avoid/src/providers/Provider.mts: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 packages/joint-react/scripts/create-rollup-config.ts: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 packages/joint-core/rollup.resources.mjs: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 packages/joint-router-avoid/src/init.mts: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 packages/joint-layout-msagl/src/types.mts: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 packages/joint-shapes-general-tools/src/RadiusControl.ts: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 packages/joint-cli/src/cli.ts: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 packages/joint-core/grunt/config/karma.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 packages/joint-layout-elk/src/types/elkEdgeOptions.mts: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 packages/joint-decorators/src/decorators/Model.ts: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 packages/joint-core/scripts/parseDocs.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 packages/joint-layout-elk/src/types/elkLabelOptions.mts: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 packages/joint-layout-elk/src/types/elkPortOptions.mts: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 packages/joint-layout-msagl/src/index.mts: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 packages/joint-shapes-general/src/cube/cube.ts: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 packages/joint-layout-msagl/src/defaults.mts: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 packages/joint-shapes-general-tools/src/CubeCornerTool.ts: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.
  • + 15 more in this group — see findings.md.
D12 · Dependency Hygiene · Deprecated · ×20
  • Deprecated: eslint packages/joint-cli/package.json:26 — eslint 9.39.2, declared in packages/joint-cli/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: core-js packages/joint-core/package.json:99 — core-js 3.8.3, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "core-js@<3.23.3 is no longer maintained and not recommended for usage due to the number of issues. Because of the V8 engine whims, feature detection in old core-js versions could cause a slowdown up to 100x even if nothing is polyfilled. Some versions have web compatibility issues. Please, upgrade your dependencies to the actual version of core-js.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-core/package.json:101 — eslint 9.39.2, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: rollup-plugin-commonjs packages/joint-core/package.json:124 — rollup-plugin-commonjs 10.1.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "This package has been deprecated and is no longer maintained. Please use @rollup/plugin-commonjs.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: rollup-plugin-json packages/joint-core/package.json:125 — rollup-plugin-json 4.0.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "This module has been deprecated and is no longer maintained. Please use @rollup/plugin-json.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: rollup-plugin-node-resolve packages/joint-core/package.json:126 — rollup-plugin-node-resolve 5.2.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "This package has been deprecated and is no longer maintained. Please use @rollup/plugin-node-resolve.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: sinon packages/joint-core/package.json:127 — sinon 7.2.2, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "16.1.1". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: time-grunt packages/joint-core/package.json:128 — time-grunt 2.0.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: "Deprecated because Grunt is practically unmaintained. Move on to something better. This package will continue to work with Grunt v1, but it will not receive any updates.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-decorators/package.json:45 — eslint 9.39.2, declared in packages/joint-decorators/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-eslint-config/package.json:34 — eslint 9.39.2, declared in packages/joint-eslint-config/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-layout-directed-graph/package.json:63 — eslint 9.39.2, declared in packages/joint-layout-directed-graph/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-layout-elk/package.json:71 — eslint 9.39.2, declared in packages/joint-layout-elk/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-layout-msagl/package.json:73 — eslint 9.39.2, declared in packages/joint-layout-msagl/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-mock-svg/package.json:66 — eslint 9.39.2, declared in packages/joint-mock-svg/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-react/package.json:116 — eslint 9.39.2, declared in packages/joint-react/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-router-avoid/package.json:66 — eslint 9.39.2, declared in packages/joint-router-avoid/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-sanitize/package.json:63 — eslint 9.39.2, declared in packages/joint-sanitize/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-shapes-general-tools/package.json:48 — eslint 9.39.2, declared in packages/joint-shapes-general-tools/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-shapes-general/package.json:46 — eslint 9.39.2, declared in packages/joint-shapes-general/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint packages/joint-vitest-plugin-mock-svg/package.json:77 — eslint 9.39.2, declared in packages/joint-vitest-plugin-mock-svg/package.json, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
D2 · Cognitive Complexity · (anonymous) · ×10
  • (anonymous)::text (cognitive 110) REDACTED:487 — (anonymous)::text has cognitive complexity 110 (threshold 15). Drivers by points: if/else 38 (81 pts), boolean chains 15, ternaries 3 (6 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • (anonymous)::parseTransformString (cognitive 38) REDACTED:1546 — (anonymous)::parseTransformString has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 9, ternaries 7 (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.
  • (anonymous)::(anonymous)::pathToAbsolute (cognitive 35) REDACTED:2312 — (anonymous)::(anonymous)::pathToAbsolute has cognitive complexity 35 (threshold 15). Drivers by points: loops 4 (12 pts), ternaries 2 (10 pts), if/else 4 (5 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::annotateTextLine (cognitive 34) REDACTED:401 — (anonymous)::annotateTextLine has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::(anonymous)::a2c (cognitive 34) REDACTED:2183 — (anonymous)::(anonymous)::a2c has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 5 (11 pts), boolean chains 4, loops 1 (2 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.
  • (anonymous)::annotateString (cognitive 33) REDACTED:1873 — (anonymous)::annotateString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, 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.
  • (anonymous)::getBBox (cognitive 28) REDACTED:283 — (anonymous)::getBBox has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 1 (2 pts), loops 1 (2 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.
  • (anonymous)::toGeometryShape (cognitive 20) REDACTED:1134 — (anonymous)::toGeometryShape has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 2 (4 pts), match/switch 1 (nesting depth added 2). 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.
  • (anonymous)::V (cognitive 17) REDACTED:39 — (anonymous)::V has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (4 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.
  • (anonymous)::findIntersection (cognitive 17) REDACTED:1190 — (anonymous)::findIntersection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D1 · Cyclomatic Complexity · (anonymous) · ×9
  • (anonymous)::text (cyclomatic 55) REDACTED:487 — (anonymous)::text has cyclomatic complexity 55 (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.
  • (anonymous)::toGeometryShape (cyclomatic 25) REDACTED:1134 — (anonymous)::toGeometryShape 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.
  • (anonymous)::parseTransformString (cyclomatic 25) REDACTED:1546 — (anonymous)::parseTransformString 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.
  • (anonymous)::(anonymous)::pathToAbsolute (cyclomatic 21) REDACTED:2312 — (anonymous)::(anonymous)::pathToAbsolute has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • (anonymous)::(anonymous)::a2c (cyclomatic 20) REDACTED:2183 — (anonymous)::(anonymous)::a2c 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.
  • (anonymous)::annotateTextLine (cyclomatic 19) REDACTED:401 — (anonymous)::annotateTextLine 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.
  • (anonymous)::annotateString (cyclomatic 19) REDACTED:1873 — (anonymous)::annotateString 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.
  • (anonymous)::(anonymous)::normalize::processPath (cyclomatic 18) REDACTED:2422 — (anonymous)::(anonymous)::normalize::processPath 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.
  • (anonymous)::findIntersection (cyclomatic 16) REDACTED:1190 — (anonymous)::findIntersection 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.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×8
  • Focus outline removed in CSS without a :focus replacement packages/joint-core/demo/routing/css/routing.css:20 — `.router-switch` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement packages/joint-core/demo/html/css/html.css:88 — `.html-element-field` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement packages/joint-core/demo/html/css/html.css:130 — `.toolbar-button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement packages/joint-core/demo/archive/logic/css/logic.css:86 — `.joint-element .highlighted` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement examples/vue-js/src/styles.css:25 — `.toolbar button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement examples/layout-elk-dependency-graph-ts/src/styles.scss:28 — `.toolbar-button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement examples/layout-elk-defaults-ts/src/styles.scss:48 — `.toolbar-button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement examples/layout-elk-containers-and-ports-ts/src/styles.scss:48 — `.toolbar-button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · FunctionTooLong · ×7
  • FunctionTooLong: rightAnglePath.rightAnglePath packages/joint-core/src/alg/rightAnglePath.mjs:583 — FunctionTooLong — rightAnglePath runs 503 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 403 over it, 5.03× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: use-create-portal-paper.useCreatePortalPaper packages/joint-react/src/hooks/use-create-portal-paper.tsx:186 — FunctionTooLong — useCreatePortalPaper runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: measurement.createMeasurement packages/joint-react/src/store/measurement.ts:112 — FunctionTooLong — createMeasurement runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: paper-events.addPaperEventListeners packages/joint-react/src/presets/paper-events.ts:483 — FunctionTooLong — addPaperEventListeners runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: code-controlled-mode-peerjs.Main packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:311 — FunctionTooLong — Main runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: rightAngle.rightAngleRouter packages/joint-core/src/routers/rightAngle.mjs:459 — FunctionTooLong — rightAngleRouter runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: use-cells.useCells packages/joint-react/src/hooks/use-cells.ts:256 — FunctionTooLong — useCells runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D3 · God Classes · FileTooLong · ×7
  • FileTooLong: dia/Paper.mjs packages/joint-core/src/dia/Paper.mjs — FileTooLong — 2394 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 894 over it, 1.60× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: util/utilHelpers.mjs packages/joint-core/src/util/utilHelpers.mjs — FileTooLong — 1589 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1089 over it, 3.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: g/path.mjs packages/joint-core/src/g/path.mjs — FileTooLong — 1153 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 653 over it, 2.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1020 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 520 over it, 2.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: alg/rightAnglePath.mjs packages/joint-core/src/alg/rightAnglePath.mjs — FileTooLong — 821 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 61% of them inside a single declaration: rightAnglePath (583-1416). The bar is 500 significant lines; this is 321 over it, 1.64× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: dia/ports.mjs packages/joint-core/src/dia/ports.mjs — FileTooLong — 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: dia/Cell.mjs packages/joint-core/src/dia/Cell.mjs — FileTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D30 · Dependency Vulnerabilities · Medium CVE · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
R10 · Code Duplication · Duplicated block (18 lines × 2 locations) · ×6
  • Duplicated block (18 lines × 2 locations) packages/joint-core/src/dia/Graph.mjs:858 — packages/joint-core/src/dia/Graph.mjs:858 · packages/joint-core/src/dia/Graph.mjs:884 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (18 lines × 2 locations) packages/joint-core/src/dia/Graph.mjs:1209 — packages/joint-core/src/dia/Graph.mjs:1209 · packages/joint-core/src/dia/Graph.mjs:1241 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (18 lines × 2 locations) packages/joint-core/src/dia/GraphHierarchyIndex.mjs:9 — packages/joint-core/src/dia/GraphHierarchyIndex.mjs:9 · packages/joint-core/src/dia/GraphTopologyIndex.mjs:9 — 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.
  • Duplicated block (18 lines × 2 locations) packages/joint-core/src/g/ellipse.mjs:187 — packages/joint-core/src/g/ellipse.mjs:187 · packages/joint-core/src/g/rect.mjs:448 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (18 lines × 2 locations) packages/joint-core/src/routers/rightAngle.mjs:688 — packages/joint-core/src/routers/rightAngle.mjs:688 · packages/joint-core/src/routers/rightAngle.mjs:711 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (18 lines × 2 locations) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:111 — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:111 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:166 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (23 lines × 2 locations) · ×5
  • Duplicated block (23 lines × 2 locations) packages/joint-core/src/cellTools/Button.mjs:66 — packages/joint-core/src/cellTools/Button.mjs:66 · packages/joint-core/src/cellTools/HoverConnect.mjs:93 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (23 lines × 2 locations) packages/joint-core/src/dia/ElementView.mjs:577 — packages/joint-core/src/dia/ElementView.mjs:577 · packages/joint-core/src/dia/LinkView.mjs:1318 — 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.
  • Duplicated block (23 lines × 2 locations) packages/joint-core/src/dia/ElementView.mjs:675 — packages/joint-core/src/dia/ElementView.mjs:675 · packages/joint-core/src/dia/LinkView.mjs:1418 — 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.
  • Duplicated block (23 lines × 2 locations) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:143 — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:143 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:393 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (23 lines × 2 locations) packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11 — packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11 · packages/joint-shapes-general/src/trapezoid/trapezoid.ts:11 — 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×5
  • Swallowed exception (empty catch) packages/joint-router-avoid/src/RouterService.mts:429 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) packages/joint-router-avoid/src/providers/WorkerProvider.mts:182 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) packages/joint-router-avoid/src/providers/WorkerProvider.mts:183 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) packages/joint-react/src/presets/paper.ts:237 — 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) packages/joint-react/src/presets/paper.ts:326 — 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.
AC1 · Text alternatives · <canvas> without a text alternative · ×4
  • <canvas> without a text alternative packages/joint-core/src/dia/Paper.mjs:202 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative packages/joint-core/src/dia/Paper.mjs:229 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative packages/joint-core/src/dia/Paper.mjs:251 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative packages/joint-core/src/dia/Paper.mjs:278 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×4
  • Animation without a prefers-reduced-motion guard packages/joint-core/test/jointjs/mvc.Dom.js:39 — `$el.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard packages/joint-core/test/jointjs/mvc.Dom.js:53 — `$el.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard packages/joint-core/test/jointjs/mvc.Dom.js:67 — `$el.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard packages/joint-core/test/jointjs/mvc.Dom.js:86 — `$el.animate()` moves (`Web Animations API keyframes`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
R10 · Code Duplication · Duplicated block (19 lines × 2 locations) · ×4
  • Duplicated block (19 lines × 2 locations) packages/joint-core/src/connectors/curve.mjs:198 — packages/joint-core/src/connectors/curve.mjs:198 · packages/joint-core/src/connectors/curve.mjs:238 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (19 lines × 2 locations) packages/joint-core/src/dia/Link.mjs:170 — packages/joint-core/src/dia/Link.mjs:170 · packages/joint-core/src/dia/Link.mjs:190 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2 locations) packages/joint-core/src/g/path.mjs:1591 — packages/joint-core/src/g/path.mjs:1591 · packages/joint-core/src/g/path.mjs:1906 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2 locations) packages/joint-core/src/mvc/Dom/methods.mjs:78 — packages/joint-core/src/mvc/Dom/methods.mjs:78 · packages/joint-core/src/mvc/Dom/methods.mjs:98 — 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.
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×4
  • Untrusted text written into markup unescaped packages/joint-core/src/dia/attributes/index.mjs:56 — `html+''` is text this program did not author, and it is written into the text of an element through the DOM library's `.html()` 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 packages/joint-core/src/mvc/Dom/Dom.mjs:65 — `string` 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 packages/joint-core/src/mvc/Dom/methods.mjs:70 — `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped packages/joint-sanitize/src/sanitizeHTML.mjs:25 — `string` 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×3
  • Hotspot: packages/joint-core/src/routers/rightAngle.mjs packages/joint-core/src/routers/rightAngle.mjs:459 — packages/joint-core/src/routers/rightAngle.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rightAngle.rightAngleRouter at line 459. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-11 14:50:22 +01:00' --until='2026-11-09 14:50:22 +01:00' --full-history --no-merges -- packages/joint-core/src/routers/rightAngle.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/joint-react/src/store/graph-projection.ts packages/joint-react/src/store/graph-projection.ts:54 — packages/joint-react/src/store/graph-projection.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in graph-projection.graphProjection at line 54. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-11 14:50:22 +01:00' --until='2026-11-09 14:50:22 +01:00' --full-history --no-merges -- packages/joint-react/src/store/graph-projection.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/joint-react/src/hooks/use-create-portal-paper.tsx packages/joint-react/src/hooks/use-create-portal-paper.tsx:186 — packages/joint-react/src/hooks/use-create-portal-paper.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in use-create-portal-paper.useCreatePortalPaper at line 186. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-11 14:50:22 +01:00' --until='2026-11-09 14:50:22 +01:00' --full-history --no-merges -- packages/joint-react/src/hooks/use-create-portal-paper.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×3
  • Sync-over-async blocking packages/joint-cli/src/commands/download.ts:26 — `existsSync` in `download` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/joint-cli/src/commands/download.ts:32 — `readdirSync` in `download` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/joint-cli/src/lib/git.ts:33 — `existsSync` in `sparseCheckout` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
D17 · Explicit Debt · TodoComment · ×2
  • TodoComment packages/joint-core/test/ts/index.test.ts:349 — // TODO: Fix 'MyElement' is assignable to the constraint of type 'E', but 'E' — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment examples/offscreen-rendering/src/index.ts:38 — // TODO: support multiline text — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
R10 · Code Duplication · Duplicated block (37 lines × 2 locations) · ×2
  • Duplicated block (37 lines × 2 locations) packages/joint-core/src/alg/rightAnglePath.mjs:337 — packages/joint-core/src/alg/rightAnglePath.mjs:337 · packages/joint-core/src/alg/rightAnglePath.mjs:378 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
  • Duplicated block (37 lines × 2 locations) packages/joint-core/src/alg/rightAnglePath.mjs:421 — packages/joint-core/src/alg/rightAnglePath.mjs:421 · packages/joint-core/src/alg/rightAnglePath.mjs:462 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (32 lines × 2 locations) · ×2
  • Duplicated block (32 lines × 2 locations) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:55 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
  • Duplicated block (32 lines × 2 locations) packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5 — packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5 · packages/joint-shapes-general-tools/src/StepOffsetControl.ts:5 — 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 (22 lines × 2 locations) · ×2
  • Duplicated block (22 lines × 2 locations) packages/joint-core/src/alg/rightAnglePath.mjs:140 — packages/joint-core/src/alg/rightAnglePath.mjs:140 · packages/joint-core/src/alg/rightAnglePath.mjs:167 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
  • Duplicated block (22 lines × 2 locations) packages/joint-core/src/g/path.mjs:510 — packages/joint-core/src/g/path.mjs:510 · packages/joint-core/src/g/polyline.mjs:202 — 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.
R11 · Import Boundaries · Boundary violation [package · ×2
  • Boundary violation [package:third-party-deep-import] packages/joint-layout-elk/src/elk.worker.mts:5 — packages/joint-layout-elk/src/elk.worker.mts:5 imports elkjs/lib/elk-worker.min.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
  • Boundary violation [package:third-party-deep-import] packages/joint-layout-elk/src/mainThreadElk.mts:13 — packages/joint-layout-elk/src/mainThreadElk.mts:13 imports elkjs/lib/elk.bundled.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
X2 · Cancellation propagation · Async function without AbortSignal · ×2
  • Async function without AbortSignal: fetchDemosConfig packages/joint-cli/src/lib/github.ts:30 — `fetchDemosConfig` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: listDemoFolders packages/joint-cli/src/lib/github.ts:62 — `listDemoFolders` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
AC6 · Visual & motion safety · Low contrast Tailwind colour pair (3.3 · ×1
  • Low contrast Tailwind colour pair (3.3:1) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:435 — This element's Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.4 · ×1
  • Low contrast colour pair in CSS (3.4:1) packages/joint-react/stories/examples/index.css:1 — `.node` sets color: #dde6ed on background-color: #ed2637 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.0 · ×1
  • Low contrast colour pair in CSS (4.0:1) examples/element-tags-and-badges-js/src/styles.scss:31 — `button` sets color: white on background-color: #007bff — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.7 · ×1
  • Low contrast colour pair in CSS (3.7:1) examples/angular-element-view-ts/src/app/app.component.css:27 — `.toolbar button` sets color: white on background-color: #3b82f6 — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · rightAnglePath (cyclomatic 193) · ×1
  • rightAnglePath (cyclomatic 193) packages/joint-core/src/alg/rightAnglePath.mjs:583 — rightAnglePath has cyclomatic complexity 193 (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 · breakText (cyclomatic 64) · ×1
  • breakText (cyclomatic 64) REDACTED:551 — breakText has cyclomatic complexity 64 (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 · getConnectedLinks (cyclomatic 53) · ×1
  • getConnectedLinks (cyclomatic 53) packages/joint-core/src/dia/Graph.mjs:836 — getConnectedLinks has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 9 of the 53 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 928, a function literal at line 948, addOutbounds, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · number (cyclomatic 50) · ×1
  • number (cyclomatic 50) REDACTED:1412 — number has cyclomatic complexity 50 (threshold 15). Of this number, 48 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rightAngleRouter (cyclomatic 47) · ×1
  • rightAngleRouter (cyclomatic 47) packages/joint-core/src/routers/rightAngle.mjs:459 — rightAngleRouter has cyclomatic complexity 47 (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 · set (cyclomatic 41) · ×1
  • set (cyclomatic 41) packages/joint-core/src/mvc/Collection.mjs:102 — set has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · graph-projection.graphProjection (cyclomatic 36) · ×1
  • graph-projection.graphProjection (cyclomatic 36) packages/joint-react/src/store/graph-projection.ts:54 — graph-projection.graphProjection has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 4 of the 36 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 80, 139). 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 · Dom.$.event.remove (cyclomatic 35) · ×1
  • Dom.$.event.remove (cyclomatic 35) packages/joint-core/src/mvc/Dom/Dom.mjs:392 — Dom.$.event.remove 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 · intersection.exists (cyclomatic 33) · ×1
  • intersection.exists (cyclomatic 33) packages/joint-core/src/g/intersection.mjs:6 — intersection.exists has cyclomatic complexity 33 (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 · processNodeAttributes (cyclomatic 33) · ×1
  • processNodeAttributes (cyclomatic 33) packages/joint-core/src/dia/CellView.mjs:561 — processNodeAttributes 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 · utilHelpers.compareAscending (cyclomatic 32) · ×1
  • utilHelpers.compareAscending (cyclomatic 32) packages/joint-core/src/util/utilHelpers.mjs:804 — utilHelpers.compareAscending has cyclomatic complexity 32 (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 · import.importNode (cyclomatic 32) · ×1
  • import.importNode (cyclomatic 32) packages/joint-layout-elk/src/import.mts:272 — import.importNode has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 300). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · manhattan.findRoute (cyclomatic 31) · ×1
  • manhattan.findRoute (cyclomatic 31) packages/joint-core/src/routers/manhattan.mjs:560 — manhattan.findRoute 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 · getNeighbors (cyclomatic 31) · ×1
  • getNeighbors (cyclomatic 31) packages/joint-core/src/dia/Graph.mjs:991 — getNeighbors has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 13 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 1001). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · onHandleChanging (cyclomatic 30) · ×1
  • onHandleChanging (cyclomatic 30) packages/joint-core/src/linkTools/Segments.mjs:186 — onHandleChanging 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 · utilHelpers.baseClone (cyclomatic 29) · ×1
  • utilHelpers.baseClone (cyclomatic 29) packages/joint-core/src/util/utilHelpers.mjs:963 — utilHelpers.baseClone has cyclomatic complexity 29 (threshold 15). Of this number, 28 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 · rightAngle.resolveDirection (cyclomatic 28) · ×1
  • rightAngle.resolveDirection (cyclomatic 28) packages/joint-core/src/routers/rightAngle.mjs:681 — rightAngle.resolveDirection 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 · points.convexHull (cyclomatic 27) · ×1
  • points.convexHull (cyclomatic 27) packages/joint-core/src/g/points.mjs:41 — points.convexHull has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · use-cells.useCells (cyclomatic 27) · ×1
  • use-cells.useCells (cyclomatic 27) packages/joint-react/src/hooks/use-cells.ts:256 — use-cells.useCells has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 375, 325, 361, …). 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 · use-create-features.useCreateFeature (cyclomatic 27) · ×1
  • use-create-features.useCreateFeature (cyclomatic 27) packages/joint-react/src/hooks/use-create-features.ts:252 — use-create-features.useCreateFeature has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 340, a function literal at line 395, a function literal at line 270, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · debounce (cyclomatic 27) · ×1
  • debounce (cyclomatic 27) packages/joint-core/src/util/utilHelpers.mjs:2179 — debounce has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to 12 function items inside it that branch (shouldInvoke, debounced, trailingEdge, …). 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 · Dom.$.event.add (cyclomatic 24) · ×1
  • Dom.$.event.add (cyclomatic 24) packages/joint-core/src/mvc/Dom/Dom.mjs:284 — Dom.$.event.add has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · path.Path (cyclomatic 24) · ×1
  • path.Path (cyclomatic 24) packages/joint-core/src/g/path.mjs:10 — path.Path has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sanitizeGraph.sanitizePorts (cyclomatic 24) · ×1
  • sanitizeGraph.sanitizePorts (cyclomatic 24) packages/joint-sanitize/src/sanitizeGraph.mjs:801 — sanitizeGraph.sanitizePorts has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 5 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (getGroupProperty, getTargets, removeMergedLabelMarkup, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · _snapArrowhead (cyclomatic 24) · ×1
  • _snapArrowhead (cyclomatic 24) packages/joint-core/src/dia/LinkView.mjs:1696 — _snapArrowhead has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · updateRelativeAttributes (cyclomatic 24) · ×1
  • updateRelativeAttributes (cyclomatic 24) packages/joint-core/src/dia/CellView.mjs:660 — updateRelativeAttributes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · updateDOMSubtreeAttributes (cyclomatic 24) · ×1
  • updateDOMSubtreeAttributes (cyclomatic 24) packages/joint-core/src/dia/CellView.mjs:966 — updateDOMSubtreeAttributes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _createPortElement (cyclomatic 24) · ×1
  • _createPortElement (cyclomatic 24) packages/joint-core/src/dia/ports.mjs:950 — _createPortElement has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.boundaryIntersection (cyclomatic 23) · ×1
  • index.boundaryIntersection (cyclomatic 23) packages/joint-core/src/connectionPoints/index.mjs:152 — index.boundaryIntersection 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 · util.normalizeWheel (cyclomatic 22) · ×1
  • util.normalizeWheel (cyclomatic 22) REDACTED:340 — util.normalizeWheel 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 · index.getMiddleSide (cyclomatic 22) · ×1
  • index.getMiddleSide (cyclomatic 22) packages/joint-core/src/anchors/index.mjs:34 — index.getMiddleSide 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 · use-create-portal-paper.useCreatePortalPaper (cyclomatic 22) · ×1
  • use-create-portal-paper.useCreatePortalPaper (cyclomatic 22) packages/joint-react/src/hooks/use-create-portal-paper.tsx:186 — use-create-portal-paper.useCreatePortalPaper has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 382, 223, 369, …). 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 · code-controlled-mode-peerjs.Main (cyclomatic 22) · ×1
  • code-controlled-mode-peerjs.Main (cyclomatic 22) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:311 — code-controlled-mode-peerjs.Main has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 404, a function literal at line 391, a function literal at line 341, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · updateViewsAsync (cyclomatic 22) · ×1
  • updateViewsAsync (cyclomatic 22) packages/joint-core/src/dia/Paper.mjs:1750 — updateViewsAsync 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 · getFitToContentArea (cyclomatic 22) · ×1
  • getFitToContentArea (cyclomatic 22) packages/joint-core/src/dia/Paper.mjs:2395 — getFitToContentArea 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 · utilHelpers.equalObjects (cyclomatic 21) · ×1
  • utilHelpers.equalObjects (cyclomatic 21) packages/joint-core/src/util/utilHelpers.mjs:489 — utilHelpers.equalObjects has cyclomatic complexity 21 (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 · rightAngle.resolveForTopSourceSide (cyclomatic 21) · ×1
  • rightAngle.resolveForTopSourceSide (cyclomatic 21) packages/joint-core/src/routers/rightAngle.mjs:125 — rightAngle.resolveForTopSourceSide 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForBottomSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · rightAngle.resolveForBottomSourceSide (cyclomatic 21) · ×1
  • rightAngle.resolveForBottomSourceSide (cyclomatic 21) packages/joint-core/src/routers/rightAngle.mjs:163 — rightAngle.resolveForBottomSourceSide 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForTopSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · updateViewsBatch (cyclomatic 20) · ×1
  • updateViewsBatch (cyclomatic 20) packages/joint-core/src/dia/Paper.mjs:1919 — updateViewsBatch 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 · utilHelpers.baseIsEqualDeep (cyclomatic 19) · ×1
  • utilHelpers.baseIsEqualDeep (cyclomatic 19) packages/joint-core/src/util/utilHelpers.mjs:561 — utilHelpers.baseIsEqualDeep 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. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · rightAngle.resolveForLeftSourceSide (cyclomatic 19) · ×1
  • rightAngle.resolveForLeftSourceSide (cyclomatic 19) packages/joint-core/src/routers/rightAngle.mjs:201 — rightAngle.resolveForLeftSourceSide 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForRightSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · rightAngle.resolveForRightSourceSide (cyclomatic 19) · ×1
  • rightAngle.resolveForRightSourceSide (cyclomatic 19) packages/joint-core/src/routers/rightAngle.mjs:235 — rightAngle.resolveForRightSourceSide 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForLeftSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · pointerdown (cyclomatic 19) · ×1
  • pointerdown (cyclomatic 19) packages/joint-core/src/dia/Paper.mjs:3503 — pointerdown 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 · confirmUpdate (cyclomatic 19) · ×1
  • confirmUpdate (cyclomatic 19) packages/joint-core/src/dia/LinkView.mjs:80 — confirmUpdate 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 · divideAtLength (cyclomatic 19) · ×1
  • divideAtLength (cyclomatic 19) packages/joint-core/src/g/path.mjs:394 — divideAtLength 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 · closestPointT (cyclomatic 19) · ×1
  • closestPointT (cyclomatic 19) packages/joint-core/src/g/curve.mjs:310 — closestPointT 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 · utilHelpers.equalArrays (cyclomatic 18) · ×1
  • utilHelpers.equalArrays (cyclomatic 18) packages/joint-core/src/util/utilHelpers.mjs:600 — utilHelpers.equalArrays has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · utilHelpers.equalByTag (cyclomatic 18) · ×1
  • utilHelpers.equalByTag (cyclomatic 18) packages/joint-core/src/util/utilHelpers.mjs:681 — utilHelpers.equalByTag has cyclomatic complexity 18 (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. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · util.parseDOMJSON · ×1
  • util.parseDOMJSON::parseNode (cyclomatic 18) REDACTED:85 — util.parseDOMJSON::parseNode 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 · Events.offApi (cyclomatic 18) · ×1
  • Events.offApi (cyclomatic 18) packages/joint-core/src/mvc/Events.mjs:156 — Events.offApi 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 · jumpover.jumpover (cyclomatic 18) · ×1
  • jumpover.jumpover (cyclomatic 18) packages/joint-core/src/connectors/jumpover.mjs:340 — jumpover.jumpover has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body's own statements and 9 belong to 4 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 · scheduleViewUpdate (cyclomatic 18) · ×1
  • scheduleViewUpdate (cyclomatic 18) packages/joint-core/src/dia/Paper.mjs:1577 — scheduleViewUpdate 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 · transformToFitContent (cyclomatic 18) · ×1
  • transformToFitContent (cyclomatic 18) packages/joint-core/src/dia/Paper.mjs:2463 — transformToFitContent has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · tAtLength (cyclomatic 18) · ×1
  • tAtLength (cyclomatic 18) packages/joint-core/src/g/curve.mjs:815 — tAtLength 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 · set (cyclomatic 18) · ×1
  • set (cyclomatic 18) packages/joint-core/src/mvc/Model.mjs:86 — set 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 · utilHelpers.baseMergeDeep (cyclomatic 17) · ×1
  • utilHelpers.baseMergeDeep (cyclomatic 17) packages/joint-core/src/util/utilHelpers.mjs:1235 — utilHelpers.baseMergeDeep 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. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · utilHelpers.sortedIndex (cyclomatic 17) · ×1
  • utilHelpers.sortedIndex (cyclomatic 17) packages/joint-core/src/util/utilHelpers.mjs:2010 — utilHelpers.sortedIndex has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · utilHelpers.uniq (cyclomatic 17) · ×1
  • utilHelpers.uniq (cyclomatic 17) packages/joint-core/src/util/utilHelpers.mjs:2056 — utilHelpers.uniq has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · path.Moveto (cyclomatic 17) · ×1
  • path.Moveto (cyclomatic 17) packages/joint-core/src/g/path.mjs:1894 — path.Moveto 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 · curve.curve (cyclomatic 17) · ×1
  • curve.curve (cyclomatic 17) packages/joint-core/src/connectors/curve.mjs:21 — curve.curve has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · processEmbedding (cyclomatic 17) · ×1
  • processEmbedding (cyclomatic 17) packages/joint-core/src/dia/ElementView.mjs:397 — processEmbedding has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · set (cyclomatic 17) · ×1
  • set (cyclomatic 17) packages/joint-core/src/dia/attributes/text.mjs:93 — set has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · utilHelpers.arrayLikeKeys (cyclomatic 16) · ×1
  • utilHelpers.arrayLikeKeys (cyclomatic 16) packages/joint-core/src/util/utilHelpers.mjs:212 — utilHelpers.arrayLikeKeys 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. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · utilHelpers.intersect (cyclomatic 16) · ×1
  • utilHelpers.intersect (cyclomatic 16) packages/joint-core/src/util/utilHelpers.mjs:898 — utilHelpers.intersect has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Dom.$.event.dispatch (cyclomatic 16) · ×1
  • Dom.$.event.dispatch (cyclomatic 16) packages/joint-core/src/mvc/Dom/Dom.mjs:474 — Dom.$.event.dispatch 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 · methods.position (cyclomatic 16) · ×1
  • methods.position (cyclomatic 16) packages/joint-core/src/mvc/Dom/methods.mjs:321 — methods.position 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 · orthogonal.orthogonal (cyclomatic 16) · ×1
  • orthogonal.orthogonal (cyclomatic 16) packages/joint-core/src/routers/orthogonal.mjs:237 — orthogonal.orthogonal 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 · dev-warnings.warnUnstableSelector (cyclomatic 16) · ×1
  • dev-warnings.warnUnstableSelector (cyclomatic 16) packages/joint-react/src/utils/dev-warnings.ts:35 — dev-warnings.warnUnstableSelector has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · sanitizeGraph.sanitizeNodeAttribute (cyclomatic 16) · ×1
  • sanitizeGraph.sanitizeNodeAttribute (cyclomatic 16) packages/joint-sanitize/src/sanitizeGraph.mjs:400 — sanitizeGraph.sanitizeNodeAttribute has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _getLabelTransformationMatrix (cyclomatic 16) · ×1
  • _getLabelTransformationMatrix (cyclomatic 16) packages/joint-core/src/dia/LinkView.mjs:1237 — _getLabelTransformationMatrix 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 · replaceSegment (cyclomatic 16) · ×1
  • replaceSegment (cyclomatic 16) packages/joint-core/src/g/path.mjs:913 — replaceSegment 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 · getSubgraph (cyclomatic 16) · ×1
  • getSubgraph (cyclomatic 16) packages/joint-core/src/dia/Graph.mjs:1111 — getSubgraph has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1168, 1148, 1121, …). 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 · resize (cyclomatic 16) · ×1
  • resize (cyclomatic 16) packages/joint-core/src/dia/Element.mjs:190 — resize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · rightAnglePath (cognitive 296) · ×1
  • rightAnglePath (cognitive 296) packages/joint-core/src/alg/rightAnglePath.mjs:583 — rightAnglePath has cognitive complexity 296 (threshold 15). Drivers by points: if/else 92 (200 pts), boolean chains 92, other 2, ternaries 2 (nesting depth added 108). 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 · breakText (cognitive 162) · ×1
  • breakText (cognitive 162) REDACTED:551 — breakText has cognitive complexity 162 (threshold 15). Drivers by points: if/else 40 (115 pts), ternaries 7 (21 pts), boolean chains 19, loops 3 (7 pts) (nesting depth added 93). 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 · resolveDirection (cognitive 80) · ×1
  • resolveDirection (cognitive 80) packages/joint-core/src/routers/rightAngle.mjs:681 — resolveDirection has cognitive complexity 80 (threshold 15). Drivers by points: ternaries 16 (56 pts), if/else 14 (24 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 · manhattan.findRoute (cognitive 76) · ×1
  • manhattan.findRoute (cognitive 76) packages/joint-core/src/routers/manhattan.mjs:560 — manhattan.findRoute has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 4 (11 pts), boolean chains 8, ternaries 1 (4 pts) (nesting depth added 41). 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 · processNodeAttributes (cognitive 76) · ×1
  • processNodeAttributes (cognitive 76) packages/joint-core/src/dia/CellView.mjs:561 — processNodeAttributes has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (56 pts), boolean chains 12, loops 4 (8 pts) (nesting depth added 40). 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 · getConnectedLinks (cognitive 73) · ×1
  • getConnectedLinks (cognitive 73) packages/joint-core/src/dia/Graph.mjs:836 — getConnectedLinks has cognitive complexity 73 (threshold 15). Drivers by points: if/else 32 (59 pts), boolean chains 14 (nesting depth added 27). Most of this is not in the body itself: 8 of the 73 points are its own statements and the rest belongs to 10 function items inside it that branch (addOutbounds, addInbounds, a function literal at line 861, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · rightAngleRouter (cognitive 65) · ×1
  • rightAngleRouter (cognitive 65) packages/joint-core/src/routers/rightAngle.mjs:459 — rightAngleRouter has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 23, ternaries 5 (9 pts), other 3, loops 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 · set (cognitive 62) · ×1
  • set (cognitive 62) packages/joint-core/src/mvc/Collection.mjs:102 — set has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 9, ternaries 5 (9 pts), loops 3 (5 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 · graph-projection.graphProjection (cognitive 60) · ×1
  • graph-projection.graphProjection (cognitive 60) packages/joint-react/src/store/graph-projection.ts:54 — graph-projection.graphProjection has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 6 (13 pts), boolean chains 6, ternaries 3, match/switch 1 (2 pts) (nesting depth added 29). Most of this is not in the body itself: 3 of the 60 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 80, 139). 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 · remove (cognitive 52) · ×1
  • remove (cognitive 52) packages/joint-core/src/mvc/Dom/Dom.mjs:392 — remove has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 16, loops 3 (6 pts), ternaries 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · updateViewsBatch (cognitive 49) · ×1
  • updateViewsBatch (cognitive 49) packages/joint-core/src/dia/Paper.mjs:1919 — updateViewsBatch has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (42 pts), boolean chains 4, loops 2 (3 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 · onHandleChanging (cognitive 49) · ×1
  • onHandleChanging (cognitive 49) packages/joint-core/src/linkTools/Segments.mjs:186 — onHandleChanging has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (37 pts), ternaries 3 (7 pts), boolean chains 5 (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 · path.Path (cognitive 47) · ×1
  • path.Path (cognitive 47) packages/joint-core/src/g/path.mjs:10 — path.Path has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · updateDOMSubtreeAttributes (cognitive 45) · ×1
  • updateDOMSubtreeAttributes (cognitive 45) packages/joint-core/src/dia/CellView.mjs:966 — updateDOMSubtreeAttributes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseClone (cognitive 44) · ×1
  • baseClone (cognitive 44) packages/joint-core/src/util/utilHelpers.mjs:963 — baseClone has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 8 (17 pts), boolean chains 6 (nesting depth added 15). Of this number, 43 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · points.convexHull (cognitive 43) · ×1
  • points.convexHull (cognitive 43) packages/joint-core/src/g/points.mjs:41 — points.convexHull has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 6 (7 pts), boolean chains 3 (nesting depth added 14). Of this number, 42 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · number (cognitive 43) · ×1
  • number (cognitive 43) REDACTED:1412 — number has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 15, ternaries 9, loops 1, match/switch 1 (nesting depth added 3). Of this number, 41 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · _createPortElement (cognitive 41) · ×1
  • _createPortElement (cognitive 41) packages/joint-core/src/dia/ports.mjs:950 — _createPortElement has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (30 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · util.parseDOMJSON · ×1
  • util.parseDOMJSON::parseNode (cognitive 40) REDACTED:85 — util.parseDOMJSON::parseNode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · getNeighbors (cognitive 38) · ×1
  • getNeighbors (cognitive 38) packages/joint-core/src/dia/Graph.mjs:991 — getNeighbors has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 14 (nesting depth added 12). Of this number, 16 points are the body's own statements and 22 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 · path.Moveto (cognitive 37) · ×1
  • path.Moveto (cognitive 37) packages/joint-core/src/g/path.mjs:1894 — path.Moveto has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 3 (7 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 · updateViewsAsync (cognitive 37) · ×1
  • updateViewsAsync (cognitive 37) packages/joint-core/src/dia/Paper.mjs:1750 — updateViewsAsync has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8 (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 · pointerdown (cognitive 37) · ×1
  • pointerdown (cognitive 37) packages/joint-core/src/dia/Paper.mjs:3503 — pointerdown has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 2, ternaries 1 (2 pts) (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 · import.importNode (cognitive 36) · ×1
  • import.importNode (cognitive 36) packages/joint-layout-elk/src/import.mts:272 — import.importNode has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 24, if/else 5 (8 pts), ternaries 2 (4 pts) (nesting depth added 5). Most of this is not in the body itself: 14 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 300). 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 · add (cognitive 35) · ×1
  • add (cognitive 35) packages/joint-core/src/mvc/Dom/Dom.mjs:284 — add has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 13). Of this number, 33 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uniq (cognitive 32) · ×1
  • uniq (cognitive 32) packages/joint-core/src/util/utilHelpers.mjs:2056 — uniq has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 5 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). Of this number, 30 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · intersect (cognitive 31) · ×1
  • intersect (cognitive 31) packages/joint-core/src/util/utilHelpers.mjs:898 — intersect has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 3 (9 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 16). Of this number, 29 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dom.$.event.handlers (cognitive 30) · ×1
  • Dom.$.event.handlers (cognitive 30) packages/joint-core/src/mvc/Dom/Dom.mjs:537 — Dom.$.event.handlers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · orthogonal.orthogonal (cognitive 30) · ×1
  • orthogonal.orthogonal (cognitive 30) packages/joint-core/src/routers/orthogonal.mjs:237 — orthogonal.orthogonal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.boundaryIntersection (cognitive 30) · ×1
  • index.boundaryIntersection (cognitive 30) packages/joint-core/src/connectionPoints/index.mjs:152 — index.boundaryIntersection has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 3, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · updateRelativeAttributes (cognitive 30) · ×1
  • updateRelativeAttributes (cognitive 30) packages/joint-core/src/dia/CellView.mjs:660 — updateRelativeAttributes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, 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 · tAtLength (cognitive 30) · ×1
  • tAtLength (cognitive 30) packages/joint-core/src/g/curve.mjs:815 — tAtLength has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 7 (11 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _snapArrowhead (cognitive 29) · ×1
  • _snapArrowhead (cognitive 29) packages/joint-core/src/dia/LinkView.mjs:1696 — _snapArrowhead has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 10, ternaries 3 (nesting depth added 5). Of this number, 26 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 · closestPointT (cognitive 28) · ×1
  • closestPointT (cognitive 28) packages/joint-core/src/g/curve.mjs:310 — closestPointT has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 4 (7 pts), boolean chains 5, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · prop (cognitive 28) · ×1
  • prop (cognitive 28) packages/joint-core/src/dia/Cell.mjs:560 — prop has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (8 pts), boolean chains 4, loops 2 (4 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 · offApi (cognitive 28) · ×1
  • offApi (cognitive 28) packages/joint-core/src/mvc/Events.mjs:156 — offApi has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 pts), boolean chains 4, 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 · divideAtLength (cognitive 27) · ×1
  • divideAtLength (cognitive 27) packages/joint-core/src/g/path.mjs:394 — divideAtLength has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (10 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseIsMatch (cognitive 27) · ×1
  • baseIsMatch (cognitive 27) packages/joint-core/src/util/utilHelpers.mjs:1448 — baseIsMatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 2 (7 pts), boolean chains 3, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · set (cognitive 27) · ×1
  • set (cognitive 27) packages/joint-core/src/dia/attributes/text.mjs:93 — set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · use-create-features.useCreateFeature (cognitive 26) · ×1
  • use-create-features.useCreateFeature (cognitive 26) packages/joint-react/src/hooks/use-create-features.ts:252 — use-create-features.useCreateFeature has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 340, a function literal at line 270, a function literal at line 395, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · code-controlled-mode-peerjs.Main (cognitive 26) · ×1
  • code-controlled-mode-peerjs.Main (cognitive 26) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:311 — code-controlled-mode-peerjs.Main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 4 (6 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 404, a function literal at line 391, handleCopyId, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · debounce (cognitive 26) · ×1
  • debounce (cognitive 26) packages/joint-core/src/util/utilHelpers.mjs:2179 — debounce has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 5 (7 pts), boolean chains 6 (nesting depth added 4). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 12 function items inside it that branch (debounced, shouldInvoke, trailingEdge, …). 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 · findNodesAttributes (cognitive 26) · ×1
  • findNodesAttributes (cognitive 26) packages/joint-core/src/dia/CellView.mjs:889 — findNodesAttributes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts), ternaries 1 (4 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 · curve (cognitive 26) · ×1
  • curve (cognitive 26) packages/joint-core/src/connectors/curve.mjs:21 — curve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 5 (7 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · set (cognitive 26) · ×1
  • set (cognitive 26) packages/joint-core/src/mvc/Model.mjs:86 — set has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 3 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dom.$.event.dispatch (cognitive 25) · ×1
  • Dom.$.event.dispatch (cognitive 25) packages/joint-core/src/mvc/Dom/Dom.mjs:474 — Dom.$.event.dispatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, 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 · index.getMiddleSide (cognitive 25) · ×1
  • index.getMiddleSide (cognitive 25) packages/joint-core/src/anchors/index.mjs:34 — index.getMiddleSide has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · equalObjects (cognitive 25) · ×1
  • equalObjects (cognitive 25) packages/joint-core/src/util/utilHelpers.mjs:489 — equalObjects has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (9 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · equalArrays (cognitive 25) · ×1
  • equalArrays (cognitive 25) packages/joint-core/src/util/utilHelpers.mjs:600 — equalArrays has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 9). Of this number, 19 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bboxWrapper (cognitive 25) · ×1
  • bboxWrapper (cognitive 25) packages/joint-core/src/anchors/index.mjs:95 — bboxWrapper has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 97). 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 · path.Curveto (cognitive 24) · ×1
  • path.Curveto (cognitive 24) packages/joint-core/src/g/path.mjs:1723 — path.Curveto has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · use-cells.useCells (cognitive 24) · ×1
  • use-cells.useCells (cognitive 24) packages/joint-react/src/hooks/use-cells.ts:256 — use-cells.useCells has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 4, loops 1 (2 pts) (nesting depth added 1). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 375, 325, 361, …). 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 · sanitizeGraph.sanitizeNodeAttribute (cognitive 24) · ×1
  • sanitizeGraph.sanitizeNodeAttribute (cognitive 24) packages/joint-sanitize/src/sanitizeGraph.mjs:400 — sanitizeGraph.sanitizeNodeAttribute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). Of this number, 21 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizeWheel (cognitive 24) · ×1
  • normalizeWheel (cognitive 24) REDACTED:340 — normalizeWheel has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, ternaries 4 (6 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · utilHelpers.baseMergeDeep (cognitive 23) · ×1
  • utilHelpers.baseMergeDeep (cognitive 23) packages/joint-core/src/util/utilHelpers.mjs:1235 — utilHelpers.baseMergeDeep has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, 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 · path.Lineto (cognitive 23) · ×1
  • path.Lineto (cognitive 23) packages/joint-core/src/g/path.mjs:1579 — path.Lineto has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · props.attr (cognitive 23) · ×1
  • props.attr (cognitive 23) packages/joint-core/src/mvc/Dom/props.mjs:32 — props.attr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 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 · curve.createCatmullRomCurves (cognitive 23) · ×1
  • curve.createCatmullRomCurves (cognitive 23) packages/joint-core/src/connectors/curve.mjs:460 — curve.createCatmullRomCurves has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 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 · index.bboxWrapper.<returned closure> (cognitive 23) · ×1
  • index.bboxWrapper.<returned closure> (cognitive 23) packages/joint-core/src/anchors/index.mjs:97 — index.bboxWrapper.<returned closure> has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, 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 · parser.build (cognitive 23) · ×1
  • parser.build (cognitive 23) packages/joint-decorators/src/parser.ts:61 — parser.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (23 pts) (nesting depth added 7). Of this number, 17 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cell-record-merge.mergeCellRecord (cognitive 23) · ×1
  • cell-record-merge.mergeCellRecord (cognitive 23) packages/joint-react/src/state/data-mapping/cell-record-merge.ts:23 — cell-record-merge.mergeCellRecord has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · use-create-portal-paper.useCreatePortalPaper (cognitive 23) · ×1
  • use-create-portal-paper.useCreatePortalPaper (cognitive 23) packages/joint-react/src/hooks/use-create-portal-paper.tsx:186 — use-create-portal-paper.useCreatePortalPaper has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 223, 382, 313, …). 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 · confirmUpdate (cognitive 23) · ×1
  • confirmUpdate (cognitive 23) packages/joint-core/src/dia/ElementView.mjs:71 — confirmUpdate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (23 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 · manhattan.router (cognitive 22) · ×1
  • manhattan.router (cognitive 22) packages/joint-core/src/routers/manhattan.mjs:774 — manhattan.router has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 1 (4 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 · rightAngle.resolveForTopSourceSide (cognitive 22) · ×1
  • rightAngle.resolveForTopSourceSide (cognitive 22) packages/joint-core/src/routers/rightAngle.mjs:125 — rightAngle.resolveForTopSourceSide has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForBottomSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · rightAngle.resolveForBottomSourceSide (cognitive 22) · ×1
  • rightAngle.resolveForBottomSourceSide (cognitive 22) packages/joint-core/src/routers/rightAngle.mjs:163 — rightAngle.resolveForBottomSourceSide has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForTopSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · _getLabelTransformationMatrix (cognitive 22) · ×1
  • _getLabelTransformationMatrix (cognitive 22) packages/joint-core/src/dia/LinkView.mjs:1237 — _getLabelTransformationMatrix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 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 · replaceSegment (cognitive 22) · ×1
  • replaceSegment (cognitive 22) packages/joint-core/src/g/path.mjs:913 — replaceSegment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, 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 · bbox (cognitive 22) · ×1
  • bbox (cognitive 22) packages/joint-core/src/g/curve.mjs:169 — bbox has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.applyLinkLayout (cognitive 21) · ×1
  • utils.applyLinkLayout (cognitive 21) packages/joint-layout-msagl/src/utils.mts:101 — utils.applyLinkLayout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 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 · sanitizeGraph.sanitizePorts (cognitive 21) · ×1
  • sanitizeGraph.sanitizePorts (cognitive 21) packages/joint-sanitize/src/sanitizeGraph.mjs:801 — sanitizeGraph.sanitizePorts has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 6. Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (getGroupProperty, getTargets, removeMergedLabelMarkup, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · scheduleViewUpdate (cognitive 21) · ×1
  • scheduleViewUpdate (cognitive 21) packages/joint-core/src/dia/Paper.mjs:1577 — scheduleViewUpdate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 1 (2 pts), ternaries 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.
D2 · Cognitive Complexity · getFitToContentArea (cognitive 21) · ×1
  • getFitToContentArea (cognitive 21) packages/joint-core/src/dia/Paper.mjs:2395 — getFitToContentArea has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 17, if/else 3, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · pointAtLength (cognitive 21) · ×1
  • pointAtLength (cognitive 21) packages/joint-core/src/g/path.mjs:790 — pointAtLength has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 6 (9 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseIsEqualDeep (cognitive 21) · ×1
  • baseIsEqualDeep (cognitive 21) packages/joint-core/src/util/utilHelpers.mjs:561 — baseIsEqualDeep has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 8, if/else 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.
D2 · Cognitive Complexity · compareAscending (cognitive 21) · ×1
  • compareAscending (cognitive 21) packages/joint-core/src/util/utilHelpers.mjs:804 — compareAscending has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 16, if/else 3 (5 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 · containsPoint (cognitive 21) · ×1
  • containsPoint (cognitive 21) packages/joint-core/src/g/polyline.mjs:129 — containsPoint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, ternaries 1 (3 pts), 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 · intersectionWithLine (cognitive 21) · ×1
  • intersectionWithLine (cognitive 21) packages/joint-core/src/g/ellipse.mjs:93 — intersectionWithLine has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6 (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 · jumpover.buildPath (cognitive 20) · ×1
  • jumpover.buildPath (cognitive 20) packages/joint-core/src/connectors/jumpover.mjs:225 — jumpover.buildPath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 235). 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 · confirmUpdate (cognitive 20) · ×1
  • confirmUpdate (cognitive 20) packages/joint-core/src/dia/LinkView.mjs:80 — confirmUpdate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5 (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 · tangentAtLength (cognitive 20) · ×1
  • tangentAtLength (cognitive 20) packages/joint-core/src/g/path.mjs:1102 — tangentAtLength has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · processEmbedding (cognitive 20) · ×1
  • processEmbedding (cognitive 20) packages/joint-core/src/dia/ElementView.mjs:397 — processEmbedding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (nesting depth added 3). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · jumpover.jumpover (cognitive 19) · ×1
  • jumpover.jumpover (cognitive 19) packages/joint-core/src/connectors/jumpover.mjs:340 — jumpover.jumpover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 420, 372, 401, …). 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 · set (cognitive 19) · ×1
  • set (cognitive 19) packages/joint-core/src/util/utilHelpers.mjs:1060 — set has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (8 pts), boolean chains 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 · checkMouseleave (cognitive 19) · ×1
  • checkMouseleave (cognitive 19) packages/joint-core/src/dia/CellView.mjs:1349 — checkMouseleave has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 pts) (nesting depth added 11). 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 · getSubdivisions (cognitive 19) · ×1
  • getSubdivisions (cognitive 19) packages/joint-core/src/g/curve.mjs:565 — getSubdivisions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), ternaries 2 (4 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 · toGraphLib (cognitive 19) · ×1
  • toGraphLib (cognitive 19) packages/joint-layout-directed-graph/DirectedGraph.mjs:259 — toGraphLib has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 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 · highlight (cognitive 19) · ×1
  • highlight (cognitive 19) packages/joint-core/src/highlighters/list.mjs:27 — highlight has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 6 (8 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 40, 37, 38). 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 · animations.animateNode (cognitive 18) · ×1
  • animations.animateNode (cognitive 18) packages/joint-core/src/mvc/Dom/animations.mjs:24 — animations.animateNode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 29, 66, 82). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · rightAngle.resolveForLeftSourceSide (cognitive 18) · ×1
  • rightAngle.resolveForLeftSourceSide (cognitive 18) packages/joint-core/src/routers/rightAngle.mjs:201 — rightAngle.resolveForLeftSourceSide has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (rightAngle.resolveForRightSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · rightAngle.resolveForRightSourceSide (cognitive 18) · ×1
  • rightAngle.resolveForRightSourceSide (cognitive 18) packages/joint-core/src/routers/rightAngle.mjs:235 — rightAngle.resolveForRightSourceSide has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (rightAngle.resolveForLeftSourceSide) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · diff (cognitive 18) · ×1
  • diff (cognitive 18) packages/joint-core/src/util/utilHelpers.mjs:856 — diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). Of this number, 16 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · getSubgraph (cognitive 18) · ×1
  • getSubgraph (cognitive 18) packages/joint-core/src/dia/Graph.mjs:1111 — getSubgraph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 1121, 1134, 1148, …). 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 · resolveSides (cognitive 18) · ×1
  • resolveSides (cognitive 18) packages/joint-core/src/routers/rightAngle.mjs:84 — resolveSides has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, ternaries 4 (8 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, 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 · position (cognitive 18) · ×1
  • position (cognitive 18) packages/joint-core/src/dia/Element.mjs:38 — position has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 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 · resize (cognitive 18) · ×1
  • resize (cognitive 18) packages/joint-core/src/dia/Element.mjs:190 — resize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tangentAtLength (cognitive 18) · ×1
  • tangentAtLength (cognitive 18) packages/joint-core/src/g/polyline.mjs:411 — tangentAtLength has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (8 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 · utilHelpers.sortedIndex (cognitive 17) · ×1
  • utilHelpers.sortedIndex (cognitive 17) packages/joint-core/src/util/utilHelpers.mjs:2010 — utilHelpers.sortedIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · util.flattenObject (cognitive 17) · ×1
  • util.flattenObject (cognitive 17) REDACTED:251 — util.flattenObject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · straight.straight (cognitive 17) · ×1
  • straight.straight (cognitive 17) packages/joint-core/src/connectors/straight.mjs:15 — straight.straight has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (2 pts), 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 · graph-projection.graphProjection.updateGraph (cognitive 17) · ×1
  • graph-projection.graphProjection.updateGraph (cognitive 17) packages/joint-react/src/store/graph-projection.ts:216 — graph-projection.graphProjection.updateGraph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · defineMarker (cognitive 17) · ×1
  • defineMarker (cognitive 17) packages/joint-core/src/dia/Paper.mjs:4231 — defineMarker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 5). Of this number, 13 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · getAnchor (cognitive 17) · ×1
  • getAnchor (cognitive 17) packages/joint-core/src/dia/LinkView.mjs:698 — getAnchor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (2 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 · syncCells (cognitive 17) · ×1
  • syncCells (cognitive 17) packages/joint-core/src/dia/Graph.mjs:419 — syncCells has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 6). Of this number, 14 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · isSafeAttribute (cognitive 17) · ×1
  • isSafeAttribute (cognitive 17) packages/joint-sanitize/src/security.mjs:266 — isSafeAttribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · mount (cognitive 17) · ×1
  • mount (cognitive 17) packages/joint-core/src/dia/HighlighterView.mjs:99 — mount has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · evalCalcExpression (cognitive 17) · ×1
  • evalCalcExpression (cognitive 17) packages/joint-core/src/util/calc.mjs:103 — evalCalcExpression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), match/switch 1 (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 · Dom.$.event.on (cognitive 16) · ×1
  • Dom.$.event.on (cognitive 16) packages/joint-core/src/mvc/Dom/Dom.mjs:233 — Dom.$.event.on has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · export.buildElkNode (cognitive 16) · ×1
  • export.buildElkNode (cognitive 16) packages/joint-layout-elk/src/export.mts:319 — export.buildElkNode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3, 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 · dev-warnings.warnUnstableSelector (cognitive 16) · ×1
  • dev-warnings.warnUnstableSelector (cognitive 16) packages/joint-react/src/utils/dev-warnings.ts:35 — dev-warnings.warnUnstableSelector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · resolveHighlighter (cognitive 16) · ×1
  • resolveHighlighter (cognitive 16) packages/joint-core/src/dia/Paper.mjs:3348 — resolveHighlighter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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 · drawBackgroundImage (cognitive 16) · ×1
  • drawBackgroundImage (cognitive 16) packages/joint-core/src/dia/Paper.mjs:4025 — drawBackgroundImage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · insertSegment (cognitive 16) · ×1
  • insertSegment (cognitive 16) packages/joint-core/src/g/path.mjs:606 — insertSegment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compareMultiple (cognitive 16) · ×1
  • compareMultiple (cognitive 16) packages/joint-core/src/util/utilHelpers.mjs:834 — compareMultiple has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · translate (cognitive 16) · ×1
  • translate (cognitive 16) packages/joint-core/src/dia/Element.mjs:84 — translate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7 (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 · reparent (cognitive 16) · ×1
  • reparent (cognitive 16) packages/joint-core/src/dia/Link.mjs:469 — reparent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 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 · get (cognitive 16) · ×1
  • get (cognitive 16) packages/joint-core/src/dia/HighlighterView.mjs:239 — get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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 · _resolveDrawGridOption (cognitive 16) · ×1
  • _resolveDrawGridOption (cognitive 16) packages/joint-core/src/dia/GridLayerView.mjs:151 — _resolveDrawGridOption has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D3 · God Classes · ClassTooLong · ×1
  • ClassTooLong: rightAnglePath packages/joint-core/src/alg/rightAnglePath.mjs:1 — ClassTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 103 over it, 1.26× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D3 · God Classes · TooManyMethods · ×1
  • TooManyMethods: RouterService packages/joint-router-avoid/src/RouterService.mts:189 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D35 · Change Coupling · Change-coupling hub · ×1
  • Change-coupling hub: joint.d.ts → ElementView.mjs, HighlighterView.mjs, ToolsView.mjs packages/joint-core/types/joint.d.ts — `packages/joint-core/types/joint.d.ts` changes together with 3 other files — `packages/joint-core/src/dia/ElementView.mjs`, `packages/joint-core/src/dia/HighlighterView.mjs`, `packages/joint-core/src/dia/ToolsView.mjs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: PaperView (LCOM4 4) packages/joint-react/src/mvc/paper.ts:23 — PaperView's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
P12 · CI test-gate honesty · Workspace package's tests never run by CI · ×1
  • Workspace package's tests never run by CI packages/joint-core/package.json:70 — `packages/joint-core` is a workspace package with 8 test(s) in 8 file(s) (e.g. `packages/joint-core/test/ts/geometry.test.ts`, `packages/joint-core/test/ts/index.test.ts`), but no CI command runs them — no step names the package and no workspace-wide command reaches it, so its tests gate nothing. Run its tests in CI, or delete them.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 299 typed · 242 plain JS — the untyped files are packages/joint-core/grunt/config/aliases.js, packages/joint-core/grunt/config/clean.js, packages/joint-core/grunt/config/concat.js, packages/joint-core/grunt/config/copy.js, packages/joint-core/grunt/config/karma.js, packages/joint-core/grunt/config/qunit.js (+236 more).
R10 · Code Duplication · Duplication concentrated across 6 sibling directories (9 clone groups) · ×1
  • Duplication concentrated across 6 sibling directories (9 clone groups) packages/joint-layout-directed-graph/karma.conf.js:39 — 9 duplicated blocks under packages/ have copies in at least two of the sibling directories joint-core, joint-layout-directed-graph, joint-layout-elk, joint-layout-msagl, joint-router-avoid, joint-sanitize — 3 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 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 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 9 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 (8 clone groups) · ×1
  • Duplication concentrated across 11 sibling directories (8 clone groups) packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11 — 8 duplicated blocks under packages/joint-shapes-general/src/ have copies in at least two of the sibling directories arrow, card, cube, document, hexagon, note (+5 more sibling(s) not listed) — 6 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 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 5 sibling directories (5 clone groups) · ×1
  • Duplication concentrated across 5 sibling directories (5 clone groups) packages/joint-core/src/cellTools/Control.mjs:140 — 5 duplicated blocks under packages/joint-core/src/ have copies in at least two of the sibling directories anchors, cellTools, dia, linkTools, mvc — 2 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 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 with local edits (60 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (60 matched lines × 2 locations) packages/joint-core/src/g/bezier.mjs:27 — packages/joint-core/src/g/bezier.mjs:27 · packages/joint-core/src/g/curve.mjs:43 — the two spans are one implementation copied and then locally edited — 629 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) packages/joint-core/src/alg/rightAnglePath.mjs:37 — packages/joint-core/src/alg/rightAnglePath.mjs:37 · packages/joint-core/src/alg/rightAnglePath.mjs:87 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (41 lines × 2 locations) · ×1
  • Duplicated block (41 lines × 2 locations) packages/joint-core/src/connectors/curve.mjs:261 — packages/joint-core/src/connectors/curve.mjs:261 · packages/joint-core/src/connectors/curve.mjs:303 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (40 lines × 2 locations) · ×1
  • Duplicated block (40 lines × 2 locations) packages/joint-core/src/dia/Link.mjs:88 — packages/joint-core/src/dia/Link.mjs:88 · packages/joint-core/src/dia/Link.mjs:129 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (39 lines × 2 locations) · ×1
  • Duplicated block (39 lines × 2 locations) packages/joint-core/src/connectors/curve.mjs:100 — packages/joint-core/src/connectors/curve.mjs:100 · packages/joint-core/src/connectors/curve.mjs:140 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (38 lines × 2 locations) · ×1
  • Duplicated block (38 lines × 2 locations) packages/joint-core/src/g/path.mjs:269 — packages/joint-core/src/g/path.mjs:269 · packages/joint-core/src/g/path.mjs:308 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (36 lines × 2 locations) · ×1
  • Duplicated block (36 lines × 2 locations) packages/joint-core/src/connectors/curve.mjs:366 — packages/joint-core/src/connectors/curve.mjs:366 · packages/joint-core/src/connectors/curve.mjs:403 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (34 lines × 2 locations) · ×1
  • Duplicated block (34 lines × 2 locations) packages/joint-core/src/alg/rightAnglePath.mjs:703 — packages/joint-core/src/alg/rightAnglePath.mjs:703 · packages/joint-core/src/alg/rightAnglePath.mjs:803 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block with local edits (32 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (32 matched lines × 2 locations) packages/joint-router-avoid/src/providers/MainThreadProvider.mts:132 — packages/joint-router-avoid/src/providers/MainThreadProvider.mts:132 · packages/joint-router-avoid/src/providers/Worker.mts:289 — the two spans are one implementation copied and then locally edited — 177 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 (30 lines × 3 locations) · ×1
  • Duplicated block (30 lines × 3 locations) packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:50 — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:50 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:55 — the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (30 matched lines × 2 locations) packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts:5 — packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts:5 · packages/joint-shapes-general-tools/src/TableDividerTool.ts:5 — the two spans are one implementation copied and then locally edited — 217 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 (26 lines × 2 locations) · ×1
  • Duplicated block (26 lines × 2 locations) packages/joint-core/src/dia/Paper.mjs:3682 — packages/joint-core/src/dia/Paper.mjs:3682 · packages/joint-core/src/dia/Paper.mjs:3716 — 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 (24 lines × 2 locations) · ×1
  • Duplicated block (24 lines × 2 locations) packages/joint-router-avoid/src/providers/MainThreadProvider.mts:272 — packages/joint-router-avoid/src/providers/MainThreadProvider.mts:272 · packages/joint-router-avoid/src/providers/Worker.mts:184 — 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 (20 lines × 2 locations) · ×1
  • Duplicated block (20 lines × 2 locations) packages/joint-shapes-general-tools/src/NoteOffsetControl.ts:29 — packages/joint-shapes-general-tools/src/NoteOffsetControl.ts:29 · packages/joint-shapes-general-tools/src/PlusOffsetControl.ts:29 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (19 lines × 3 locations) · ×1
  • Duplicated block (19 lines × 3 locations) packages/joint-core/src/g/path.mjs:373 — packages/joint-core/src/g/path.mjs:373 · packages/joint-core/src/g/path.mjs:1010 · packages/joint-core/src/g/path.mjs:1080 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
R10 · Code Duplication · Duplicated block (17 lines × 2 locations) · ×1
  • Duplicated block (17 lines × 2 locations) packages/joint-core/src/alg/rightAnglePath.mjs:753 — packages/joint-core/src/alg/rightAnglePath.mjs:753 · packages/joint-core/src/alg/rightAnglePath.mjs:853 — 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 rightAnglePath (cyclomatic 193, cognitive 296) · ×1
  • Complex function rightAnglePath (cyclomatic 193, cognitive 296) packages/joint-core/src/alg/rightAnglePath.mjs:583 — rightAnglePath has cyclomatic complexity 193 and cognitive complexity 296; 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 breakText (cyclomatic 64, cognitive 162) · ×1
  • Complex function breakText (cyclomatic 64, cognitive 162) REDACTED:551 — breakText has cyclomatic complexity 64 and cognitive complexity 162; 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 text (cyclomatic 55, cognitive 110) · ×1
  • Complex function text (cyclomatic 55, cognitive 110) REDACTED:487 — text has cyclomatic complexity 55 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function number (cyclomatic 48, cognitive 41) · ×1
  • Complex function number (cyclomatic 48, cognitive 41) REDACTED:1412 — number has cyclomatic complexity 48 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 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 rightAngleRouter (cyclomatic 47, cognitive 65) · ×1
  • Complex function rightAngleRouter (cyclomatic 47, cognitive 65) packages/joint-core/src/routers/rightAngle.mjs:459 — rightAngleRouter has cyclomatic complexity 47 and cognitive complexity 65; 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 set (cyclomatic 41, cognitive 62) · ×1
  • Complex function set (cyclomatic 41, cognitive 62) packages/joint-core/src/mvc/Collection.mjs:102 — set has cyclomatic complexity 41 and cognitive complexity 62; 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 remove (cyclomatic 35, cognitive 52) · ×1
  • Complex function remove (cyclomatic 35, cognitive 52) packages/joint-core/src/mvc/Dom/Dom.mjs:392 — remove has cyclomatic complexity 35 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 processNodeAttributes (cyclomatic 33, cognitive 76) · ×1
  • Complex function processNodeAttributes (cyclomatic 33, cognitive 76) packages/joint-core/src/dia/CellView.mjs:561 — processNodeAttributes has cyclomatic complexity 33 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 exists (cyclomatic 33, cognitive 14) · ×1
  • Complex function exists (cyclomatic 33, cognitive 14) packages/joint-core/src/g/intersection.mjs:6 — exists has cyclomatic complexity 33 and cognitive complexity 14; 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 compareAscending (cyclomatic 32, cognitive 21) · ×1
  • Complex function compareAscending (cyclomatic 32, cognitive 21) packages/joint-core/src/util/utilHelpers.mjs:804 — compareAscending has cyclomatic complexity 32 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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 findRoute (cyclomatic 31, cognitive 75) · ×1
  • Complex function findRoute (cyclomatic 31, cognitive 75) packages/joint-core/src/routers/manhattan.mjs:560 — findRoute has cyclomatic complexity 31 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function onChanges (cyclomatic 31, cognitive 56) · ×1
  • Complex function onChanges (cyclomatic 31, cognitive 56) packages/joint-react/src/store/graph-projection.ts:80 — onChanges 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 onHandleChanging (cyclomatic 30, cognitive 49) · ×1
  • Complex function onHandleChanging (cyclomatic 30, cognitive 49) packages/joint-core/src/linkTools/Segments.mjs:186 — onHandleChanging has cyclomatic complexity 30 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 resolveDirection (cyclomatic 28, cognitive 80) · ×1
  • Complex function resolveDirection (cyclomatic 28, cognitive 80) packages/joint-core/src/routers/rightAngle.mjs:681 — resolveDirection has cyclomatic complexity 28 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function baseClone (cyclomatic 28, cognitive 43) · ×1
  • Complex function baseClone (cyclomatic 28, cognitive 43) packages/joint-core/src/util/utilHelpers.mjs:963 — baseClone has cyclomatic complexity 28 and cognitive complexity 43; 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 convexHull (cyclomatic 26, cognitive 42) · ×1
  • Complex function convexHull (cyclomatic 26, cognitive 42) packages/joint-core/src/g/points.mjs:41 — convexHull has cyclomatic complexity 26 and cognitive complexity 42; 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 parseTransformString (cyclomatic 25, cognitive 38) · ×1
  • Complex function parseTransformString (cyclomatic 25, cognitive 38) REDACTED:1546 — parseTransformString has cyclomatic complexity 25 and cognitive complexity 38; 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 toGeometryShape (cyclomatic 25, cognitive 20) · ×1
  • Complex function toGeometryShape (cyclomatic 25, cognitive 20) REDACTED:1134 — toGeometryShape has cyclomatic complexity 25 and cognitive complexity 20; 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 Path (cyclomatic 24, cognitive 47) · ×1
  • Complex function Path (cyclomatic 24, cognitive 47) packages/joint-core/src/g/path.mjs:10 — Path has cyclomatic complexity 24 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 updateDOMSubtreeAttributes (cyclomatic 24, cognitive 45) · ×1
  • Complex function updateDOMSubtreeAttributes (cyclomatic 24, cognitive 45) packages/joint-core/src/dia/CellView.mjs:966 — updateDOMSubtreeAttributes has cyclomatic complexity 24 and cognitive complexity 45; 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 _createPortElement (cyclomatic 24, cognitive 41) · ×1
  • Complex function _createPortElement (cyclomatic 24, cognitive 41) packages/joint-core/src/dia/ports.mjs:950 — _createPortElement has cyclomatic complexity 24 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 updateRelativeAttributes (cyclomatic 24, cognitive 30) · ×1
  • Complex function updateRelativeAttributes (cyclomatic 24, cognitive 30) packages/joint-core/src/dia/CellView.mjs:660 — updateRelativeAttributes has cyclomatic complexity 24 and cognitive complexity 30; 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 add (cyclomatic 23, cognitive 33) · ×1
  • Complex function add (cyclomatic 23, cognitive 33) packages/joint-core/src/mvc/Dom/Dom.mjs:284 — add has cyclomatic complexity 23 and cognitive complexity 33; 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 boundaryIntersection (cyclomatic 23, cognitive 30) · ×1
  • Complex function boundaryIntersection (cyclomatic 23, cognitive 30) packages/joint-core/src/connectionPoints/index.mjs:152 — boundaryIntersection has cyclomatic complexity 23 and cognitive complexity 30; 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 updateViewsAsync (cyclomatic 22, cognitive 37) · ×1
  • Complex function updateViewsAsync (cyclomatic 22, cognitive 37) packages/joint-core/src/dia/Paper.mjs:1750 — updateViewsAsync has cyclomatic complexity 22 and cognitive complexity 37; 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 getMiddleSide (cyclomatic 22, cognitive 25) · ×1
  • Complex function getMiddleSide (cyclomatic 22, cognitive 25) packages/joint-core/src/anchors/index.mjs:34 — getMiddleSide has cyclomatic complexity 22 and cognitive complexity 25; 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 normalizeWheel (cyclomatic 22, cognitive 24) · ×1
  • Complex function normalizeWheel (cyclomatic 22, cognitive 24) REDACTED:340 — normalizeWheel has cyclomatic complexity 22 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 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 getFitToContentArea (cyclomatic 22, cognitive 21) · ×1
  • Complex function getFitToContentArea (cyclomatic 22, cognitive 21) packages/joint-core/src/dia/Paper.mjs:2395 — getFitToContentArea has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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 pathToAbsolute (cyclomatic 21, cognitive 35) · ×1
  • Complex function pathToAbsolute (cyclomatic 21, cognitive 35) REDACTED:2312 — pathToAbsolute has cyclomatic complexity 21 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 _snapArrowhead (cyclomatic 21, cognitive 26) · ×1
  • Complex function _snapArrowhead (cyclomatic 21, cognitive 26) packages/joint-core/src/dia/LinkView.mjs:1696 — _snapArrowhead has cyclomatic complexity 21 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 equalObjects (cyclomatic 21, cognitive 25) · ×1
  • Complex function equalObjects (cyclomatic 21, cognitive 25) packages/joint-core/src/util/utilHelpers.mjs:489 — equalObjects has cyclomatic complexity 21 and cognitive complexity 25; 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 resolveForTopSourceSide (cyclomatic 21, cognitive 22) · ×1
  • Complex function resolveForTopSourceSide (cyclomatic 21, cognitive 22) packages/joint-core/src/routers/rightAngle.mjs:125 — resolveForTopSourceSide has cyclomatic complexity 21 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 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 resolveForBottomSourceSide (cyclomatic 21, cognitive 22) · ×1
  • Complex function resolveForBottomSourceSide (cyclomatic 21, cognitive 22) packages/joint-core/src/routers/rightAngle.mjs:163 — resolveForBottomSourceSide has cyclomatic complexity 21 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 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 updateViewsBatch (cyclomatic 20, cognitive 49) · ×1
  • Complex function updateViewsBatch (cyclomatic 20, cognitive 49) packages/joint-core/src/dia/Paper.mjs:1919 — updateViewsBatch has cyclomatic complexity 20 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 a2c (cyclomatic 20, cognitive 34) · ×1
  • Complex function a2c (cyclomatic 20, cognitive 34) REDACTED:2183 — a2c has cyclomatic complexity 20 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 pointerdown (cyclomatic 19, cognitive 37) · ×1
  • Complex function pointerdown (cyclomatic 19, cognitive 37) packages/joint-core/src/dia/Paper.mjs:3503 — pointerdown has cyclomatic complexity 19 and cognitive complexity 37; 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 annotateTextLine (cyclomatic 19, cognitive 34) · ×1
  • Complex function annotateTextLine (cyclomatic 19, cognitive 34) REDACTED:401 — annotateTextLine has cyclomatic complexity 19 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 annotateString (cyclomatic 19, cognitive 33) · ×1
  • Complex function annotateString (cyclomatic 19, cognitive 33) REDACTED:1873 — annotateString has cyclomatic complexity 19 and cognitive complexity 33; 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 closestPointT (cyclomatic 19, cognitive 28) · ×1
  • Complex function closestPointT (cyclomatic 19, cognitive 28) packages/joint-core/src/g/curve.mjs:310 — closestPointT has cyclomatic complexity 19 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 divideAtLength (cyclomatic 19, cognitive 27) · ×1
  • Complex function divideAtLength (cyclomatic 19, cognitive 27) packages/joint-core/src/g/path.mjs:394 — divideAtLength has cyclomatic complexity 19 and cognitive complexity 27; 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 · packages/joint-core/src/dia/Paper.mjs · ×1
  • packages/joint-core/src/dia/Paper.mjs: 3721 lines of code packages/joint-core/src/dia/Paper.mjs:1 — packages/joint-core/src/dia/Paper.mjs has 3721 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 · packages/joint-core/src/util/utilHelpers.mjs · ×1
  • packages/joint-core/src/util/utilHelpers.mjs: 2087 lines of code packages/joint-core/src/util/utilHelpers.mjs:1 — packages/joint-core/src/util/utilHelpers.mjs has 2087 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 2078 lines of code REDACTED:1 — REDACTED has 2078 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 · packages/joint-core/src/dia/LinkView.mjs · ×1
  • packages/joint-core/src/dia/LinkView.mjs: 1723 lines of code packages/joint-core/src/dia/LinkView.mjs:1 — packages/joint-core/src/dia/LinkView.mjs has 1723 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 · packages/joint-core/src/g/path.mjs · ×1
  • packages/joint-core/src/g/path.mjs: 1631 lines of code packages/joint-core/src/g/path.mjs:1 — packages/joint-core/src/g/path.mjs has 1631 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 1445 lines of code REDACTED:1 — REDACTED has 1445 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 · packages/joint-core/src/dia/Graph.mjs · ×1
  • packages/joint-core/src/dia/Graph.mjs: 1322 lines of code packages/joint-core/src/dia/Graph.mjs:1 — packages/joint-core/src/dia/Graph.mjs has 1322 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 · packages/joint-core/src/dia/CellView.mjs · ×1
  • packages/joint-core/src/dia/CellView.mjs: 1214 lines of code packages/joint-core/src/dia/CellView.mjs:1 — packages/joint-core/src/dia/CellView.mjs has 1214 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 · packages/joint-core/src/alg/rightAnglePath.mjs · ×1
  • packages/joint-core/src/alg/rightAnglePath.mjs: 1169 lines of code packages/joint-core/src/alg/rightAnglePath.mjs:1 — packages/joint-core/src/alg/rightAnglePath.mjs 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 · packages/joint-core/src/dia/ports.mjs · ×1
  • packages/joint-core/src/dia/ports.mjs: 932 lines of code packages/joint-core/src/dia/ports.mjs:1 — packages/joint-core/src/dia/ports.mjs has 932 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 · packages/joint-sanitize/src/sanitizeGraph.mjs · ×1
  • packages/joint-sanitize/src/sanitizeGraph.mjs: 894 lines of code packages/joint-sanitize/src/sanitizeGraph.mjs:1 — packages/joint-sanitize/src/sanitizeGraph.mjs has 894 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 · packages/joint-core/src/dia/Cell.mjs · ×1
  • packages/joint-core/src/dia/Cell.mjs: 771 lines of code packages/joint-core/src/dia/Cell.mjs:1 — packages/joint-core/src/dia/Cell.mjs has 771 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 · packages/joint-core/src/shapes/standard.mjs · ×1
  • packages/joint-core/src/shapes/standard.mjs: 728 lines of code packages/joint-core/src/shapes/standard.mjs:1 — packages/joint-core/src/shapes/standard.mjs has 728 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 · packages/joint-core/src/g/curve.mjs · ×1
  • packages/joint-core/src/g/curve.mjs: 720 lines of code packages/joint-core/src/g/curve.mjs:1 — packages/joint-core/src/g/curve.mjs has 720 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 · packages/joint-core/src/dia/ElementView.mjs · ×1
  • packages/joint-core/src/dia/ElementView.mjs: 696 lines of code packages/joint-core/src/dia/ElementView.mjs:1 — packages/joint-core/src/dia/ElementView.mjs has 696 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 · packages/joint-core/src/routers/manhattan.mjs · ×1
  • packages/joint-core/src/routers/manhattan.mjs: 637 lines of code packages/joint-core/src/routers/manhattan.mjs:1 — packages/joint-core/src/routers/manhattan.mjs has 637 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 · packages/joint-react/src/presets/paper-events.ts · ×1
  • packages/joint-react/src/presets/paper-events.ts: 634 lines of code packages/joint-react/src/presets/paper-events.ts:1 — packages/joint-react/src/presets/paper-events.ts has 634 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 · packages/joint-core/src/routers/rightAngle.mjs · ×1
  • packages/joint-core/src/routers/rightAngle.mjs: 611 lines of code packages/joint-core/src/routers/rightAngle.mjs:1 — packages/joint-core/src/routers/rightAngle.mjs has 611 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 · packages/joint-core/src/mvc/Dom/Dom.mjs · ×1
  • packages/joint-core/src/mvc/Dom/Dom.mjs: 527 lines of code packages/joint-core/src/mvc/Dom/Dom.mjs:1 — packages/joint-core/src/mvc/Dom/Dom.mjs has 527 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 · packages/joint-react/src/components/paper/paper.types.ts · ×1
  • packages/joint-react/src/components/paper/paper.types.ts: 506 lines of code packages/joint-react/src/components/paper/paper.types.ts:1 — packages/joint-react/src/components/paper/paper.types.ts has 506 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 · packages/joint-core/src/dia/Link.mjs · ×1
  • packages/joint-core/src/dia/Link.mjs: 495 lines of code packages/joint-core/src/dia/Link.mjs:1 — packages/joint-core/src/dia/Link.mjs has 495 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 · packages/joint-react/src/hooks/use-create-portal-paper.tsx · ×1
  • packages/joint-react/src/hooks/use-create-portal-paper.tsx: 495 lines of code packages/joint-react/src/hooks/use-create-portal-paper.tsx:1 — packages/joint-react/src/hooks/use-create-portal-paper.tsx has 495 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 · packages/joint-core/src/connectors/curve.mjs · ×1
  • packages/joint-core/src/connectors/curve.mjs: 488 lines of code packages/joint-core/src/connectors/curve.mjs:1 — packages/joint-core/src/connectors/curve.mjs has 488 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 · packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx · ×1
  • packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx: 481 lines of code packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:1 — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx has 481 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 · packages/joint-core/src/mvc/Collection.mjs · ×1
  • packages/joint-core/src/mvc/Collection.mjs: 480 lines of code packages/joint-core/src/mvc/Collection.mjs:1 — packages/joint-core/src/mvc/Collection.mjs has 480 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 · packages/joint-core/src/g/intersection.mjs · ×1
  • packages/joint-core/src/g/intersection.mjs: 468 lines of code packages/joint-core/src/g/intersection.mjs:1 — packages/joint-core/src/g/intersection.mjs has 468 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 · packages/joint-core/src/g/rect.mjs · ×1
  • packages/joint-core/src/g/rect.mjs: 450 lines of code packages/joint-core/src/g/rect.mjs:1 — packages/joint-core/src/g/rect.mjs has 450 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 · packages/joint-core/src/dia/Element.mjs · ×1
  • packages/joint-core/src/dia/Element.mjs: 440 lines of code packages/joint-core/src/dia/Element.mjs:1 — packages/joint-core/src/dia/Element.mjs has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · Type errors in this package cannot fail any build or CI step · ×1
  • Type errors in this package cannot fail any build or CI step examples/tree-shake/package.json:18 — `examples/tree-shake` is TypeScript, but a type error in it cannot fail anything this repository runs: its `analyze-S` script (`ENTRY=S vite build`) compiles TypeScript with a transpile-only tool that strips types without checking them, and no script, config or CI step of the package runs `tsc --noEmit` or another type checker over it. Add a type check that can fail — a `typecheck` script running `tsc --noEmit` (or `vue-tsc`/`svelte-check`) that CI or the workspace pipeline runs, or a build step that checks before it bundles.
R7 · Dead Code · Dead file (~6 LoC) · ×1
  • Dead file (~6 LoC) packages/joint-react/stories/stories-utils.ts — no import path from any entry point (280 application, 79 tooling, 259 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 'async' · ×1
  • Unused dependency 'async' packages/joint-core/package.json:97 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-contrib-clean' · ×1
  • Unused dependency 'grunt-contrib-clean' packages/joint-core/package.json:103 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-contrib-concat' · ×1
  • Unused dependency 'grunt-contrib-concat' packages/joint-core/package.json:104 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-contrib-copy' · ×1
  • Unused dependency 'grunt-contrib-copy' packages/joint-core/package.json:105 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-contrib-qunit' · ×1
  • Unused dependency 'grunt-contrib-qunit' packages/joint-core/package.json:106 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-contrib-uglify' · ×1
  • Unused dependency 'grunt-contrib-uglify' packages/joint-core/package.json:107 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-karma' · ×1
  • Unused dependency 'grunt-karma' packages/joint-core/package.json:108 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-newer' · ×1
  • Unused dependency 'grunt-newer' packages/joint-core/package.json:109 — Declared in packages/joint-core/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.
R8 · Dependency Hygiene · Unused dependency 'grunt-shell' · ×1
  • Unused dependency 'grunt-shell' packages/joint-core/package.json:110 — Declared in packages/joint-core/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.
Minor — 122 finding(s)
D24 · Comment Value · redundant comment · ×32
  • redundant comment packages/joint-core/src/connectors/straight.mjs:26 — "unknown `cornerType` provided => error" repeats the code it sits on: 4 of its 5 words (corner, type, provided, error) are already in `throw new Error('Invalid `cornerType` provided to `straight` connector.');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/dia/Graph.mjs:694 — "Set the new default layer ID" repeats the code it sits on: 4 of its 5 words (set, default, layer, id) are already in `this.defaultLayerId = defaultLayerId;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/dia/GraphLayerCollection.mjs:289 — "Move the cell between the two layer collections" repeats the code it sits on: 4 of its 5 words (move, cell, layer, collections) are already in `sourceLayer.cellCollection.remove(cell, moveOptions);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/dia/GraphLayerCollection.mjs:311 — "Add the cell to the target layer collection" repeats the code it sits on: 5 of its 5 words (add, cell, target, layer, collection) are already in `targetLayer.cellCollection.add(cell, addOptions);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/dia/Paper.mjs:931 — "Copy and set defaults for the view management options." repeats the code it sits on: 5 of its 6 words (set, defaults, view, management, options) are already in `options.viewManagement = defaults({}, options.viewManagement, {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/dia/Paper.mjs:2175 — "Check the visibility of all cells and schedule their updates." repeats the code it sits on: 4 of its 5 words (visibility, cells, schedule, updates) are already in `this.scheduleCellsVisibilityUpdate(opt);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/bezier.mjs:61 — "Get first control points X-values." repeats the code it sits on: 4 of its 5 words (get, first, control, points) are already in `var x = this.getFirstControlPoints(rhs);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/bezier.mjs:77 — "First control point." repeats the code it sits on: 3 of its 3 words (first, control, point) are already in `firstControlPoints.push(new Point(x[i], y[i]));`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/curve.mjs:77 — "Get first control points X-values." repeats the code it sits on: 4 of its 5 words (get, first, control, points) are already in `var x = getFirstControlPoints(rhs);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/curve.mjs:93 — "First control point." repeats the code it sits on: 3 of its 3 words (first, control, point) are already in `firstControlPoints.push(new Point(x[i], y[i]));`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/path.mjs:872 — "assign self as subpath start segment" repeats the code it sits on: 4 of its 5 words (assign, subpath, start, segment) are already in `segment.subpathStartSegment = segment;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/path.mjs:1255 — "assign previous segment's subpath start segment to this segment" repeats the code it sits on: 5 of its 5 words (assign, previous, segment, subpath, start) are already in `if (previousSegment) segment.subpathStartSegment = previousSegment.subpathStartSegment;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/points.mjs:218 — "the index of the record with lowestHullIndex" repeats the code it sits on: 4 of its 4 words (index, record, lowest, hull) are already in `var indexOfLowestHullIndexRecord = -1;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/g/polyline.mjs:373 — "= closest point on chord from middle point" repeats the code it sits on: 4 of its 4 words (closest, point, chord, middle) are already in `const closestPoint = chord.closestPoint(middlePoint);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/routers/manhattan.mjs:280 — 5 comments in this file only repeat the code they sit on (lines 280, 289, 384, 437, 669), for example "expand by padding box". Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/src/setTheme.mjs:10 — "Update the default theme on the view prototype." repeats the code it sits on: 4 of its 5 words (default, theme, view, prototype) are already in `mvc.View.prototype.defaultTheme = theme;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/dia/HighlighterView.js:298 — "Layer = Back/Front" repeats the code it sits on: 3 of its 3 words (layer, back, front) are already in `['back', 'front'].forEach(function(layer)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/dia/HighlighterView.js:1299 — "explicit nonScalingStroke = false" repeats the code it sits on: 4 of its 5 words (non, scaling, stroke, false) are already in `highlighter = HighlighterView.add(elementView, 'body', id, { nonScalingStroke: false });`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/dia/HighlighterView.js:1303 — "explicit nonScalingStroke = true" repeats the code it sits on: 4 of its 5 words (non, scaling, stroke, true) are already in `highlighter = HighlighterView.add(elementView, 'body', id, { nonScalingStroke: true });`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/dia/linkTools.js:623 — "vertexAdding = true" repeats the code it sits on: 3 of its 3 words (vertex, adding, true) are already in `const vertices1 = new joint.linkTools.Vertices({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/dia/linkTools.js:631 — "vertexAdding = false" repeats the code it sits on: 3 of its 3 words (vertex, adding, false) are already in `const vertices2 = new joint.linkTools.Vertices({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/graph.js:1066 — "a(out port + .body magnet) -> b" repeats the code it sits on: 3 of its 3 words (port, body, magnet) are already in `new joint.shapes.standard.Link({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/layers.js:201 — "Set a new layer" repeats the code it sits on: 3 of its 3 words (set, new, layer) are already in `rect.set('layer', 'newLayer', { testOption: true });`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/paper.js:3363 — "Create a new element for this test" repeats the code it sits on: 4 of its 4 words (create, new, element, test) are already in `const testElement = new joint.shapes.standard.Rectangle({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/joint-core/test/jointjs/paper.js:3394 — "Create a new element for this test" repeats the code it sits on: 4 of its 4 words (create, new, element, test) are already in `const testElement = new joint.shapes.standard.Rectangle({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • + 7 more in this group — see findings.md.
P2 · Observability · Console output used as the logging channel · ×13
  • Console output used as the logging channel packages/joint-core/src/routers/rightAngle.mjs:552 — `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 552 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/routers/rightAngle.mjs:553 — `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 553 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/routers/rightAngle.mjs:555 — `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 555 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/routers/rightAngle.mjs:557 — `packages/joint-core/src/routers/rightAngle.mjs` reports through `console.*` at line 557 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/linkTools/Vertices.mjs:113 — `packages/joint-core/src/linkTools/Vertices.mjs` reports through `console.*` at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/g/bezier.mjs:13 — `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 13 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/g/bezier.mjs:25 — `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 25 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/g/bezier.mjs:105 — `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 105 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/g/bezier.mjs:133 — `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 133 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/g/bezier.mjs:166 — `packages/joint-core/src/g/bezier.mjs` reports through `console.*` at line 166 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/dia/CellView.mjs:834 — `packages/joint-core/src/dia/CellView.mjs` reports through `console.*` at line 834 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/src/cellTools/Control.mjs:113 — `packages/joint-core/src/cellTools/Control.mjs` reports through `console.*` at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
  • Console output used as the logging channel packages/joint-core/demo/expand/shapes.js:44 — `packages/joint-core/demo/expand/shapes.js` reports through `console.*` at line 44 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
D12 · Dependency Hygiene · Deprecated · ×11
  • Deprecated: @sinonjs/text-encoding REDACTED:8761 — @sinonjs/text-encoding 0.7.3 is resolved in REDACTED and is marked deprecated by its publisher: "Deprecated: no longer maintained and no longer used by Sinon packages. See https://github.com/sinonjs/nise/issues/243 for replacement details.". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: @ungap/structured-clone REDACTED:10231 — @ungap/structured-clone 1.3.0 is resolved in REDACTED and is marked deprecated by its publisher: "Potential CWE-502 - Update to 1.3.1 or higher". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: core-js REDACTED:12711 — core-js 3.6.1 is resolved in REDACTED and is marked deprecated by its publisher: "core-js@<3.23.3 is no longer maintained and not recommended for usage due to the number of issues. Because of the V8 engine whims, feature detection in old core-js versions could cause a slowdown up to 100x even if nothing is polyfilled. Some versions have web compatibility issues. Please, upgrade your dependencies to the actual version of core-js.". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: glob REDACTED:15390 — glob 10.5.0 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: glob REDACTED:15431 — glob 7.1.7 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:16176 — 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: prebuild-install REDACTED:20569 — prebuild-install 7.1.3 is resolved in REDACTED and is marked deprecated by its publisher: "No longer maintained. Please contact the author of the relevant native addon; alternatives are available.". 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:21529 — rimraf 3.0.2 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.
  • Deprecated: sourcemap-codec REDACTED:22720 — sourcemap-codec 1.4.8 is resolved in REDACTED and is marked deprecated by its publisher: "Please use @jridgewell/sourcemap-codec instead". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: uuid REDACTED:24258 — uuid 8.3.2 is resolved in REDACTED and is marked deprecated by its publisher: "uuid@10 and below is no longer supported. For ESM codebases, update to uuid@latest. For CommonJS codebases, use uuid@11 (but be aware this version will likely be deprecated in 2028).". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: whatwg-encoding REDACTED:24819 — whatwg-encoding 3.1.1 is resolved in REDACTED and is marked deprecated by its publisher: "Use @exodus/bytes instead for a more spec-conformant and faster implementation". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
D34 · Knowledge Freshness · Orphaned file · ×10
  • Orphaned file packages/joint-core/src/g/polyline.mjs: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 packages/joint-core/src/g/rect.mjs: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 packages/joint-core/src/g/point.mjs: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 packages/joint-core/src/g/line.mjs: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 packages/joint-core/src/g/ellipse.mjs: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 packages/joint-core/src/layout/ports/portLabel.mjs: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 packages/joint-core/src/g/bezier.mjs: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 packages/joint-core/src/layout/ports/port.mjs: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 packages/joint-core/src/linkAnchors/index.mjs: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 packages/joint-core/src/polyfills/base64.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.
X10 · Duplicated predicate · Duplicated predicate · ×7
  • Duplicated predicate packages/joint-router-avoid/src/providers/MainThreadProvider.mts:133 — `connector.sourceId === undefined || connector.sourcePinId === undefined || connector.targetId === undefined || connector.targetPinId === und…` appears character-identically in 2 files — packages/joint-router-avoid/src/providers/MainThreadProvider.mts, packages/joint-router-avoid/src/providers/Worker.mts. 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 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx:128 — `link.source?.id === removedElementId || link.target?.id === removedElementId` appears character-identically in 2 files — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx, packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx. 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 packages/joint-core/src/dia/Graph.mjs:568 — `originalIndex !== -1 && index > originalIndex` appears character-identically in 2 files — packages/joint-core/src/dia/Graph.mjs, packages/joint-core/src/dia/Paper.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:161 — `source?.id === removedElementId || target?.id === removedElementId` appears character-identically in 2 files — packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx, packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx. 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 packages/joint-core/src/g/curve.mjs:653 — `start.equals(control1) && control1.equals(control2) && control2.equals(end)` appears character-identically in 2 files — packages/joint-core/src/g/curve.mjs, packages/joint-core/src/g/path.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/joint-core/src/cellTools/Button.mjs:75 — `tangent.vector().vectorAngle(new g.Point(1, 0)) || 0` appears character-identically in 2 files — packages/joint-core/src/cellTools/Button.mjs, packages/joint-core/src/cellTools/HoverConnect.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/joint-core/src/linkTools/Arrowhead.mjs:34 — `tangent.vector().vectorAngle(this.xAxisVector) || 0` appears character-identically in 2 files — packages/joint-core/src/linkTools/Arrowhead.mjs, packages/joint-core/src/linkTools/RotateLabel.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D29 · Static Analysis (SAST) · REDACTED · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D16 · Bus Factor · Off-boarding risk · ×2
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 17 significant file(s) lose their only recent owner: packages/joint-router-avoid/src/RouterService.mts, packages/joint-layout-elk/src/types/elkLayoutOptions.mts, packages/joint-layout-elk/src/export.mts, packages/joint-react/src/hooks/use-cells.ts, packages/joint-layout-elk/src/import.mts, packages/joint-router-avoid/src/providers/MainThreadProvider.mts, packages/joint-layout-elk/src/types/elkNodeOptions.mts, packages/joint-react/src/presets/link-routing.ts (+9 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: packages/joint-react/src/hooks/use-create-portal-paper.tsx, packages/joint-react/src/store/graph-projection.ts, packages/joint-react/src/store/state-container.ts, packages/joint-react/src/store/graph-changes.ts. Pair on, review, or document these before any departure.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×2
  • Projects may be oversized for their cohesion packages/joint-core/package.json:1 — `packages/joint-core` (54639 LoC, 164 module-visible types across 57 directories) overshoots its size bounds. 2 of 14 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 7.1/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion packages/joint-react/package.json:1 — `packages/joint-react` (32089 LoC, 257 module-visible types across 81 directories) overshoots its size bounds. 2 of 14 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 7.1/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D10 · Test Quality · Mock-dominated test · ×1
  • Mock-dominated test: needs a replacement, since the mocked one never calls back packages/joint-mock-svg/test/jest/src/customizations.test.ts:56 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 3 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.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 3 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 (26 single-owned of 207 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; 207 of the 442 production source files in this repository met that bar). They are anonymized user #3 (3 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (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: packages/joint-eslint-config/eslint.config.react.mjs, packages/joint-react/scripts/create-rollup-config.ts, packages/joint-core/rollup.resources.mjs, packages/joint-core/src/dia/Link.mjs, packages/joint-react/src/components/html-host.tsx.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found packages/joint-cli/package.json:7 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `packages/joint-cli/package.json` makes this repository a deployable product (line 7).
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 10 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: packages/joint-core/src/g/polyline.mjs, packages/joint-core/src/g/rect.mjs, packages/joint-core/src/g/point.mjs, packages/joint-core/src/g/line.mjs, packages/joint-core/src/g/ellipse.mjs, packages/joint-core/src/layout/ports/portLabel.mjs, packages/joint-core/src/g/bezier.mjs, packages/joint-core/src/layout/ports/port.mjs (and 2 more) (12 orphaned of 210 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; 210 of the 442 production source files in this repository met that bar). 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
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M4 · Documentation accuracy · README/code drift · ×1
  • README/code drift packages/joint-react/README.md:45 — packages/joint-react/README.md names React 18, but the manifest declares `react` ^19.1.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation package.json:26 — `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`.
R7 · Dead Code · Unused export '_everySidesOptionIsListed' · ×1
  • Unused export '_everySidesOptionIsListed' packages/joint-layout-elk/src/elkOptions.mts:84 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export '_everyPointOptionIsListed' · ×1
  • Unused export '_everyPointOptionIsListed' packages/joint-layout-elk/src/elkOptions.mts:104 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export '_everySetOptionIsListed' · ×1
  • Unused export '_everySetOptionIsListed' packages/joint-layout-elk/src/elkOptions.mts:128 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'selectCellLayer' · ×1
  • Unused export 'selectCellLayer' packages/joint-react/src/selectors/cell-selectors.ts:141 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'selectCellZIndex' · ×1
  • Unused export 'selectCellZIndex' packages/joint-react/src/selectors/cell-selectors.ts:156 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'MapAttributesToElement' · ×1
  • Unused export 'MapAttributesToElement' packages/joint-react/src/state/data-mapping/element-mapper.ts:65 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'MapElementToAttributes' · ×1
  • Unused export 'MapElementToAttributes' packages/joint-react/src/state/data-mapping/element-mapper.ts:69 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'MapAttributesToLink' · ×1
  • Unused export 'MapAttributesToLink' packages/joint-react/src/state/data-mapping/link-mapper.ts:67 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'MapLinkToAttributes' · ×1
  • Unused export 'MapLinkToAttributes' packages/joint-react/src/state/data-mapping/link-mapper.ts:70 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'makeOptions' · ×1
  • Unused export 'makeOptions' packages/joint-react/src/utils/object-utilities.ts:18 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'getAPIDocumentationLink' · ×1
  • Unused export 'getAPIDocumentationLink' packages/joint-react/stories/utils/get-api-documentation-link.tsx:7 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getAPIPropsLink' · ×1
  • Unused export 'getAPIPropsLink' packages/joint-react/stories/utils/get-api-documentation-link.tsx:12 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'FallbackRouteAttributes' · ×1
  • Unused export 'FallbackRouteAttributes' packages/joint-router-avoid/src/RouterService.mts:10 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused module-local declaration 'isElementAfterObjectSet' · ×1
  • Unused module-local declaration 'isElementAfterObjectSet' packages/joint-core/test/ts/index.test.ts:86 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'portLabelPosition' · ×1
  • Unused module-local declaration 'portLabelPosition' packages/joint-core/test/ts/index.test.ts:89 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'eventOptions' · ×1
  • Unused module-local declaration 'eventOptions' packages/joint-core/test/ts/index.test.ts:182 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isHTMLView' · ×1
  • Unused module-local declaration 'isHTMLView' packages/joint-core/test/ts/index.test.ts:190 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isSVGView' · ×1
  • Unused module-local declaration 'isSVGView' packages/joint-core/test/ts/index.test.ts:191 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isTypeofSize' · ×1
  • Unused module-local declaration 'isTypeofSize' packages/joint-core/test/ts/index.test.ts:194 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isTypeofPoint' · ×1
  • Unused module-local declaration 'isTypeofPoint' packages/joint-core/test/ts/index.test.ts:195 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'AttributeHighlighterView' · ×1
  • Unused module-local declaration 'AttributeHighlighterView' packages/joint-core/test/ts/index.test.ts:238 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isRectangle' · ×1
  • Unused module-local declaration 'isRectangle' packages/joint-core/test/ts/shapes.test.ts:63 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isString' · ×1
  • Unused module-local declaration 'isString' packages/joint-core/test/ts/shapes.test.ts:108 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'isMask' · ×1
  • Unused module-local declaration 'isMask' packages/joint-core/test/ts/shapes.test.ts:156 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
X2 · Cancellation propagation · Not all async functions that make a request accept an AbortSignal · ×1
  • Not all async functions that make a request accept an AbortSignal — Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X5 · Nullable reference types · Strict null checking is not enabled everywhere the repository type-checks · ×1
  • Strict null checking is not enabled everywhere the repository type-checks — 16/34 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
X5 · Nullable reference types · Null assertions (`!`) override strict null checking · ×1
  • Null assertions (`!`) override strict null checking — ~1.8 `!` null assertions per 1k TypeScript source lines — 47 assertion(s) across the 26708 source line(s) of the 209 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/joint-react/src/store/graph-projection.ts (13), packages/joint-router-avoid/src/RouterService.mts (9), packages/joint-router-avoid/src/providers/MainThreadProvider.mts (7). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
X7 · Silent fallback defaults · Silent fallback default in catch · ×1
  • Silent fallback default in catch packages/joint-sanitize/src/sanitizeGraph.mjs:723 — `getDefaults` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Minor — 25 finding(s)
D12 · Dependency Hygiene · Outdated (npm) · ×17
  • Outdated (npm): @angular/common — @angular/common is pinned at 21.2.25; registry.npmjs.org publishes 22.2.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @angular/compiler — @angular/compiler is pinned at 21.2.25; registry.npmjs.org publishes 22.2.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @angular/core — @angular/core is pinned at 21.2.25; registry.npmjs.org publishes 22.2.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @angular/forms — @angular/forms is pinned at 21.2.25; registry.npmjs.org publishes 22.2.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @angular/platform-browser — @angular/platform-browser is pinned at 21.2.25; registry.npmjs.org publishes 22.2.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @dagrejs/dagre — @dagrejs/dagre is pinned at 1.1.8; registry.npmjs.org publishes 3.1.3 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @dagrejs/graphlib — @dagrejs/graphlib is pinned at 2.2.4; registry.npmjs.org publishes 4.0.7 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): @msagl/core — @msagl/core is pinned at 1.1.23; registry.npmjs.org publishes 1.1.24 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): adaptivecards — adaptivecards is pinned at 3.0.5; registry.npmjs.org publishes 3.0.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): elkjs — elkjs is pinned at 0.12.0; registry.npmjs.org publishes 0.12.1 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): honeycomb-grid — honeycomb-grid is pinned at 3.1.8; registry.npmjs.org publishes 4.1.5 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): libavoid-js — libavoid-js is pinned at 0.4.5; registry.npmjs.org publishes 0.5.0-beta.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): swiper — swiper is pinned at 12.2.0; registry.npmjs.org publishes 14.4.0 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): tslib — tslib is pinned at 2.8.1; registry.npmjs.org publishes 2.9.1 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): use-sync-external-store — use-sync-external-store is pinned at 1.6.0; registry.npmjs.org publishes 1.7.0 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): vue — vue is pinned at 3.5.44; registry.npmjs.org publishes 3.5.45 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): zone.js — zone.js is pinned at 0.15.1; registry.npmjs.org publishes 0.16.3 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
D24 · Comment Value · doc comments repeat the names · ×5
  • doc comments repeat the names packages/joint-core/src/connectors/jumpover.mjs:131 — 4 of 85 documented parameters and 0 of 25 summaries in `@joint/core` only repeat the member or parameter name (e.g. "lines to cross" for `crossCheckLines`). 2 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names packages/joint-layout-elk/src/export.mts:23 — 0 of 0 documented parameters and 1 of 87 summaries in `@joint/layout-elk` only repeat the member or parameter name (e.g. "An ELK label draft" for `ElkLabelDraft`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names packages/joint-layout-msagl/src/types.mts:43 — 0 of 0 documented parameters and 2 of 20 summaries in `@joint/layout-msagl` only repeat the member or parameter name (e.g. "Edge routing mode." for `edgeRoutingMode`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names packages/joint-react/src/components/paper/paper.types.ts:38 — 11 of 390 documented parameters and 9 of 885 summaries in `@joint/react` only repeat the member or parameter name (e.g. "The paper instance." for `paper`). 123 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names packages/joint-router-avoid/src/RouterService.mts:600 — 1 of 104 documented parameters and 0 of 199 summaries in `@joint/router-avoid` only repeat the member or parameter name (e.g. "Id of the port." for `portId`). Delete the restating tags, or add what the name does not say.
D10 · Test Quality · Skipped (documented) · ×3
  • Skipped (documented): (unnamed test) packages/joint-core/test/ts/index.test.ts:314 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) packages/joint-core/test/ts/shapes.test.ts:11 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) packages/joint-core/test/ts/shapes.test.ts:98 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-997a8c8f56b34301a8a1e224a25e4ed6/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-997a8c8f56b34301a8a1e224a25e4ed6/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=1130" --report-format json --report-path /tmp/watchdog-gitleaks-997a8c8f56b34301a8a1e224a25e4ed6/history-2.json --exit-code 0 --source .2artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-997a8c8f56b34301a8a1e224a25e4ed6/tree.json --exit-code 0 --source .3artifacts/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 .yarn .59artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .7artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 25 file(s) — `packages/joint-core/types/dia.d.ts`, `packages/joint-layout-directed-graph/rollup.config.mjs`, `packages/joint-layout-elk/rollup.config.mjs`, `packages/joint-layout-msagl/rollup.config.mjs`, `packages/joint-react/jest.config.js`, … (+20 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.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 01a1e7f7-2833-7458-bdf7-df6c3149f8f5 · 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