mercury-composable — Watchdog Audit

Executive summary

The system is an adequate, medium-sized asset with a solid foundation but significant operational risks that threaten delivery speed and security. With an overall health score of 60%, the codebase is functional yet carries hidden costs that erode value over time. The team has built a substantial platform, comprising over 82,000 lines of production code and nearly 52,000 lines of tests, representing a rebuild cost of approximately €170,000. This scale means that even small inefficiencies compound quickly, making the current state a workable system that requires immediate attention to prevent future fragility.

The most critical issue is a lack of operational readiness, which stands at only 56%. This weakness creates a high risk of outages and deployment failures, directly impacting business reliability. Without robust safeguards, the team faces a constant threat of unstable releases, which can damage customer trust and incur significant recovery costs. This area represents the largest concentration of risk for an asset of this size, and addressing it is essential for stabilizing the platform.

A secondary concern is a persistent velocity tax on every change. Code quality signals indicate that modifications in weaker areas cost 3–6% more effort than in clean code. This inefficiency acts as a recurring drag on the team’s capacity, costing hundreds of engineer-days annually. Over time, this tax compounds, slowing down feature delivery and increasing long-term maintenance costs without adding new business value.

However, the codebase is genuinely good in its core structure, with strong architecture and code health scores above 80%. This indicates that the fundamental logic is sound and maintainable, providing a stable base for improvements. The primary focus should be on adding automated security scanning to the continuous integration pipeline. This single action pays for itself within months by preventing security regressions and reducing the risk of costly breaches. It is the highest-leverage move available, offering immediate protection with minimal effort. While some areas like accessibility and performance were not measured, the current picture is sufficient to prioritize these critical fixes. Addressing readiness and security first will secure the platform’s future and unlock the team’s full potential.

Code Health 81% Strong Architecture 84% Strong Maturity 84% Strong Readiness 56% Adequate · gated by P3 Security 60% Adequate · gated by D36 Accessibility 56% Adequate · gated by AC3

How the score is built — each lens's share of the headline Width is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.

Readiness 56% · 46% weightAccessibility 56% · 25% weightSecurity 60% · 14% weightCode Health 81% · 8% weightMaturity 84% · 4% weightArchitecture 84% · 2% weight

No single dominant problem — the weakest areas are close, so progress on any of them moves the score.

Code composition — where the lines go

Tests 100%

Rebuild cost & value ~ Modeled — €57,000–€290,000

Cost to rebuild	€57,000–€290,000 (0.6–1.8 person-years (958–3,038 h), ~1–3 engineers)
Domain complexity	Standard — harder problems cost more per line
Quality factor	0.8× (at 60% quality) — the last 20% of quality is most of the work
Size & shape	REDACTED · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
Dead frontend code	~498 LoC unreachable (4 file(s)) — that slice of this estimate buys code with zero runtime value; deleting it is the cheapest win in this report (the R7 card lists every file)

This codebase represents roughly ~1.2 person-years of build effort (about ~€170,000 to rebuild). Its weakest lens is Readiness at 56% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.2) — CQRS × a 0.8× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).

Top priorities

The highest-leverage moves; the full ranked list is in the Roadmap below.

Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.

+4.7 pts · REDACTED effort · Security & performance tooling

Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

+4.7 pts · REDACTED effort · Deployment & Rollback

Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

+4.5 pts · REDACTED effort · Page structure

Diagnosis — what's actually going on

The top fix pays for itself · REDACTED · Economics

The top-ranked fix costs roughly 3–10 engineer-days once. Not doing it costs about 59–353.9 engineer-days every year, paid as drag on the ~857,920 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–2 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 3–6% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.

Evidence: D15 churn: 211,542 line(s) changed over a 90-day window ⇒ ~857,920/year · D1/D2/D4 code quality: averaging 6.9/10 ⇒ a 3–6% drag on each change · top-ranked remediation: REDACTED effort ⇒ about 3–10 engineer-day(s)

→ Do the top-ranked fix now if this code will still be yours in 2 months.

Value concentrated against a weak lens · REDACTED · Value at risk

This is a REDACTED asset (~1.2 person-years to rebuild), and its weakest lens is Readiness at 56%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.

Evidence: valuation: REDACTED, ~1.2 person-years rebuild (82,137 LoC) · weakest lens: Readiness 56%

→ Direct remediation budget at Readiness first — highest risk-reduction per euro on an asset this size.

Highest-leverage move · REDACTED · Leverage

Of everything flagged, the best return on effort is: Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing. The rest can wait behind it.

Evidence: priority ranking: top of 5 ranked by impact/effort

→ Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.

A velocity tax on every change · REDACTED · Economics

The code-quality signals (complexity, duplication, cohesion) average 6.9/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 3–6% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)

Evidence: D1/D2/D4 code quality: averaging 6.9/10 across the code-quality signals actually measured

→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.

Architecture — module dependency matrix

Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)

214 modules, 307 dependencies. 1 dependency cycle across 6 modules, marked above the diagonal.

Showing the 40 most-connected modules; 174 more are not drawn.

Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
depends on →	1 com.accenture.models	2 org.platformlambda.core.util.common	5 system.minigraph-playground-engine.webapp.src.data.helpContent	6 system.minigraph-playground-engine.webapp.src.graphActions.nodeAuthoringTypes	7 system.minigraph-playground-engine.webapp.src.protocol.bus	8 system.minigraph-playground-engine.webapp.src.utils.graphTypes	9 org.platformlambda.automation.models	10 org.platformlambda.core.util	11 system.minigraph-playground-engine.webapp.src.clipboard.db	15 system.minigraph-playground-engine.webapp.src.hooks.useGraphRunWorkflow	17 org.platformlambda.core.serializers	18 org.platformlambda.mini.kafka.schema	20 system.minigraph-playground-engine.webapp.src.components.GraphToolbar.GraphRunControls	21 org.platformlambda.automation.util	22 org.platformlambda.core.system	23 system.minigraph-playground-engine.webapp.src.components.RightPanel.RightPanel	24 org.platformlambda.core.models	26 com.accenture.automation	27 org.platformlambda.automation.services	28 org.platformlambda.core.graph	29 org.platformlambda.mini.kafka	30 org.platformlambda.redis	33 com.accenture.minigraph.models	37 com.accenture.minigraph.common
1 com.accenture.models
2 org.platformlambda.core.util.common
3 system.minigraph-playground-engine.webapp.src.components
4 system.minigraph-playground-engine.webapp.src.components.ClipboardSidebar
5 system.minigraph-playground-engine.webapp.src.data.helpContent
6 system.minigraph-playground-engine.webapp.src.graphActions.nodeAuthoringTypes
7 system.minigraph-playground-engine.webapp.src.protocol.bus
8 system.minigraph-playground-engine.webapp.src.utils.graphTypes
9 org.platformlambda.automation.models															1		2
10 org.platformlambda.core.util		2															3
11 system.minigraph-playground-engine.webapp.src.clipboard.db						1
12 system.minigraph-playground-engine.webapp.src.components.GraphAuthoring.useGraphAuthoring				1	1
13 system.minigraph-playground-engine.webapp.src.components.GraphView						1
14 system.minigraph-playground-engine.webapp.src.graphActions				6		4
15 system.minigraph-playground-engine.webapp.src.hooks.useGraphRunWorkflow					1
16 system.minigraph-playground-engine.webapp.src.utils			1			1
17 org.platformlambda.core.serializers								1									1
18 org.platformlambda.mini.kafka.schema		1						2
19 system.minigraph-playground-engine.webapp.src.clipboard						2			4
20 system.minigraph-playground-engine.webapp.src.components.GraphToolbar.GraphRunControls										1
21 org.platformlambda.automation.util							1				1
22 org.platformlambda.core.system							2	6			1						40
23 system.minigraph-playground-engine.webapp.src.components.RightPanel.RightPanel													1
24 org.platformlambda.core.models								1			1				1
25 system.minigraph-playground-engine.webapp.src.hooks					2					2						1
26 com.accenture.automation	9							8							1		7
27 org.platformlambda.automation.services							9	3			2			2	2		9
28 org.platformlambda.core.graph								2									3
29 org.platformlambda.mini.kafka		1						4				6			1		5
30 org.platformlambda.redis		1															1
31 org.platformlambda.scheduler.services								1							1		2
32 org.platformlambda.services								1							1		3
33 com.accenture.minigraph.models								1												1
34 org.platformlambda.automation.http							2	1			2			1	1		6		1
35 org.platformlambda.sync															3		2					4
36 org.platformlambda.twin.kafka								1				2					1				6
37 com.accenture.minigraph.common								3									8			2			2
38 com.accenture.minigraph.services	1							3							3		10	1		1			4	4
39 com.accenture.minigraph.skills								5							5		22						11	10
40 com.accenture.minigraph.start								1									2	1						1

Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself

At a glance — Code Health · 81% · Strong ·

The Good

D3 · .NET / C# God Classes 7.4 D4 · .NET / C# Code Duplication 9.3 D17 · .NET / C# Explicit Debt 10.0 R1 · React / TS Type Safety 9.4 R10 · React / TS Code Duplication 8.7 R2 · React / TS Cyclomatic Complexity 7.6 R3 · React / TS Large Files 8.3 R7 · React / TS Dead Code 9.3

The Bad

D1 · .NET / C# Cyclomatic Complexity 5.7 D2 · .NET / C# Cognitive Complexity 5.7

At a glance — Architecture · 84% · Strong ·

The Good

D7 · .NET / C# Architectural Integrity 10.0 D35 · .NET / C# Change Coupling 10.0 AX10 · Repo Code composition 9.5 AX5 · Repo Architecture & structure 10.0 R9 · React / TS Circular Imports 10.0

The Bad

AX7 · Repo Slice cohesion 5.3

At a glance — Maturity · 84% · Strong ·

The Good

D15 · .NET / C# Churn × Complexity Hotspots 10.0 D19 · .NET / C# Documentation Quality 9.0 D21 · .NET / C# Naming Consistency 10.0 D25 · .NET / C# ADR Conformance 10.0 D34 · .NET / C# Knowledge Freshness 10.0 M1 · Repo Documentation (README) 7.3 M2 · Repo Architecture documentation 7.0 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Bad

D20 · .NET / C# ADR Quality 5.5

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

The Good

D9 · .NET / C# Test Distribution 10.0 D10 · .NET / C# Test Quality 8.9 D13 · .NET / C# Secret Scanning 10.0 P1 · Repo CI/CD gates 10.0 P6 · Repo Release Hygiene 10.0 R4 · React / TS Test Coverage 8.8 R5 · React / TS Dependency Freshness 8.6 R8 · React / TS Dependency Hygiene 9.5

The Bad

P4 · Repo Deployment & Rollback 5.0 R6 · React / TS Tooling 6.7

The Ugly

P3 · Repo Security & performance tooling 0.0

At a glance — Security · 60% · Adequate · gated by D36 ·

The Good

D28 · .NET / C# Secrets (history) 10.0 D31 · .NET / C# IaC & Container Security 9.5

The Ugly

D29 · .NET / C# Static Analysis (SAST) 4.4 D36 · .NET / C# Supply-chain Provenance & Signing 0.0

At a glance — Accessibility · 56% · Adequate · gated by AC3 ·

The Good

AC2 · Repo Forms & labels 7.6 AC5 · Repo ARIA correctness 10.0 AC6 · Repo Visual & motion safety 10.0

The Bad

AC4 · Repo Keyboard semantics 5.2

The Ugly

AC3 · Repo Page structure 3.7 AC7 · Repo A11y enforcement 4.0

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 category	Findings	Severity
A03:2021 — Injection	18	REDACTED / Critical
A05:2021 — Security Misconfiguration	3	REDACTED / Critical

Roadmap

First, integrate automated security scanning into the CI pipeline to block builds containing vulnerabilities. Second, implement draft releases or manual gates to prevent faulty deployments from reaching users. Third, correct page structure by adding proper landmarks and semantic headings, and ensure all custom controls are fully keyboard accessible. Finally, enforce accessibility standards by adding linting and automated testing to the development workflow.

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

Do this	Helps	Effort	Dimension
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.	+4.7 pts	REDACTED	Security & performance tooling
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.	+4.7 pts	REDACTED	Deployment & Rollback
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.	+4.5 pts	REDACTED	Page structure
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.	+4.5 pts	REDACTED	Keyboard semantics
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.	+4.5 pts	REDACTED	A11y enforcement
Add eslint as package.json scripts and run them in CI.	+4.5 pts	REDACTED	Tooling
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.	+3.8 pts	REDACTED	Forms & labels
Bump outdated dependencies to current versions to limit upgrade debt.	+2.5 pts	REDACTED	Dependency Freshness

File quality

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

File	Score	Band	Worst signal
REDACTED	2.4	Slop	Static Analysis (SAST): REDACTED: REDACTED
REDACTED	4.4	Mixed	IaC & Container Security: REDACTED IaC: REDACTED
REDACTED	4.5	Mixed	Static Analysis (SAST): REDACTED: REDACTED
REDACTED	4.6	Mixed	Static Analysis (SAST): REDACTED: REDACTED
REDACTED	5.0	Mixed	Static Analysis (SAST): REDACTED: REDACTED
REDACTED	6.7	Mixed	Cognitive Complexity: SseRelay.onLine (cognitive 17)
system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts	7.0	Mixed	Cyclomatic Complexity: graphTransformer.computeLayout (cyclomatic 51)
agent-skills/memory-lint/scripts/memory-lint.mjs	7.0	Mixed	Cyclomatic Complexity: memory-lint.scan_lines (cyclomatic 26)
system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java	7.0	Mixed	God Classes: TooManyMethods: EventEmitter
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java	7.0	Mixed	Code Duplication: Members sharing a duplicated core (7 members, 50+ identical tokens)
system/event-script-engine/src/test/java/com/accenture/flows/FlowTests.java	7.0	Mixed	Test Quality: No assertions: dynamicModelTargetResolvingToReservedKeyFailsAtRuntime
agent-skills/memory-lint/scripts/memory-lint.py	7.0	Mixed	Cyclomatic Complexity: memory-lint._scan_lines (cyclomatic 24)
system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java	7.0	Mixed	God Classes: ClassTooLong: HttpRouter
system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java	7.0	Mixed	Code Duplication: Near-duplicate member family (4 members, 14 shared lines)
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java	7.1	Mixed	Cognitive Complexity: GraphCommandService.handleDeleteCommand (cognitive 16)
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java	7.1	Mixed	God Classes: TooManyMethods: GraphLambdaFunction
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java	7.1	Mixed	Code Duplication: Edited copy of a member (23 corresponding lines)
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java	7.1	Mixed	Code Duplication: Duplicated block (15–17 lines × 2)
system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx	7.1	Mixed	Cyclomatic Complexity: GraphView.GraphView (cyclomatic 126)
system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts	7.1	Mixed	Cyclomatic Complexity: useGraphAuthoring.useGraphAuthoring (cyclomatic 66)

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

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

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

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

Could not be resolved — 45

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

Watchdog 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. 42 of 47 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.8 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three 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; ◐ Advisory — an LLM prose judgement. 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; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 47 dimensions across the health lenses

D1D2D3D4D7D9D10D13D15D17D19D20D21D25D28D29D31D34D35D36AC2AC3AC4AC5AC6AC7AX10AX5AX7M1M2M3M4P1P3P4P6R1R10R2R3R4R5R6R7R8R9

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

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, 548 of 560 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.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
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.

Method	Backs	Version	Evaluator
Roslyn static analysis	Complexity, cohesion, coupling, dead code, API surface, layering	5.3.0	✓ deterministic
Native secret scanner	Hardcoded secrets / credentials	1.0.0	✓ deterministic
Watchdog duplication detector (in-process)	Code duplication	1.0.0	✓ deterministic
Coverage (coverlet / dotnet-coverage)	Line & branch coverage	10.0.400	✓ deterministic
NuGet / dotnet	Outdated, vulnerable & deprecated dependencies	10.0.400	✓ deterministic
git / LibGit2Sharp	Churn hotspots, knowledge concentration, history	2.43.0 · 0.31.0	✓ deterministic
gitleaks · semgrep · trivy · checkov	Secrets in history, SAST, CVEs, IaC & container, PII / GDPR	1.86.0 · 0.69.3 · 3.2.533	✓ deterministic
LLM (sampled · advisory)	Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement	Local LLM	◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a0c4aa-292c-7692-81bd-1ac1ac4f4ff5.

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.

D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 1,402 test(s) behind this row are the ones the code-model census could read, and this repository also carries at least 41 test source file(s) (.ts, .tsx) that it cannot: it reads the test types the .java frontend declared, so a suite in any other language is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .java, and the built-in reliability runner cannot re-run the .java test suite(s) — so reliability was not measured for the repository as a whole. The JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in system/minigraph-playground-engine/webapp/ (321 tests)): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted.
D12 Dependency Hygiene — not measured this run — Watchdog 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. Dependency Hygiene ran out of its 5-minute budget before it had finished, so what it reports here is a floor rather than a complete count. The rows above are real and stand; what is not known is how many more there are. This is a limit of the analysis run, not a finding about this repository.
D14 License Compliance — evaluation did not complete — License Compliance not included (check did not complete) — excluded from the score.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (12 contributor(s) across 1629 commit(s) sampled, automation and bot accounts excluded). One of them holds 93% of the history; the other 11 hold 0.6% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: D22 has no public-API collector for any other ecosystem, and the remedy is to write one — no change to the scan image can close it.
D30 Dependency Vulnerabilities — not measured this run — Watchdog 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. Npm: the scanner produced no output at all, so no dependency was actually scanned; osv: osv-scanner exited 127 with no findings — dependency CVEs were not measured. 'trivy' exited 1 and produced no findings, and that exit code has no documented repo-side meaning — so this run measured nothing, and nothing here is a statement about the repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog 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. `agent-skills/archive-fact/scripts/archive-fact.mjs`, `agent-skills/memory-lint/scripts/memory-lint.mjs`, `agent-skills/refresh-metadata/scripts/refresh-metadata.mjs`, `connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java`, `extensions/reactive-postgres/src/main/java/org/platformlambda/db/SqlPreparedStatement.java`, … (+24 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.
D43 Malicious Dependencies — not measured this run — Watchdog 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. Npm: the scanner produced no output at all, so no dependency was actually scanned; osv: osv-scanner exited 127 with no findings — dependency CVEs were not measured. 'trivy' exited 1 and produced no findings, and that exit code has no documented repo-side meaning — so this run measured nothing, and nothing here is a statement about the repository.
D44 Platform End-of-Life — not measured this run — Watchdog 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, 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 (go.mod, a Gemfile's ruby directive, a REDACTED) is simply not read here yet.
AX3 Project dependency cycles — not measured this run — Watchdog 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 is computed over which project references which — facts that live in .csproj references. This repository either commits no MSBuild project at all (its C# may still have been parsed as syntax-only projects, which carry no references between them) or its projects failed to load, so there was no graph to read. That is a gap in this analyzer's reach — not a finding that the repository is free of what this check looks for.
AX6 Interface segregation — not measured this run — Watchdog 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 is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing 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.
AX8 Test isolation — not measured this run — Watchdog 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 is computed over which projects are test projects, and what they reference — facts that live in .csproj references. This repository either commits no MSBuild project at all (its C# may still have been parsed as syntax-only projects, which carry no references between them) or its projects failed to load, so there was no graph to read. That is a gap in this analyzer's reach — not a finding that the repository is free of what this check looks for.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
ED5 Idempotency — not measured this run — Watchdog 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 finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
R10 Code Duplication — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it 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. 16 further occurrence(s) are not listed individually; the score already reflects all 56.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X12 Unreachable branch — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X13 Undrained process stream — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X14 Bypassable address classification — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X16 Unfloored truncation loop — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X18 Disposal-pattern correctness — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X19 Unrestored process-global state — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X2 Cancellation propagation — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X20 Mistyped argument guard — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X21 Side-effecting pattern guard — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X22 Contradicted release guard — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X25 Inert configuration knob — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X26 Unsynchronised callback handoff — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X27 Collection changed while being enumerated — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X3 Exception handling — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X30 Support guard that admits what it rejects — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X5 Nullable reference types — not measured this run — Watchdog 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

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

Per-dimension blind spots

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

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
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").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D25 ADR Conformance: ADR conformance is the LLM-scored fraction of sampled code that follows recorded decisions — it checks the decisions that were written down and the slices it sampled, not unrecorded rules or the whole tree.
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").
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
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.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
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: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.

The LLM boundary

LLM-set scores this run (5): D19, D20, D21, D25, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity5.7 / 10Adequate✓ Tool-verified

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

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

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

45 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Playground.Playground at 140. A further 5 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 SqlPreparedStatement.str2SqlType at 21 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroConversions.java (AvroConversions.toAvro at 19). 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.

archive-fact.archive_facts (cyclomatic 26) · ×2agent-skills/archive-fact/scripts/archive-fact.py:110

Playground.Playground (cyclomatic 140)system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87

GraphView.GraphView (cyclomatic 126)system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95

useGraphAuthoring.useGraphAuthoring (cyclomatic 66)system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:305

useGraphRunWorkflow.useGraphRunWorkflow (cyclomatic 61)system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:76

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

What to do

Resolve the 2 archive-fact.archive_facts (cyclomatic 26) finding(s) in Cyclomatic Complexity — start with archive-fact.py, archive-fact.mjs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Playground.Playground (cyclomatic 140) finding(s) in Cyclomatic Complexity — start with Playground.tsx. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 GraphView.GraphView (cyclomatic 126) finding(s) in Cyclomatic Complexity — start with GraphView.tsx. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

D2 · Cognitive Complexity5.7 / 10Adequate✓ 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 5.7 / 10 · rule-coverage 100% · ceiling Prevented

58 method(s) exceeded the cognitive complexity threshold of 15; the worst was GraphView.GraphView at 133.

GraphView.GraphView (cognitive 133)system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95

Playground.Playground (cognitive 128)system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87

check-doc-canon.main (cognitive 85)scripts/check-doc-canon.py:48

graphTransformer.computeLayout (cognitive 85)system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053

useGraphAuthoring.useGraphAuthoring (cognitive 81)system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:305

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

What to do

Resolve the 1 GraphView.GraphView (cognitive 133) finding(s) in Cognitive Complexity — start with GraphView.tsx. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Playground.Playground (cognitive 128) finding(s) in Cognitive Complexity — start with Playground.tsx. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 check-doc-canon.main (cognitive 85) finding(s) in Cognitive Complexity — start with check-doc-canon.py. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

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

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

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

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

74 god class(es) detected.

FunctionTooLong: GraphView.GraphView · ×20system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95

TooManyMethods: Utility · ×19REDACTED:50

FileTooLong: services/GraphCommandService.java · ×18system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java

ClassTooLong: GraphCommandService · ×17system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:55

What to do

Resolve the 20 FunctionTooLong finding(s) in God Classes — start with graphTransformer.ts (2), GraphView.tsx, useGraphAuthoring.ts. — One of this dimension's main actionable groups (20 warning-level).
Resolve the 19 TooManyMethods finding(s) in God Classes — start with REDACTED, GraphCommandService.java, REDACTED. — One of this dimension's main actionable groups (19 warning-level).
Resolve the 18 FileTooLong finding(s) in God Classes — start with GraphCommandService.java, graphTransformer.ts, TaskExecutor.java. — One of this dimension's main actionable groups (18 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D4 · Code Duplication9.3 / 10Stronggated by 120 serious findings✓ Tool-verified

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

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

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

111 duplicated block group(s) detected. A further 9 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 10 of the 120 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (7 lines × 2) · ×12system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterJson.java:67

Duplicated block (6 lines × 2) · ×11system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:332

Duplicated block (9 lines × 2) · ×9system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:52

Duplicated block (8 lines × 2) · ×7system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:55

Duplicated block (5 lines × 2) · ×7system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:744

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

What to do

Resolve the 12 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with GraphExtension.java (2), HttpConverterJson.java, SimpleHttpUtility.java. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 11 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with GraphApiFetcher.java (2), AsyncHttpResponse.java, JobLoader.java. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 9 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with AsyncInbox.java, EventEmitter.java, ConnectorConfig.java. — One of this dimension's main actionable groups (9 warning-level).

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

Do you agree with this assessment?

D7 · Architectural Integrity10.0 / 10Exemplary✓ Tool-verified

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

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

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

All 2 mechanizable ADR(s) are enforced: 2 by analyzers, 0 by tests. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).

✓ On the Gold path — maintain.

Detailed fixes: d7_recommendation.md.

Do you agree with this assessment?

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

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

1767 test methods: 1767 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 259 `it`/`test` case(s) across 41 test file(s) declaring at least one beside 1402 .NET test method(s); its tier split is read from package names and paths only. The Python suite contributes 106 test function(s) across 3 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

Do you agree with this assessment?

D10 · Test Quality8.9 / 10Strong✓ 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 8.9 / 10 · rule-coverage 100% · ceiling Prevented

1 skipped (1 with a documented reason), 106 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1402 tests. Measured on the .java suite only — at least 41 test source file(s) (.ts, .tsx) went unread, so its test quality is unmeasured and is not in these counts.

No assertions: uploadSingleFileWithMultipart · ×106examples/lambda-example/src/test/java/org/platformlambda/demo/MultiPartFileUploadTest.java:53

Skipped (documented): wrapsAnExportFailureWithContextAndCausesystem/ai-contract-provider/src/test/java/org/platformlambda/discovery/OfflineSkillWriterTest.java:93

What to do

Resolve the 106 No assertions finding(s) in Test Quality — start with FlowTests.java (33), LogContextConfigTest.java (5), RoutingRuleSetTest.java (3). — One of this dimension's main actionable groups (106 warning-level).

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots10.0 / 10Stronggated by 11 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: system/minigraph-playground-engine/webapp/src/components/Playground.tsx (6×80=480); system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx (6×58=348); system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java (17×15=255)

Hotspot: system/minigraph-playground-engine/webapp/src/components/Playground.tsx · ×11system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87

What to do

Resolve the 11 Hotspot finding(s) in Churn × Complexity Hotspots — start with Playground.tsx, GraphView.tsx, GraphCommandService.java. — One of this dimension's main actionable groups (11 warning-level).

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

Do you agree with this assessment?

D19 · Documentation QualityExemplary◐ Sampled · advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

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

Mercury Composable's documentation is clear and complete. It opens with a strong Getting Started guide that links to both Java and Rust versions, then dives into what Mercury is (independent functions wired via YAML flows), the three-layer architecture, and an A taste example before moving on to design docs, extensions, and a starter-graph template. The README files alone are 47; the architecture/Docs markdown set at 68 documents covers all the outlined sections with no gaps. This is an exceptionally well-organized project with a clear README for each component (ai-contract-provider, schema-registry-standalone, redis-standalone, kafka-standalone, sync-over-async, reactive-postgres-client, opentelemetry-forwarder, minigraph-state-redis, api-playground), covering what the module does, build/run steps, architecture contracts, and a detailed API reference for each endpoint. The documentation is comprehensive across all 120+ documents (47 READMEs + 68 architecture/Docs markdown files) with an outline for every section present in the visible text. The repository is well documented: the READMEs of each module (twin-kafka-demo, sync-over-async-demo, schema-registry-demo) are complete worked examples showing what they do and how to run them. The twin-kafka demo shows three roles (rest, bridge, sor), asymmetric cluster topologies, and a detailed trace diagram; the sync-over-async demo covers prerequisites, app-specific vs reused code, and a multi-terminal run with Redis-only Terminal A; the schema-registry demo is a minimalist curl-driven mock showing how to register and fetch Avro/JSON schemas. The architecture/design docs (68) cover twin-kafka's design rationale, the sync-over-async pattern, and cross-pod return routes, while the READMEs are self-contained with usage examples.

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

Do you agree with this assessment?

D20 · ADR QualityAdequate◐ Sampled · advisory

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

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

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

Evaluated 2 ADR(s) individually; mean quality 5.5/10 (mixed — many ADRs miss context or consequences). 1 flagged with a specific gap.

Context/problem and consequences are both present but sparse; only one decision (schema-registry standalone mock server) is named with rationale in body text rather than a dedicated Context/Decision sectionmemory/archive/2026-Q3.md

What to do

Resolve the 1 Context/problem and consequences are both present but sparse; only one… finding(s) in ADR Quality — start with 2026-Q3.md. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

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

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

Do you agree with this assessment?

D25 · ADR ConformanceExemplary◐ Sampled · advisory

What it measures: Whether the code actually follows the decisions recorded in the project's ADRs.

Method: Judged by language model at low temperature against ADRs plus a deterministic structural code summary; findings linked to repo-rooted ADR paths for traceability. Advisory.

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

1 conform / 0 violate across 2 ADRs.

✓ On the Gold path — maintain.

Detailed fixes: d25_recommendation.md.

Do you agree with this assessment?

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 REDACTED. 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.

Do you agree with this assessment?

D29 · Static Analysis (SAST)4.4 / 10Weak✓ Tool-verified

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

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

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

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

18 finding(s): 0 critical, 15 high, 2 medium, 1 low. 11 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 35 file(s) — `.githooks/pre-commit.d/50-agent-memory-secret-guard` (lines 44–148), `agent-skills/archive-fact/scripts/archive-fact.mjs`, `agent-skills/memory-lint/scripts/memory-lint.mjs` (lines 30–31, line 31, line 628), `agent-skills/refresh-metadata/scripts/refresh-metadata.mjs` (lines 20–22, line 68, line 69), `agent-skills/sync-adapters/scripts/sync-adapters.sh` (lines 70–73), … (+30 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

What to do

Resolve the 4 REDACTED finding(s) charged to Static Analysis (SAST) — the other 11 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (15 issue-level, 4 of them charged here).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D31 · IaC & Container Security9.5 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

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

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

REDACTED

What to do

Resolve the 1 REDACTED IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 REDACTED IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

Do you agree with this assessment?

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

Do you agree with this assessment?

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

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

What to do

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

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

Do you agree with this assessment?

Frontend & cross-cutting dimensions

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

AC2 · Forms & labels7.6 / 10Strong✓ Tool-verified

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

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

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

This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. — system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:130

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.

Do you agree with this assessment?

AC3 · Page structure3.7 / 10Weak✓ Tool-verified

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

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

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

The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×5) — connectors/adapters/kafka/kafka-presence/src/main/resources/public/index.html:2, connectors/core/service-monitor/src/main/resources/public/index.html:2, system/event-script-engine/src/main/resources/public/index.html:2, …
A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. (×5) — connectors/adapters/kafka/kafka-presence/src/main/resources/public/index.html:2, connectors/core/service-monitor/src/main/resources/public/index.html:2, system/event-script-engine/src/main/resources/public/index.html:2, …
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×8) — connectors/adapters/kafka/kafka-presence/src/main/resources/public/index.html:2, connectors/core/service-monitor/src/main/resources/public/index.html:2, system/event-script-engine/src/main/resources/public/index.html:2, …
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="root">, so there is no content here to wrap — render the <main> from the component mounted into it. (×2) — system/minigraph-playground-engine/src/main/resources/public/index.html:2, system/minigraph-playground-engine/webapp/index.html:2
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). — system/platform-core/src/main/resources/errorPage.html:13

What to do

Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

Do you agree with this assessment?

AC4 · Keyboard semantics5.2 / 10Adequate✓ Tool-verified

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

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

Coverage: Population: interactive elements plus elements the markup gives a click/key handler or the repo's own CSS styles `cursor: pointer`, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".

This <span> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}="0" so the element can receive that focus. — system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:71

What to do

Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.

Do you agree with this assessment?

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

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

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

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

Do you agree with this assessment?

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

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

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

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

Do you agree with this assessment?

AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 52 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.

Do you agree with this assessment?

AX10 · Code composition9.5 / 10Exemplary✓ Tool-verified

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

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

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

What to do

The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

AX7 · Slice cohesion5.3 / 10Adequate✓ Tool-verified

Other · Architecture — Whether feature slices stay independent (no direct cross-slice references) — the discipline that makes vertical-slice architecture pay off.

Method: Roslyn scan (vertical-slice gated): feature slices resolved from namespaces (.Features.*, .Slices.*) or project names; cross-slice type references detected. Deterministic, traceable.

`SecondaryKafkaRuntime` (slice 'twin-kafka') depends on `KafkaRequestPublisher` from slice 'minimalist-kafka'. — system/twin-kafka/src/main/java/org/platformlambda/twin/kafka/SecondaryKafkaRuntime.java:31
`CompileGraph` (slice 'minigraph-playground-engine') depends on `SimpleTypeMatchingConverter` from slice 'event-script-engine'. — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/start/CompileGraph.java:75
`GraphLambdaFunction` (slice 'minigraph-playground-engine') depends on `DataMappingHelper` from slice 'event-script-engine'. — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:41
`GraphCommandService` (slice 'minigraph-playground-engine') depends on `SimpleTypeMatchingConverter` from slice 'event-script-engine'. — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:55
`StreamProducer` (slice 'sync-over-async-demo') depends on `StreamResponder` from slice 'sync-over-async'. — examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/stream/StreamProducer.java:63

What to do

Keep slices independent: share cross-slice needs via an explicit contract/shared-kernel, not direct references between slices.

Do you agree with this assessment?

M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

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.
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 14 of 43 project(s) that lack one — worth up to 0.7 pts.

Do you agree with this assessment?

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

What to do

Grow the ADR log (currently 2) — reach 8 to raise the maturity tier; document significant decisions as they're made.

Do you agree with this assessment?

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

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

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

Do you agree with this assessment?

M4 · Documentation accuracy10.0 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

Do you agree with this assessment?

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.

Do you agree with this assessment?

P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 11581 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

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

Do you agree with this assessment?

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

Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

Do you agree with this assessment?

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.

Do you agree with this assessment?

R1 · Type Safety9.4 / 10Exemplary✓ 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.

What to do

Migrate the remaining .js/.jsx files to TypeScript.

Do you agree with this assessment?

R10 · Code Duplication8.7 / 10Strong✓ Tool-verified

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

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

12 duplicated blocks under system/minigraph-playground-engine/webapp/src/components/ have copies in at least two of the sibling directories ClipboardSidebar, ConnectionPopover, Console, GraphDataView, GraphView, LeftPanel (+4 more sibling(s) not listed) — 8 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 12 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 12 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 12 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. — system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:44
7 duplicated blocks under agent-skills/ have copies in at least two of the sibling directories archive-fact, memory-lint, refresh-metadata — 6 of them are reported below, and 1 is 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 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 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 7 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. — agent-skills/archive-fact/scripts/archive-fact.mjs:21
system/minigraph-playground-engine/webapp/src/components/GraphView/EdgeContextMenu.tsx:35 · system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:63 — the two spans are one implementation copied and then locally edited — 354 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — system/minigraph-playground-engine/webapp/src/components/GraphView/EdgeContextMenu.tsx:35
system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:44 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:57 — the two spans are one implementation copied and then locally edited — 198 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. — system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:44
system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:219 · system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:257 — 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. — system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:219
system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:55 · system/minigraph-playground-engine/webapp/src/components/GraphView/EdgeContextMenu.tsx:62 · system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:99 — the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:55
system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:182 · system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:216 — 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. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:182
agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs:43 · agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs:131 — the two spans are one implementation copied and then locally edited — 194 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs:43
system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:47 · system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:122 — 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. — system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:47
system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:110 · system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:147 — the two spans are one implementation copied and then locally edited — 68 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:110
system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:49 · system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:79 — 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. — system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:49
system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:24 — the two spans are one implementation copied and then locally edited — 101 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. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106
system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:414 · system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:451 — 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. — system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:414
system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1525 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1543 — 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. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1525
agent-skills/archive-fact/scripts/archive-fact.mjs:21 · agent-skills/memory-lint/scripts/memory-lint.mjs:42 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — agent-skills/archive-fact/scripts/archive-fact.mjs:21
agent-skills/memory-lint/scripts/test_memory_lint.mjs:297 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:320 — 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. — agent-skills/memory-lint/scripts/test_memory_lint.mjs:297
system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:88 · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:59 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:88
system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:548 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:561 — 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. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:548
system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:149 · system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:163 — 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. — system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:149
system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:433 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:117 — the two spans are one implementation copied and then locally edited — 73 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. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:433
system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:218 · system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:241 — 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. — system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:218
agent-skills/archive-fact/scripts/test_archive_fact.mjs:90 · agent-skills/archive-fact/scripts/test_archive_fact.mjs:103 — 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. — agent-skills/archive-fact/scripts/test_archive_fact.mjs:90
agent-skills/memory-lint/scripts/memory-lint.mjs:140 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:84 — 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. — agent-skills/memory-lint/scripts/memory-lint.mjs:140
agent-skills/memory-lint/scripts/test_memory_lint.mjs:355 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:419 — 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. — agent-skills/memory-lint/scripts/test_memory_lint.mjs:355
system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:197 · system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:212 — 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. — system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:197
agent-skills/memory-lint/scripts/memory-lint.mjs:472 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:96 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — agent-skills/memory-lint/scripts/memory-lint.mjs:472
system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:118 — the two spans are one implementation copied and then locally edited — 52 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. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106
system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:514 · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphViewErrorBoundary.tsx:41 — the two spans are one implementation copied and then locally edited — 54 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. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:514
agent-skills/archive-fact/scripts/test_archive_fact.mjs:43 · agent-skills/archive-fact/scripts/test_archive_fact.mjs:62 — 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. — agent-skills/archive-fact/scripts/test_archive_fact.mjs:43
agent-skills/archive-fact/scripts/test_archive_fact.mjs:106 · agent-skills/archive-fact/scripts/test_archive_fact.mjs:118 — 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. — agent-skills/archive-fact/scripts/test_archive_fact.mjs:106
system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:24 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:117 — the two spans are one implementation copied and then locally edited — 54 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. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:24
system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:155 · system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:173 · system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:208 — all 3 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. — system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:155
agent-skills/memory-lint/scripts/test_memory_lint.mjs:262 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:510 — 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. — agent-skills/memory-lint/scripts/test_memory_lint.mjs:262
agent-skills/memory-lint/scripts/test_memory_lint.mjs:553 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:874 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:914 — all 3 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. — agent-skills/memory-lint/scripts/test_memory_lint.mjs:553
system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:240 · system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:194 — 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. — system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:240
system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx:15 · system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx:24 — 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. — system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx:15
system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:36 · system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:121 — 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. — system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:36
system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:157 · system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:194 — 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. — system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:157
agent-skills/memory-lint/scripts/memory-lint.mjs:88 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:60 — 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. — agent-skills/memory-lint/scripts/memory-lint.mjs:88
agent-skills/memory-lint/scripts/memory-lint.mjs:113 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:49 — 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. — agent-skills/memory-lint/scripts/memory-lint.mjs:113

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.

Do you agree with this assessment?

R2 · Cyclomatic Complexity7.6 / 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.

Playground has cyclomatic complexity 80 and cognitive complexity 74; 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. — system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87
GraphView has cyclomatic complexity 58 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 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. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95
computeLayout has cyclomatic complexity 51 and cognitive complexity 86; 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. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053
classifyMessage has cyclomatic complexity 40 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. — system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:44
ConsoleMessage has cyclomatic complexity 33 and cognitive complexity 29; 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. — system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:35
NodeContextMenu has cyclomatic complexity 33 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 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. — system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:39
archive_facts has cyclomatic complexity 26 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. — agent-skills/archive-fact/scripts/archive-fact.mjs:91
scan_lines has cyclomatic complexity 25 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — agent-skills/memory-lint/scripts/memory-lint.mjs:956
main has cyclomatic complexity 22 and cognitive complexity 36; 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. — agent-skills/memory-lint/scripts/memory-lint.mjs:1046
minimizeCrossings has cyclomatic complexity 22 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. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:703
RightPanel 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. — system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:67
check_undeclared_references has cyclomatic complexity 21 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. — agent-skills/memory-lint/scripts/memory-lint.mjs:700
handleWheel has cyclomatic complexity 21 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. — system/minigraph-playground-engine/webapp/src/hooks/useHelpScrollNavigation.ts:109
SessionMenuContent has cyclomatic complexity 21 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. — system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:34
validateNodeFormState has cyclomatic complexity 19 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. — system/minigraph-playground-engine/webapp/src/graphActions/validation.ts:58
collectPathsFromText has cyclomatic complexity 19 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. — system/minigraph-playground-engine/webapp/src/graphRun/graphInputPaths.ts:14
MockUploadPanel has cyclomatic complexity 16 and cognitive complexity 15; 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. — system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:71
segmentsIntersect has cyclomatic complexity 16 and cognitive complexity 15; 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. — system/minigraph-playground-engine/webapp/src/utils/__tests__/graphTransformer.test.ts:187
NodeEditPanel has cyclomatic complexity 16 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. — system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:47
transposeForBetterScore has cyclomatic complexity 15 and cognitive complexity 46; 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. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:642

What to do

Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.

Do you agree with this assessment?

R3 · Large Files8.3 / 10Strong✓ Tool-verified

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

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

What to do

Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.

Do you agree with this assessment?

R4 · Test Coverage8.8 / 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. (×13) — agent-skills/memory-lint/scripts/test_memory_lint.mjs, agent-skills/memory-lint/scripts/memory-lint.mjs, templates/starter-graph/scripts/playground-session-broker.mjs, …

What to do

9 of the 13 unreached modules are entry points — the browser loads some as a top-level script and something else executes the rest by path, so no import specifier addresses them and no public entry publishes them. An importing test cannot be written for them as they ship, and two different things are worth doing here — they are not the same thing. To EXERCISE them, a browser or end-to-end suite that loads the page, or a test that runs the script the way its caller does; that is worth having, but it will NOT clear this row, because reachability is measured over the import graph and running a file by path adds no edge to it. To CLEAR it, make them addressable: lift the logic into a module a test can import and leave the entry points thin shims over it, or put their bodies behind a main-guard (`import.meta.url === argv[1]`) and export them. Add tests that import the other 4 — directly or through their public entry.

Do you agree with this assessment?

R5 · Dependency Freshness8.6 / 10Strong✓ Tool-verified

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

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

What to do

Bump outdated dependencies to current versions to limit upgrade debt.

Do you agree with this assessment?

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

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

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

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

What to do

Add eslint as package.json scripts and run them in CI.

Do you agree with this assessment?

R7 · Dead Code9.3 / 10Exemplary✓ Tool-verified

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

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

Unreachable from the 8 application, 8 tooling and 41 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (8 application, 8 tooling, 41 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 (×4) — agent-skills/archive-fact/scripts/test_archive_fact.mjs, agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs, system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts, …
Nothing imports this binding — it is safe to review for removal. (×6) — system/minigraph-playground-engine/webapp/src/clipboard/commandBuilder.ts:62, system/minigraph-playground-engine/webapp/src/clipboard/db.ts:95, system/minigraph-playground-engine/webapp/src/data/helpContent.ts:193, …

What to do

Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.

Do you agree with this assessment?

R8 · Dependency Hygiene9.5 / 10Exemplary✓ Tool-verified

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

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

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

What to do

Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

WCAG coverage — what static analysis assessed

Statically assessed 12 of 55 WCAG 2.2 Level A/AA success criteria (22%; ≈24% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 43 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).

Dimension	WCAG 2.2 A/AA criteria	Coverage
AC2 · Forms & labels	1.3.1, 3.3.2, 4.1.2	Partial signal
AC3 · Page structure	1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2	Partial signal
AC4 · Keyboard semantics	2.1.1, 2.4.3	Partial signal
AC5 · ARIA correctness	4.1.2	Partial signal
AC6 · Visual & motion safety	1.4.3, 2.4.7	Partial — literal CSS only
AC7 · A11y enforcement	enforcement — no page criterion	Enforcement posture (process)

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

Reference — by lens

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

Lens	Score	Rating	Impact
Code Health	81%	Strong	Solid.
Architecture	84%	Strong	Strongest area.
Maturity	84%	Strong	Solid.
Readiness	56%	Adequate — gated by P3	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security	60%	Adequate — gated by D36	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility	56%	Adequate — gated by AC3	Capped at Fair by a Critical contributor — resolve it before relying on this lens.

Not evidenced — 4 control(s) we could not find positive evidence for

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

C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control

Not included — 76 check(s) not relevant to this codebase

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

AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph 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
AX4 Dependency direction — not applicable to a vertical-slice + CQRS architecture (the inward-dependency rule is for layered/clean styles)
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface 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
AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) 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
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.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D11 Test Reliability — Test reliability not scored — polyglot repository, one half has no runner
D12 Dependency Hygiene — Dependency Hygiene incomplete (time budget)
D14 License Compliance — License Compliance not included (check did not complete)
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — Production source is present (.java, .kt, .py, .ts, .tsx) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — symbol resolution incomplete — navigability not assessed
D30 Dependency Vulnerabilities — Scanner failed to run — not a clean result
D32 Data Compliance (PII/GDPR) — 29 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
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.
D43 Malicious Dependencies — Scanner failed to run — not a clean result
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
D6 Cohesion (LCOM4) — Cohesion (LCOM4) is measured over a CS/VB/GO/SCALA/SWIFT/DART class graph, and this repository's production source is .java, .kt, .py, .ts, .tsx, which this pass does not read — so no class could be assessed. Not scored — this is a gap in the analyzer, not a finding about this repository.
D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — system/minigraph-playground-engine/webapp/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 93 value object(s); 1 domain event(s)
ED1 Event-Driven — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 1 event handler(s); 6 CQRS handler(s)
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows only 1 of the 3 signals this lens looks for (an Axon event-sourcing framework (@Aggregate/@CommandHandler/@EventSourcingHandler annotations))
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
P8 Schema migrations — not assessed — schema-migration practice is read from 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
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (JaCoCo XML — `mvn jacoco:report`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — 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
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — 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
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not 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
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 — 28 finding(s)

D29 · Static Analysis (SAST) · REDACTED · ×15

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

AC3 · Page structure · <html> without a lang · ×5

<html> without a lang connectors/adapters/kafka/kafka-presence/src/main/resources/public/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang connectors/core/service-monitor/src/main/resources/public/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang system/event-script-engine/src/main/resources/public/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang system/minigraph-playground-engine/src/main/resources/template/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang system/platform-core/src/main/resources/public/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").

AC3 · Page structure · Document without a <title> · ×5

Document without a <title> connectors/adapters/kafka/kafka-presence/src/main/resources/public/index.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
Document without a <title> connectors/core/service-monitor/src/main/resources/public/index.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
Document without a <title> system/event-script-engine/src/main/resources/public/index.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
Document without a <title> system/minigraph-playground-engine/src/main/resources/template/index.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
Document without a <title> system/platform-core/src/main/resources/public/index.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.

AC2 · Forms & labels · <input> without a programmatic label · ×1

<input> without a programmatic label system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:130 — 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.

AC4 · Keyboard semantics · Hover-only interaction on <span> · ×1

Hover-only interaction on <span> system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:71 — This <span> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}="0" so the element can receive that focus.

D31 · IaC & Container Security · REDACTED IaC · ×1

REDACTED

Serious — 518 finding(s)

D10 · Test Quality · No assertions · ×106

No assertions: uploadSingleFileWithMultipart examples/lambda-example/src/test/java/org/platformlambda/demo/MultiPartFileUploadTest.java:53 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: jobListToleratesAStateFileCaughtMidWrite examples/scheduler-example/src/test/java/org/platformlambda/quartz/tests/ScheduleAdminTest.java:129 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: missingGraphIdIsRejected extensions/minigraph-state-redis/src/test/java/org/platformlambda/graph/redis/RedisStateStoreTest.java:261 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: exporterReachesBothBackendPaths extensions/opentelemetry-forwarder/src/test/java/org/platformlambda/opentelemetry/support/OtlpComposableExportTest.java:77 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: parsesLiteralHttpHeaderSyntax extensions/opentelemetry-forwarder/src/test/java/org/platformlambda/opentelemetry/support/OtlpComposableExportTest.java:173 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: asyncCommandsPipelineOverTheSameConnection extensions/redis-connection/src/test/java/org/platformlambda/redis/RedisBackendFactoryTest.java:71 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: explicitClusterModeRoutesToTheClusterBranch extensions/redis-connection/src/test/java/org/platformlambda/redis/RedisBackendFactoryTest.java:93 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: authRejectionsCountAsWaitingButOutagesDoNot extensions/redis-connection/src/test/java/org/platformlambda/redis/RedisHealthProbeLazyConfigTest.java:134 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: idleExpiryWithNothingQueuedFailsInBandAndStopsProducers extensions/sync-over-async/src/test/java/org/platformlambda/async/StreamingRestE2eTest.java:304 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: finalDrainAtIdleExpiryRecoversADroppedClose extensions/sync-over-async/src/test/java/org/platformlambda/sync/StreamReturnRouteTest.java:307 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: largePayload system/platform-core/src/test/java/org/platformlambda/core/util/ElasticStoreContractTest.java:88 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: normalPayload system/platform-core/src/test/java/org/platformlambda/core/util/ElasticStoreContractTest.java:83 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: anApplicationsOwnKeyNameForUtcIsKept system/platform-core/src/test/java/org/platformlambda/core/logging/LogContextConfigTest.java:186 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: bothKeysTakenLeavesTheApplicationConfigAlone system/platform-core/src/test/java/org/platformlambda/core/logging/LogContextConfigTest.java:217 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: builtInDefaultProvidesFullTraceContext system/platform-core/src/test/java/org/platformlambda/core/logging/LogContextConfigTest.java:40 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: enabledByDefaultWhenAppFileAbsent system/platform-core/src/test/java/org/platformlambda/core/logging/LogContextConfigTest.java:59 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: utcIsInsertedWhenTheTemplateOmitsIt system/platform-core/src/test/java/org/platformlambda/core/logging/LogContextConfigTest.java:167 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: envInstancesIsConfigKeyLookupWithAnnotationFallback system/platform-core/src/test/java/org/platformlambda/core/ClaimEnvInstancesConfigKeyTest.java:51 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: largePayload system/platform-core/src/test/java/org/platformlambda/core/ElasticQueueTest.java:65 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: normalPayload system/platform-core/src/test/java/org/platformlambda/core/ElasticQueueTest.java:60 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: numberInMapTest system/platform-core/src/test/java/org/platformlambda/core/EventEnvelopeTest.java:369 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: standardMapAlwaysCarriesIdAndHeaders system/platform-core/src/test/java/org/platformlambda/core/EventEnvelopeTest.java:493 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: eventApiServiceIsAVisibleSpanInTheTrace system/platform-core/src/test/java/org/platformlambda/core/EventHttpTest.java:476 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: remoteTimeoutArrivesInBand system/platform-core/src/test/java/org/platformlambda/core/EventHttpTest.java:353 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: fluxPublisherExpiryTest system/platform-core/src/test/java/org/platformlambda/core/ObjectStreamTest.java:247 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
+ 81 more in this group — see findings.md.

D3 · God Classes · FunctionTooLong · ×20

FunctionTooLong: GraphView.GraphView system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95 — FunctionTooLong — GraphView runs 544 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 444 over it, 5.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: useGraphAuthoring.useGraphAuthoring system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:305 — FunctionTooLong — useGraphAuthoring runs 337 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 237 over it, 3.37× 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: NodeEditPanel.NodeEditPanel system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:47 — FunctionTooLong — NodeEditPanel runs 277 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 177 over it, 2.77× 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: useGraphRunWorkflow.useGraphRunWorkflow system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:76 — FunctionTooLong — useGraphRunWorkflow runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54× 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: MockUploadPanel.MockUploadPanel system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:71 — FunctionTooLong — MockUploadPanel runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31× 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: useSessionCollaboration.useSessionCollaboration system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:40 — FunctionTooLong — useSessionCollaboration runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21× 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: ClipboardSidebar.ClipboardSidebar system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:47 — FunctionTooLong — ClipboardSidebar runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98× 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: RightPanel.RightPanel system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:67 — FunctionTooLong — RightPanel runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97× 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: classifier.classifyMessage system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:44 — FunctionTooLong — classifyMessage runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: graphTransformer.computeLayout system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053 — FunctionTooLong — computeLayout runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× 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: WebSocketContext.WebSocketProvider system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:182 — FunctionTooLong — WebSocketProvider runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69× 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: NodeContextMenu.NodeContextMenu system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:39 — FunctionTooLong — NodeContextMenu runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× 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: useWebSocket.useWebSocket system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:115 — FunctionTooLong — useWebSocket runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52× 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: HelpBrowser.HelpBrowser system/minigraph-playground-engine/webapp/src/components/HelpBrowser/HelpBrowser.tsx:64 — FunctionTooLong — HelpBrowser runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× 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: GraphMinimap.GraphMinimap system/minigraph-playground-engine/webapp/src/components/GraphView/GraphMinimap.tsx:83 — FunctionTooLong — GraphMinimap 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: SessionMenu.SessionMenuContent system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:34 — FunctionTooLong — SessionMenuContent runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× 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: graphTransformer.minimizeCrossings system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:703 — FunctionTooLong — minimizeCrossings runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× 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: ConnectionPopover.ConnectionPopover system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:34 — FunctionTooLong — ConnectionPopover runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× 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: ConsoleMessage.ConsoleMessage system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:35 — FunctionTooLong — ConsoleMessage runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× 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: NodeTypes.MinigraphNode system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:22 — FunctionTooLong — MinigraphNode runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D3 · God Classes · TooManyMethods · ×19

TooManyMethods: Utility REDACTED:50 — TooManyMethods — 109 methods. The bar is 30 methods; this is 79 over it, 3.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: GraphCommandService system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:55 — TooManyMethods — 99 methods. The bar is 30 methods; this is 69 over it, 3.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: EventEnvelope REDACTED:26 — TooManyMethods — 83 methods. The bar is 30 methods; this is 53 over it, 2.77× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AsyncHttpRequest system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:34 — TooManyMethods — 80 methods. The bar is 30 methods; this is 50 over it, 2.67× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: EventEmitter system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:48 — TooManyMethods — 77 methods. The bar is 30 methods; this is 47 over it, 2.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TaskExecutor system/event-script-engine/src/main/java/com/accenture/automation/TaskExecutor.java:50 — TooManyMethods — 64 methods. The bar is 30 methods; this is 34 over it, 2.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.
TooManyMethods: RoutingEntry system/platform-core/src/main/java/org/platformlambda/automation/config/RoutingEntry.java:38 — TooManyMethods — 54 methods. The bar is 30 methods; this is 24 over it, 1.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: GraphLambdaFunction system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:41 — TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Platform system/platform-core/src/main/java/org/platformlambda/core/system/Platform.java:47 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PostOffice system/platform-core/src/main/java/org/platformlambda/core/system/PostOffice.java:34 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: HttpRouter system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:63 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SqlPreparedStatement extensions/reactive-postgres/src/main/java/org/platformlambda/db/SqlPreparedStatement.java:39 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MiniGraph system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:36 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CompileFlows system/event-script-engine/src/main/java/com/accenture/automation/CompileFlows.java:48 — TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: EventStreamRenderer system/platform-core/src/main/java/org/platformlambda/automation/services/EventStreamRenderer.java:55 — TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AppStarter system/platform-core/src/main/java/org/platformlambda/core/system/AppStarter.java:58 — TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CryptoApi system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:38 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DataMappingHelper system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:39 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TypeConversionUtils system/event-script-engine/src/main/java/com/accenture/util/TypeConversionUtils.java:26 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.

D3 · God Classes · FileTooLong · ×18

FileTooLong: services/GraphCommandService.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java — FileTooLong — 1281 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GraphCommandService (55-1875). The bar is 500 significant lines; this is 781 over it, 2.56× 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: utils/graphTransformer.ts system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts — FileTooLong — 1047 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 547 over it, 2.09× 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: automation/TaskExecutor.java system/event-script-engine/src/main/java/com/accenture/automation/TaskExecutor.java — FileTooLong — 990 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TaskExecutor (50-1442). The bar is 500 significant lines; this is 490 over it, 1.98× 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: system/EventEmitter.java system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java — FileTooLong — 876 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: EventEmitter (48-1627). The bar is 500 significant lines; this is 376 over it, 1.75× 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: REDACTED REDACTED — FileTooLong — 846 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Utility (50-1470). The bar is 500 significant lines; this is 346 over it, 1.69× 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: services/HttpRouter.java system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java — FileTooLong — 765 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: HttpRouter (63-1105). The bar is 500 significant lines; this is 265 over it, 1.53× 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: scripts/memory-lint.py agent-skills/memory-lint/scripts/memory-lint.py — FileTooLong — 739 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 239 over it, 1.48× 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 — 732 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AsyncHttpClient (68-1130). The bar is 500 significant lines; this is 232 over it, 1.46× 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: config/RoutingEntry.java system/platform-core/src/main/java/org/platformlambda/automation/config/RoutingEntry.java — FileTooLong — 689 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: RoutingEntry (38-1016). The bar is 500 significant lines; this is 189 over it, 1.38× 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: components/Playground.tsx system/minigraph-playground-engine/webapp/src/components/Playground.tsx — FileTooLong — 674 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 174 over it, 1.35× 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: scripts/memory-lint.mjs agent-skills/memory-lint/scripts/memory-lint.mjs — FileTooLong — 672 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 172 over it, 1.34× 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: automation/CompileFlows.java system/event-script-engine/src/main/java/com/accenture/automation/CompileFlows.java — FileTooLong — 643 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: CompileFlows (48-966). The bar is 500 significant lines; this is 143 over it, 1.29× 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: system/AppStarter.java system/platform-core/src/main/java/org/platformlambda/core/system/AppStarter.java — FileTooLong — 643 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AppStarter (58-903). The bar is 500 significant lines; this is 143 over it, 1.29× 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: common/GraphLambdaFunction.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java — FileTooLong — 641 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GraphLambdaFunction (41-1000). The bar is 500 significant lines; this is 141 over it, 1.28× 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: GraphView/GraphView.tsx system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx — FileTooLong — 612 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: GraphView (95-830). The bar is 500 significant lines; this is 112 over it, 1.22× 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: REDACTED REDACTED — FileTooLong — 577 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: EventEnvelope (26-1204). The bar is 500 significant lines; this is 77 over it, 1.15× 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: GraphAuthoring/useGraphAuthoring.ts system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts — FileTooLong — 556 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: useGraphAuthoring (305-786). The bar is 500 significant lines; this is 56 over it, 1.11× 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: models/AsyncHttpRequest.java system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java — FileTooLong — 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: AsyncHttpRequest (34-882). The bar is 500 significant lines; this is 24 over it, 1.05× 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.

D3 · God Classes · ClassTooLong · ×17

ClassTooLong: GraphCommandService system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:55 — ClassTooLong — 1248 significant lines (blank, comment-only and punctuation-only lines excluded), 99 methods. The bar is 400 significant lines; this is 848 over it, 3.12× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: TaskExecutor system/event-script-engine/src/main/java/com/accenture/automation/TaskExecutor.java:50 — ClassTooLong — 966 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods. The bar is 400 significant lines; this is 566 over it, 2.42× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: EventEmitter system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:48 — ClassTooLong — 853 significant lines (blank, comment-only and punctuation-only lines excluded), 77 methods. The bar is 400 significant lines; this is 453 over it, 2.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.
ClassTooLong: Utility REDACTED:50 — ClassTooLong — 821 significant lines (blank, comment-only and punctuation-only lines excluded), 109 methods. The bar is 400 significant lines; this is 421 over it, 2.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: AsyncHttpClient REDACTED:68 — ClassTooLong — 686 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 286 over it, 1.72× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: RoutingEntry system/platform-core/src/main/java/org/platformlambda/automation/config/RoutingEntry.java:38 — ClassTooLong — 676 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 276 over it, 1.69× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: HttpRouter system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:63 — ClassTooLong — 670 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 270 over it, 1.68× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CompileFlows system/event-script-engine/src/main/java/com/accenture/automation/CompileFlows.java:48 — ClassTooLong — 628 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 228 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: GraphLambdaFunction system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:41 — ClassTooLong — 623 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 223 over it, 1.56× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: AppStarter system/platform-core/src/main/java/org/platformlambda/core/system/AppStarter.java:58 — ClassTooLong — 607 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 207 over it, 1.52× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: EventEnvelope REDACTED:26 — ClassTooLong — 568 significant lines (blank, comment-only and punctuation-only lines excluded), 83 methods. The bar is 400 significant lines; this is 168 over it, 1.42× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: GraphView system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:1 — ClassTooLong — 544 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 144 over it, 1.36× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: AsyncHttpRequest system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:34 — ClassTooLong — 512 significant lines (blank, comment-only and punctuation-only lines excluded), 80 methods. The bar is 400 significant lines; this is 112 over it, 1.28× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: MiniGraph system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:36 — ClassTooLong — 434 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 34 over it, 1.09× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: WorkerHandler system/platform-core/src/main/java/org/platformlambda/core/system/WorkerHandler.java:46 — ClassTooLong — 423 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 23 over it, 1.06× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DataMappingHelper system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:39 — ClassTooLong — 420 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 20 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Platform system/platform-core/src/main/java/org/platformlambda/core/system/Platform.java:47 — ClassTooLong — 412 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 12 over it, 1.03× 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.

R4 · Test Coverage · No test reaches this file · ×13

No test reaches this file agent-skills/memory-lint/scripts/test_memory_lint.mjs — 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 agent-skills/memory-lint/scripts/memory-lint.mjs — 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 templates/starter-graph/scripts/playground-session-broker.mjs — 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 agent-skills/archive-fact/scripts/archive-fact.mjs — 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 agent-skills/refresh-metadata/scripts/refresh-metadata.mjs — 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 agent-skills/archive-fact/scripts/test_archive_fact.mjs — 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 agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs — 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 system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts — 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 agent-skills/sync-adapters/scripts/sync-adapters.mjs — 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 system/minigraph-playground-engine/webapp/src/App.tsx — 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 system/minigraph-playground-engine/webapp/src/main.tsx — 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 system/minigraph-playground-engine/webapp/scripts/clean.js — 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 system/minigraph-playground-engine/webapp/scripts/deploy.js — 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.

D4 · Code Duplication · Duplicated block (7 lines × 2) · ×12

Duplicated block (7 lines × 2) system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterJson.java:67 — system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterJson.java:67-73 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterText.java:61-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterJson.java:67` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/util/SimpleHttpUtility.java:170 — system/platform-core/src/main/java/org/platformlambda/automation/util/SimpleHttpUtility.java:170-176 | system/rest-spring-4/src/main/java/org/platformlambda/spring/system/HttpErrorHandler.java:101-107 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:60 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:60-66 | system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:62-68 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:60` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1379 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1379-1385 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1480-1486 — 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 (7 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:239 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:239-245 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:273-279 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:246` calls `put` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:280` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:110 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:110-116 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:214-220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:110` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:149 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:149-155 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:217-223 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:149` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/GreaterThanOperator.java:35 — system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/GreaterThanOperator.java:35-41 | system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/LessThanOperator.java:35-41 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/GreaterThanOperator.java:35` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java:42 — system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java:42-48 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDateTime.java:42-48 — before extracting anything, compare `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java` and `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDateTime.java` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java:42` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:97 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:97-103 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:87-93 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java:268 — extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java:268-274 | system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaHealthCheck.java:506-512 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) examples/rest-spring-4-example/src/main/java/com/accenture/examples/rest/AsyncHelloConcurrent.java:43 — examples/rest-spring-4-example/src/main/java/com/accenture/examples/rest/AsyncHelloConcurrent.java:43-49 | examples/rest-spring-4-example/src/main/java/com/accenture/examples/rest/AsyncHelloWorld.java:42-48 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D15 · Churn × Complexity Hotspots · Hotspot · ×11

Hotspot: system/minigraph-playground-engine/webapp/src/components/Playground.tsx system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87 — system/minigraph-playground-engine/webapp/src/components/Playground.tsx changed 6 times in last 90 days, max cyclomatic complexity 80 in Playground at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/Playground.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.
Hotspot: system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx changed 6 times in last 90 days, max cyclomatic complexity 58 in GraphView at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.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.
Hotspot: system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:366 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java changed 17 times in last 90 days, max cyclomatic complexity 15 in GraphCommandService.handleCommandPartTwo at line 366. 6 of those changes were fix/bug commits, and the other 11 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-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java`: 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: system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts changed 2 times in last 90 days, max cyclomatic complexity 51 in computeLayout at line 1053. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/utils/graphTransformer.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: system/minigraph-playground-engine/webapp/src/protocol/classifier.ts system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:44 — system/minigraph-playground-engine/webapp/src/protocol/classifier.ts changed 2 times in last 90 days, max cyclomatic complexity 40 in classifyMessage at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/protocol/classifier.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: system/minigraph-playground-engine/webapp/src/graphActions/validation.ts system/minigraph-playground-engine/webapp/src/graphActions/validation.ts:58 — system/minigraph-playground-engine/webapp/src/graphActions/validation.ts changed 4 times in last 90 days, max cyclomatic complexity 19 in validateNodeFormState at line 58. 1 of those changes was a fix/bug commit, and the other 3 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-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/graphActions/validation.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: system/platform-core/src/main/java/org/platformlambda/core/serializers/MsgPack.java system/platform-core/src/main/java/org/platformlambda/core/serializers/MsgPack.java:263 — system/platform-core/src/main/java/org/platformlambda/core/serializers/MsgPack.java changed 3 times in last 90 days, max cyclomatic complexity 24 in MsgPack.pack at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/platform-core/src/main/java/org/platformlambda/core/serializers/MsgPack.java`: 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: system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:67 — system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx changed 3 times in last 90 days, max cyclomatic complexity 22 in RightPanel at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.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.
Hotspot: system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:39 — system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx changed 2 times in last 90 days, max cyclomatic complexity 33 in NodeContextMenu at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.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.
Hotspot: system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroConversions.java system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroConversions.java:58 — system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroConversions.java changed 2 times in last 90 days, max cyclomatic complexity 19 in AvroConversions.toAvro at line 58. 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-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroConversions.java`: 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: system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:610 — system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts changed 2 times in last 90 days, max cyclomatic complexity 15 in (anonymous) at line 610. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-22..2026-09-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-22 21:18:10 -07:00' --until='2026-09-20 21:18:10 -07:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.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.

D4 · Code Duplication · Duplicated block (6 lines × 2) · ×11

Duplicated block (6 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:332 — system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:332-337 | system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:356-361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:332` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:165 — system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:165-170 | REDACTED:798-803 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:165` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroSchemaSerde.java:114 — system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/AvroSchemaSerde.java:114-119 | system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/schema/JsonSchemaSerde.java:122-127 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:244 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:244-249 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:150-155 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:244` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `stack` to `Deque<HttpEventEnvelope>` in one and `Deque<EventEnvelope>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (6 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:223 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:223-228 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:162-167 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:223` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) system/event-script-engine/src/main/java/com/accenture/mock/EventScriptMock.java:67 — system/event-script-engine/src/main/java/com/accenture/mock/EventScriptMock.java:67-72 | system/event-script-engine/src/main/java/com/accenture/mock/EventScriptMock.java:127-132 — 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 (6 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:55 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:55-60 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:95-100 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:55` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:91` calls `equals`, `getProperty` and `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:51` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:245 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:245-250 | REDACTED:335-340 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/LogicalConjunction.java:36 — system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/LogicalConjunction.java:36-41 | system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/LogicalDisjunction.java:36-41 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:164 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:164-169 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:94-99 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) extensions/reactive-postgres/src/main/java/org/platformlambda/postgres/services/PgService.java:145 — extensions/reactive-postgres/src/main/java/org/platformlambda/postgres/services/PgService.java:145-150 | extensions/reactive-postgres/src/main/java/org/platformlambda/postgres/services/PgService.java:151-156 — 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.

AC3 · Page structure · Page without a main landmark · ×10

Page without a main landmark connectors/adapters/kafka/kafka-presence/src/main/resources/public/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark connectors/core/service-monitor/src/main/resources/public/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark system/event-script-engine/src/main/resources/public/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark system/minigraph-playground-engine/src/main/resources/public/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="root">, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark system/minigraph-playground-engine/src/main/resources/template/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark system/minigraph-playground-engine/src/main/resources/template/ws-graph.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark system/minigraph-playground-engine/src/main/resources/template/ws-json.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark system/minigraph-playground-engine/webapp/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="root">, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark system/platform-core/src/main/resources/errorPage.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark system/platform-core/src/main/resources/public/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.

D4 · Code Duplication · Duplicated block (9 lines × 2) · ×9

Duplicated block (9 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:52 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:52-60 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java:49-57 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1231 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1231-1239 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1315-1323 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1231` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/ConnectorConfig.java:148 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/ConnectorConfig.java:148-156 | system/platform-core/src/main/java/org/platformlambda/core/system/Platform.java:750-758 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) REDACTED:641 — REDACTED:641-649 | REDACTED:685-693 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:641` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1615 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1615-1623 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1644-1652 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1615` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:177 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:177-185 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:115-123 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:177` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/websocket/server/WsHandshakeHandler.java:50 — system/platform-core/src/main/java/org/platformlambda/core/websocket/server/WsHandshakeHandler.java:50-58 | system/platform-core/src/main/java/org/platformlambda/core/websocket/server/WsRequestHandler.java:157-165 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/EndsWithOperator.java:33 — system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/EndsWithOperator.java:33-41 | system/event-script-engine/src/main/java/com/accenture/services/plugins/logical/StartsWithOperator.java:33-41 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) examples/lambda-example/src/main/java/org/platformlambda/services/HelloRemoteRelay.java:54 — examples/lambda-example/src/main/java/org/platformlambda/services/HelloRemoteRelay.java:54-62 | examples/minigraph-playground/src/main/java/com/accenture/minigraph/demo/LlmStreamRelay.java:56-64 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `examples/lambda-example/src/main/java/org/platformlambda/services/HelloRemoteRelay.java:54` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `examples/minigraph-playground/src/main/java/com/accenture/minigraph/demo/LlmStreamRelay.java:67` calls `setBody`, `getBody` and `examples/lambda-example/src/main/java/org/platformlambda/services/HelloRemoteRelay.java:64` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (8 lines × 2) · ×7

Duplicated block (8 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:55 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:55-62 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:51-58 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) REDACTED:338 — REDACTED:338-345 | REDACTED:354-361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:338` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:176 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:176-183 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:210-217 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:176` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:266 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:266-273 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:299-306 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:266` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/CloudHealthCheck.java:173 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/CloudHealthCheck.java:173-180 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/CloudHealthCheck.java:185-192 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/CloudHealthCheck.java:173` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/features/LogRequestHeaders.java:36 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/features/LogRequestHeaders.java:36-43 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/features/LogResponseHeaders.java:36-43 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) examples/composable-example/src/main/java/com/accenture/demo/tasks/DeleteProfile.java:47 — examples/composable-example/src/main/java/com/accenture/demo/tasks/DeleteProfile.java:47-54 | examples/composable-example/src/main/java/com/accenture/demo/tasks/GetProfile.java:45-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (5 lines × 2) · ×7

Duplicated block (5 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:744 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:744-748 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:768-772 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:744` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:85 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:85-89 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:76-80 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:85` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:276 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:276-280 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:179-184 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) system/event-script-engine/src/main/java/com/accenture/automation/SimpleTypeMatchingConverter.java:82 — system/event-script-engine/src/main/java/com/accenture/automation/SimpleTypeMatchingConverter.java:82-86 | system/event-script-engine/src/main/java/com/accenture/automation/SimpleTypeMatchingConverter.java:88-92 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:370 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:370-374 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:519-523 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:370` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1065 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1065-1069 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:343-347 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1065` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) examples/scheduler-example/src/main/java/org/platformlambda/quartz/rest/ScheduleAdmin.java:84 — examples/scheduler-example/src/main/java/org/platformlambda/quartz/rest/ScheduleAdmin.java:84-88 | examples/scheduler-example/src/main/java/org/platformlambda/quartz/rest/ScheduleAdmin.java:100-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `examples/scheduler-example/src/main/java/org/platformlambda/quartz/rest/ScheduleAdmin.java:84` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.

D4 · Code Duplication · Duplicated block (11 lines × 2) · ×6

Duplicated block (11 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1041 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1041-1051 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1161-1171 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1041` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1246 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1246-1256 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1330-1340 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1246` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/SimpleExceptionHandler.java:49 — system/event-script-engine/src/main/java/com/accenture/services/SimpleExceptionHandler.java:49-59 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExceptionHandler.java:76-86 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphResume.java:91 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphResume.java:91-101 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphSuspend.java:87-97 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphResume.java:91` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:161 — system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:161-171 | system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:218-228 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:161` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/logging/CompactAppender.java:59 — system/platform-core/src/main/java/org/platformlambda/core/logging/CompactAppender.java:59-69 | system/platform-core/src/main/java/org/platformlambda/core/logging/JsonAppender.java:59-69 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/logging/CompactAppender.java` and `system/platform-core/src/main/java/org/platformlambda/core/logging/JsonAppender.java` as WHOLE FILES: 86% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (10 lines × 2) · ×6

Duplicated block (10 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:385 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:385-394 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:889-898 — 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 (10 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:412 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:412-421 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:928-937 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:928` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:207 — system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:207-216 | system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:229-238 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:207` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:205` calls `write` and `system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:227` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:406 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:406-415 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:444-453 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:406` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:88 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:88-97 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java:79-88 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:319 — system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:319-328 | system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:340-349 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:319` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

AX7 · Slice cohesion · Cross-slice coupling · ×5

Cross-slice coupling: twin-kafka → minimalist-kafka system/twin-kafka/src/main/java/org/platformlambda/twin/kafka/SecondaryKafkaRuntime.java:31 — `SecondaryKafkaRuntime` (slice 'twin-kafka') depends on `KafkaRequestPublisher` from slice 'minimalist-kafka'.
Cross-slice coupling: minigraph-playground-engine → event-script-engine system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/start/CompileGraph.java:75 — `CompileGraph` (slice 'minigraph-playground-engine') depends on `SimpleTypeMatchingConverter` from slice 'event-script-engine'.
Cross-slice coupling: minigraph-playground-engine → event-script-engine system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:41 — `GraphLambdaFunction` (slice 'minigraph-playground-engine') depends on `DataMappingHelper` from slice 'event-script-engine'.
Cross-slice coupling: minigraph-playground-engine → event-script-engine system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:55 — `GraphCommandService` (slice 'minigraph-playground-engine') depends on `SimpleTypeMatchingConverter` from slice 'event-script-engine'.
Cross-slice coupling: sync-over-async-demo → sync-over-async examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/stream/StreamProducer.java:63 — `StreamProducer` (slice 'sync-over-async-demo') depends on `StreamResponder` from slice 'sync-over-async'.

D4 · Code Duplication · Duplicated block (13 lines × 2) · ×5

Duplicated block (13 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:109 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:109-121 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java:100-112 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:109` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/websocket/client/WsClientTransmitter.java:68 — system/platform-core/src/main/java/org/platformlambda/core/websocket/client/WsClientTransmitter.java:68-80 | system/platform-core/src/main/java/org/platformlambda/core/websocket/server/WsServerTransmitter.java:82-94 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (13 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:277 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:277-289 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:424-436 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:277` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:154 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:154-166 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:92-104 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:154` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) examples/composable-example/src/main/java/com/accenture/demo/tasks/DecryptFields.java:47 — examples/composable-example/src/main/java/com/accenture/demo/tasks/DecryptFields.java:47-59 | examples/composable-example/src/main/java/com/accenture/demo/tasks/EncryptFields.java:46-58 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `examples/composable-example/src/main/java/com/accenture/demo/tasks/DecryptFields.java:47` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

R10 · Code Duplication · Duplicated block (8 lines × 2 locations) · ×5

Duplicated block (8 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs:262 — agent-skills/memory-lint/scripts/test_memory_lint.mjs:262 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:510 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:240 — system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:240 · system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:194 — 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 (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx:15 — system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx:15 · system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx:24 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:36 — system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:36 · system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:121 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:157 — system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:157 · system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:194 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (12 lines × 2) · ×4

Duplicated block (12 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:378 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:378-389 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:528-539 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:378` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:177 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:177-188 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:237-248 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:177` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/PersistModel.java:60 — extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/PersistModel.java:60-71 | extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/RetrieveModel.java:61-72 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/PersistModel.java:60` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:473 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:473-484 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:489-500 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:473` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

R10 · Code Duplication · Duplicated block (11 lines × 2 locations) · ×4

Duplicated block (11 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs:90 — agent-skills/archive-fact/scripts/test_archive_fact.mjs:90 · agent-skills/archive-fact/scripts/test_archive_fact.mjs:103 — 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 (11 lines × 2 locations) agent-skills/memory-lint/scripts/memory-lint.mjs:140 — agent-skills/memory-lint/scripts/memory-lint.mjs:140 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:84 — 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 (11 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs:355 — agent-skills/memory-lint/scripts/test_memory_lint.mjs:355 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:419 — 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 (11 lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:197 — system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:197 · system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:212 — 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.

D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3

Members sharing a duplicated core (4 members, 50+ identical tokens) system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterHtml.java:58 — system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterHtml.java:58-71 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterJson.java:64-73 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterText.java:58-67 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterXml.java:67-92 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:48 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:48-89 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:44-88 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:153-174 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:91-112 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:177 — system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:177-187 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:189-199 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:201-211 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:213-223 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.

D4 · Code Duplication · Duplicated block (14 lines × 2) · ×3

Duplicated block (14 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/websocket/client/WsClientTransmitter.java:47 — system/platform-core/src/main/java/org/platformlambda/core/websocket/client/WsClientTransmitter.java:47-60 | system/platform-core/src/main/java/org/platformlambda/core/websocket/server/WsServerTransmitter.java:65-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java:52 — system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java:52-65 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDateTime.java:52-65 — before extracting anything, compare `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java` and `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDateTime.java` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/ParseDate.java:52` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:150 — connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:150-163 | connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:192-205 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:150` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D1 · Cyclomatic Complexity · archive-fact.archive_facts (cyclomatic 26) · ×2

archive-fact.archive_facts (cyclomatic 26) agent-skills/archive-fact/scripts/archive-fact.py:110 — archive-fact.archive_facts has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
archive-fact.archive_facts (cyclomatic 26) agent-skills/archive-fact/scripts/archive-fact.mjs:91 — archive-fact.archive_facts has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D29 · Static Analysis (SAST) · REDACTED · ×2

REDACTED
REDACTED

D4 · Code Duplication · Duplicated block (25 lines × 2) · ×2

Duplicated block (25 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:937 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:937-961 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1092-1116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:937` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (25 lines × 2) system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaRuntime.java:35 — system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaRuntime.java:35-60 | system/twin-kafka/src/main/java/org/platformlambda/twin/kafka/SecondaryKafkaRuntime.java:37-61 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.

D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2

Duplicated block (18 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:126 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:126-143 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:117-134 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:126` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:233 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:233-250 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:176-193 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:233` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2

Duplicated block (16 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:966 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:966-981 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1121-1136 — 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 (16 lines × 2) extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java:146 — extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java:146-161 | system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaHealthCheck.java:229-244 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java:146` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (5 lines × 4) · ×2

Duplicated block (5 lines × 4) system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterHtml.java:60 — system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterHtml.java:60-64 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterJson.java:66-70 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterText.java:60-64 | system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterXml.java:69-73 — before extracting anything, compare `system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterHtml.java` and `system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterText.java` as WHOLE FILES: 85% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/rest-spring-4/src/main/java/org/platformlambda/spring/serializers/HttpConverterHtml.java:60` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 4) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:79 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:79-83 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:77-81 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:162-166 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:100-104 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:79` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:77` calls `getEntries`, `getProperty` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:160` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

R10 · Code Duplication · Duplicated block with local edits (18 matched lines × 2 locations) · ×2

Duplicated block with local edits (18 matched lines × 2 locations) agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs:43 — agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs:43 · agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs:131 — the two spans are one implementation copied and then locally edited — 194 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (18 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:110 — system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:110 · system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:147 — the two spans are one implementation copied and then locally edited — 68 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.

R10 · Code Duplication · Duplicated block (16 lines × 2 locations) · ×2

Duplicated block (16 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:414 — system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:414 · system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:451 — 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 (16 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1525 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1525 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1543 — 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 (13 lines × 2 locations) · ×2

Duplicated block (13 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:88 — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:88 · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:59 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (13 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:548 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:548 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:561 — 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 (12 lines × 2 locations) · ×2

Duplicated block (12 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:149 — system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:149 · system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:163 — 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 (12 lines × 2 locations) system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:218 — system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:218 · system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:241 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.

R10 · Code Duplication · Duplicated block with local edits (10 matched lines × 2 locations) · ×2

Duplicated block with local edits (10 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:118 — the two spans are one implementation copied and then locally edited — 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (10 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:514 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:514 · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphViewErrorBoundary.tsx:41 — the two spans are one implementation copied and then locally edited — 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.

R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×2

Duplicated block (9 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs:43 — agent-skills/archive-fact/scripts/test_archive_fact.mjs:43 · agent-skills/archive-fact/scripts/test_archive_fact.mjs:62 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (9 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs:106 — agent-skills/archive-fact/scripts/test_archive_fact.mjs:106 · agent-skills/archive-fact/scripts/test_archive_fact.mjs:118 — 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 (7 lines × 2 locations) · ×2

Duplicated block (7 lines × 2 locations) agent-skills/memory-lint/scripts/memory-lint.mjs:88 — agent-skills/memory-lint/scripts/memory-lint.mjs:88 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:60 — 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 (7 lines × 2 locations) agent-skills/memory-lint/scripts/memory-lint.mjs:113 — agent-skills/memory-lint/scripts/memory-lint.mjs:113 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:49 — 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.

AC3 · Page structure · Data table has no header cells · ×1

Data table has no header cells system/platform-core/src/main/resources/errorPage.html:13 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).

AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1

Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 52 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

D1 · Cyclomatic Complexity · Playground.Playground (cyclomatic 140) · ×1

Playground.Playground (cyclomatic 140) system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87 — Playground.Playground has cyclomatic complexity 140 (threshold 15). Of this number, 75 points are the body's own statements and 65 belong to 26 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 · GraphView.GraphView (cyclomatic 126) · ×1

GraphView.GraphView (cyclomatic 126) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95 — GraphView.GraphView has cyclomatic complexity 126 (threshold 15). Of this number, 49 points are the body's own statements and 77 belong to 37 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 · useGraphAuthoring.useGraphAuthoring (cyclomatic 66) · ×1

useGraphAuthoring.useGraphAuthoring (cyclomatic 66) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:305 — useGraphAuthoring.useGraphAuthoring has cyclomatic complexity 66 (threshold 15). Most of this is not in the body itself: 1 of the 66 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 610, 505, 702, …). 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 · useGraphRunWorkflow.useGraphRunWorkflow (cyclomatic 61) · ×1

useGraphRunWorkflow.useGraphRunWorkflow (cyclomatic 61) system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:76 — useGraphRunWorkflow.useGraphRunWorkflow has cyclomatic complexity 61 (threshold 15). Most of this is not in the body itself: 15 of the 61 points are its own statements and the rest belongs to 17 function literals inside it that branch (lines 316, 199, 214, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.

D1 · Cyclomatic Complexity · useSessionCollaboration.useSessionCollaboration (cyclomatic 58) · ×1

useSessionCollaboration.useSessionCollaboration (cyclomatic 58) system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:40 — useSessionCollaboration.useSessionCollaboration has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 1 of the 58 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 312, 339, 79, …). 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 · graphTransformer.computeLayout (cyclomatic 51) · ×1

graphTransformer.computeLayout (cyclomatic 51) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053 — graphTransformer.computeLayout has cyclomatic complexity 51 (threshold 15). Of this number, 47 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · NodeContextMenu.NodeContextMenu (cyclomatic 44) · ×1

NodeContextMenu.NodeContextMenu (cyclomatic 44) system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:39 — NodeContextMenu.NodeContextMenu has cyclomatic complexity 44 (threshold 15). Of this number, 33 points are the body's own statements and 11 belong to 8 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 · ConsoleMessage.ConsoleMessage (cyclomatic 43) · ×1

ConsoleMessage.ConsoleMessage (cyclomatic 43) system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:35 — ConsoleMessage.ConsoleMessage has cyclomatic complexity 43 (threshold 15). Of this number, 33 points are the body's own statements and 10 belong to 6 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 · check-doc-canon.main (cyclomatic 41) · ×1

check-doc-canon.main (cyclomatic 41) scripts/check-doc-canon.py:48 — check-doc-canon.main 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 · NodeEditPanel.NodeEditPanel (cyclomatic 40) · ×1

NodeEditPanel.NodeEditPanel (cyclomatic 40) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:47 — NodeEditPanel.NodeEditPanel has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 15 of the 40 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 168, 272, 149, …). 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 · classifier.classifyMessage (cyclomatic 39) · ×1

classifier.classifyMessage (cyclomatic 39) system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:44 — classifier.classifyMessage has cyclomatic complexity 39 (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 · Parser.parseExpressionUntil (cyclomatic 34) · ×1

Parser.parseExpressionUntil (cyclomatic 34) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Parser.java:58 — Parser.parseExpressionUntil has cyclomatic complexity 34 (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 · MockUploadPanel.MockUploadPanel (cyclomatic 32) · ×1

MockUploadPanel.MockUploadPanel (cyclomatic 32) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:71 — MockUploadPanel.MockUploadPanel has cyclomatic complexity 32 (threshold 15). Of this number, 16 points are the body's own statements and 16 belong to 8 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 · useWebSocket.useWebSocket (cyclomatic 31) · ×1

useWebSocket.useWebSocket (cyclomatic 31) system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:115 — useWebSocket.useWebSocket has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 157, 189, 252, …). 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 · Evaluator.evalBinary (cyclomatic 30) · ×1

Evaluator.evalBinary (cyclomatic 30) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.java:83 — Evaluator.evalBinary has cyclomatic complexity 30 (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 · RightPanel.RightPanel (cyclomatic 30) · ×1

RightPanel.RightPanel (cyclomatic 30) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:67 — RightPanel.RightPanel has cyclomatic complexity 30 (threshold 15). Of this number, 22 points are the body's own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · graphTransformer.minimizeCrossings (cyclomatic 29) · ×1

graphTransformer.minimizeCrossings (cyclomatic 29) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:703 — graphTransformer.minimizeCrossings has cyclomatic complexity 29 (threshold 15). Of this number, 19 points are the body's own statements and 10 belong to 5 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · GraphMinimap.GraphMinimap (cyclomatic 28) · ×1

GraphMinimap.GraphMinimap (cyclomatic 28) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphMinimap.tsx:83 — GraphMinimap.GraphMinimap has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 98, 176, 149, …). 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 · memory-lint.scan_lines (cyclomatic 26) · ×1

memory-lint.scan_lines (cyclomatic 26) agent-skills/memory-lint/scripts/memory-lint.mjs:956 — memory-lint.scan_lines has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · SessionMenu.SessionMenuContent (cyclomatic 26) · ×1

SessionMenu.SessionMenuContent (cyclomatic 26) system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:34 — SessionMenu.SessionMenuContent has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · useHelpScrollNavigation.useHelpScrollNavigation (cyclomatic 26) · ×1

useHelpScrollNavigation.useHelpScrollNavigation (cyclomatic 26) system/minigraph-playground-engine/webapp/src/hooks/useHelpScrollNavigation.ts:42 — useHelpScrollNavigation.useHelpScrollNavigation has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 93, 75, 185). 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 · Lexer.operatorToken (cyclomatic 25) · ×1

Lexer.operatorToken (cyclomatic 25) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Lexer.java:76 — Lexer.operatorToken has cyclomatic complexity 25 (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 · MsgPack.pack (cyclomatic 24) · ×1

MsgPack.pack (cyclomatic 24) system/platform-core/src/main/java/org/platformlambda/core/serializers/MsgPack.java:263 — MsgPack.pack has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · memory-lint._scan_lines (cyclomatic 24) · ×1

memory-lint._scan_lines (cyclomatic 24) agent-skills/memory-lint/scripts/memory-lint.py:936 — memory-lint._scan_lines 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 · refresh-metadata.refresh (cyclomatic 22) · ×1

refresh-metadata.refresh (cyclomatic 22) agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:121 — refresh-metadata.refresh has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 132, 161, 136). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.

D1 · Cyclomatic Complexity · Navigation.Navigation (cyclomatic 22) · ×1

Navigation.Navigation (cyclomatic 22) system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:61 — Navigation.Navigation has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 110, 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 · ClipboardSidebar.ClipboardSidebar (cyclomatic 22) · ×1

ClipboardSidebar.ClipboardSidebar (cyclomatic 22) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:47 — ClipboardSidebar.ClipboardSidebar has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body's own statements and 10 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · memory-lint.main (cyclomatic 21) · ×1

memory-lint.main (cyclomatic 21) agent-skills/memory-lint/scripts/memory-lint.mjs:1046 — memory-lint.main has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · WebSocketContext.WebSocketProvider (cyclomatic 21) · ×1

WebSocketContext.WebSocketProvider (cyclomatic 21) system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:182 — WebSocketContext.WebSocketProvider has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 230, 245, 297, …). 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 · memory-lint.main (cyclomatic 20) · ×1

memory-lint.main (cyclomatic 20) agent-skills/memory-lint/scripts/memory-lint.py:1043 — memory-lint.main 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 · graphTransformer.transformGraphData (cyclomatic 20) · ×1

graphTransformer.transformGraphData (cyclomatic 20) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1410 — graphTransformer.transformGraphData has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body's own statements and 9 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · HelpBrowser.HelpBrowser (cyclomatic 20) · ×1

HelpBrowser.HelpBrowser (cyclomatic 20) system/minigraph-playground-engine/webapp/src/components/HelpBrowser/HelpBrowser.tsx:64 — HelpBrowser.HelpBrowser has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body's own statements and 9 belong to 5 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 · memory-lint.check_undeclared_references (cyclomatic 19) · ×1

memory-lint.check_undeclared_references (cyclomatic 19) agent-skills/memory-lint/scripts/memory-lint.mjs:700 — memory-lint.check_undeclared_references 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 · ConnectionPopover.ConnectionPopover (cyclomatic 19) · ×1

ConnectionPopover.ConnectionPopover (cyclomatic 19) system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:34 — ConnectionPopover.ConnectionPopover has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 57, 93, 88, …). 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 · useAutocomplete.useAutocomplete (cyclomatic 19) · ×1

useAutocomplete.useAutocomplete (cyclomatic 19) system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts:37 — useAutocomplete.useAutocomplete has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 81, 63, 98). 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 · graphInputPaths.collectPathsFromText (cyclomatic 18) · ×1

graphInputPaths.collectPathsFromText (cyclomatic 18) system/minigraph-playground-engine/webapp/src/graphRun/graphInputPaths.ts:14 — graphInputPaths.collectPathsFromText 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 · useGraphUndo.useGraphUndo (cyclomatic 18) · ×1

useGraphUndo.useGraphUndo (cyclomatic 18) system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:54 — useGraphUndo.useGraphUndo has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 112, 132, 78, …). 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 · memory-lint.check_undeclared_references (cyclomatic 17) · ×1

memory-lint.check_undeclared_references (cyclomatic 17) agent-skills/memory-lint/scripts/memory-lint.py:676 — memory-lint.check_undeclared_references 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 · check-minigraph-grammar.main (cyclomatic 17) · ×1

check-minigraph-grammar.main (cyclomatic 17) scripts/check-minigraph-grammar.py:35 — check-minigraph-grammar.main 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 · graphTransformer.deriveFlowHandleOffsets (cyclomatic 17) · ×1

graphTransformer.deriveFlowHandleOffsets (cyclomatic 17) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:530 — graphTransformer.deriveFlowHandleOffsets has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · validation.validateNodeFormState (cyclomatic 17) · ×1

validation.validateNodeFormState (cyclomatic 17) system/minigraph-playground-engine/webapp/src/graphActions/validation.ts:58 — validation.validateNodeFormState 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 · SqlPreparedStatement.getDataType (cyclomatic 16) · ×1

SqlPreparedStatement.getDataType (cyclomatic 16) extensions/reactive-postgres/src/main/java/org/platformlambda/db/SqlPreparedStatement.java:480 — SqlPreparedStatement.getDataType 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. This is NOT this file's highest cyclomatic complexity: SqlPreparedStatement.str2SqlType (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 · GraphSaveButton.GraphSaveButton (cyclomatic 16) · ×1

GraphSaveButton.GraphSaveButton (cyclomatic 16) system/minigraph-playground-engine/webapp/src/components/GraphSaveButton/GraphSaveButton.tsx:30 — GraphSaveButton.GraphSaveButton has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · GraphView.GraphView (cognitive 133) · ×1

GraphView.GraphView (cognitive 133) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95 — GraphView.GraphView has cognitive complexity 133 (threshold 15). Drivers by points: if/else 51 (66 pts), boolean chains 44, ternaries 13 (19 pts), loops 2 (3 pts), error handling 1 (nesting depth added 22). Of this number, 39 points are the body's own statements and 94 belong to 37 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · Playground.Playground (cognitive 128) · ×1

Playground.Playground (cognitive 128) system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87 — Playground.Playground has cognitive complexity 128 (threshold 15). Drivers by points: ternaries 37 (47 pts), if/else 35 (41 pts), boolean chains 35, error handling 2 (3 pts), loops 1, match/switch 1 (nesting depth added 17). Of this number, 61 points are the body's own statements and 67 belong to 26 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · check-doc-canon.main (cognitive 85) · ×1

check-doc-canon.main (cognitive 85) scripts/check-doc-canon.py:48 — check-doc-canon.main has cognitive complexity 85 (threshold 15). Drivers by points: if/else 22 (54 pts), loops 11 (20 pts), ternaries 1 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 46). 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 · graphTransformer.computeLayout (cognitive 85) · ×1

graphTransformer.computeLayout (cognitive 85) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053 — graphTransformer.computeLayout has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 23 (33 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 37). Of this number, 83 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · useGraphAuthoring.useGraphAuthoring (cognitive 81) · ×1

useGraphAuthoring.useGraphAuthoring (cognitive 81) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:305 — useGraphAuthoring.useGraphAuthoring has cognitive complexity 81 (threshold 15). Drivers by points: if/else 50 (59 pts), ternaries 6 (13 pts), error handling 3 (4 pts), boolean chains 3, loops 2 (nesting depth added 17). Most of this is not in the body itself: 0 of the 81 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 505, 610, 702, …). 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 · useGraphRunWorkflow.useGraphRunWorkflow (cognitive 65) · ×1

useGraphRunWorkflow.useGraphRunWorkflow (cognitive 65) system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:76 — useGraphRunWorkflow.useGraphRunWorkflow has cognitive complexity 65 (threshold 15). Drivers by points: if/else 32 (35 pts), boolean chains 20, ternaries 4 (10 pts) (nesting depth added 9). Of this number, 18 points are the body's own statements and 47 belong to 17 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · useSessionCollaboration.useSessionCollaboration (cognitive 54) · ×1

useSessionCollaboration.useSessionCollaboration (cognitive 54) system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:40 — useSessionCollaboration.useSessionCollaboration has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 11, ternaries 3 (10 pts), loops 2 (3 pts) (nesting depth added 13). Most of this is not in the body itself: 0 of the 54 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 79, 312, 186, …). 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 · memory-lint.scan_lines (cognitive 52) · ×1

memory-lint.scan_lines (cognitive 52) agent-skills/memory-lint/scripts/memory-lint.mjs:956 — memory-lint.scan_lines has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 9 (16 pts), boolean chains 2 (nesting depth added 27). Of this number, 50 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · memory-lint._scan_lines (cognitive 50) · ×1

memory-lint._scan_lines (cognitive 50) agent-skills/memory-lint/scripts/memory-lint.py:936 — memory-lint._scan_lines has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 9 (16 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · graphTransformer.transposeForBetterScore (cognitive 46) · ×1

graphTransformer.transposeForBetterScore (cognitive 46) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:642 — graphTransformer.transposeForBetterScore has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (34 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · NodeEditPanel.NodeEditPanel (cognitive 42) · ×1

NodeEditPanel.NodeEditPanel (cognitive 42) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:47 — NodeEditPanel.NodeEditPanel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 11, ternaries 11 (nesting depth added 2). Most of this is not in the body itself: 13 of the 42 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 168, 149, 272, …). 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 · classifier.classifyMessage (cognitive 41) · ×1

classifier.classifyMessage (cognitive 41) system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:44 — classifier.classifyMessage has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27 (30 pts), ternaries 3 (8 pts), boolean chains 3 (nesting depth added 8). 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 · ConsoleMessage.ConsoleMessage (cognitive 40) · ×1

ConsoleMessage.ConsoleMessage (cognitive 40) system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:35 — ConsoleMessage.ConsoleMessage has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 18 (21 pts), boolean chains 14, if/else 4 (5 pts) (nesting depth added 4). Of this number, 31 points are the body's own statements and 9 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · useWebSocket.useWebSocket (cognitive 39) · ×1

useWebSocket.useWebSocket (cognitive 39) system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:115 — useWebSocket.useWebSocket has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29 (36 pts), error handling 2, boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 0 of the 39 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 189, 157, 252, …). 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 · archive-fact.archive_facts (cognitive 38) · ×1

archive-fact.archive_facts (cognitive 38) agent-skills/archive-fact/scripts/archive-fact.mjs:91 — archive-fact.archive_facts has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 7 (12 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · archive-fact.archive_facts (cognitive 37) · ×1

archive-fact.archive_facts (cognitive 37) agent-skills/archive-fact/scripts/archive-fact.py:110 — archive-fact.archive_facts has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 7 (12 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · NodeContextMenu.NodeContextMenu (cognitive 37) · ×1

NodeContextMenu.NodeContextMenu (cognitive 37) system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:39 — NodeContextMenu.NodeContextMenu has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 14, if/else 12 (13 pts), ternaries 8 (10 pts) (nesting depth added 3). Of this number, 24 points are the body's own statements and 13 belong to 8 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · memory-lint.check_undeclared_references (cognitive 36) · ×1

memory-lint.check_undeclared_references (cognitive 36) agent-skills/memory-lint/scripts/memory-lint.mjs:700 — memory-lint.check_undeclared_references has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 7 (10 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · memory-lint.main (cognitive 35) · ×1

memory-lint.main (cognitive 35) agent-skills/memory-lint/scripts/memory-lint.mjs:1046 — memory-lint.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 4 (10 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · memory-lint.main (cognitive 33) · ×1

memory-lint.main (cognitive 33) agent-skills/memory-lint/scripts/memory-lint.py:1043 — memory-lint.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (10 pts), boolean chains 5, 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 · MockUploadPanel.MockUploadPanel (cognitive 33) · ×1

MockUploadPanel.MockUploadPanel (cognitive 33) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:71 — MockUploadPanel.MockUploadPanel has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 14, if/else 11 (12 pts), ternaries 5 (6 pts), error handling 1 (nesting depth added 2). Of this number, 16 points are the body's own statements and 17 belong to 8 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · memory-lint.check_undeclared_references (cognitive 31) · ×1

memory-lint.check_undeclared_references (cognitive 31) agent-skills/memory-lint/scripts/memory-lint.py:676 — memory-lint.check_undeclared_references has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · graphTransformer.minimizeCrossings (cognitive 31) · ×1

graphTransformer.minimizeCrossings (cognitive 31) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:703 — graphTransformer.minimizeCrossings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 8 (11 pts), boolean chains 6, ternaries 1 (nesting depth added 8). Of this number, 25 points are the body's own statements and 6 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · useHelpScrollNavigation.useHelpScrollNavigation (cognitive 29) · ×1

useHelpScrollNavigation.useHelpScrollNavigation (cognitive 29) system/minigraph-playground-engine/webapp/src/hooks/useHelpScrollNavigation.ts:42 — useHelpScrollNavigation.useHelpScrollNavigation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 3). Most of this is not in the body itself: 0 of the 29 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 93, 75, 185). 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 · Navigation.Navigation (cognitive 26) · ×1

Navigation.Navigation (cognitive 26) system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:61 — Navigation.Navigation has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 16 (21 pts), boolean chains 3, if/else 2 (nesting depth added 5). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 110, 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 · graphTransformer.deriveFlowHandleOffsets (cognitive 25) · ×1

graphTransformer.deriveFlowHandleOffsets (cognitive 25) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:530 — graphTransformer.deriveFlowHandleOffsets has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 8 (10 pts), boolean chains 2 (nesting depth added 8). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · graphTransformer.transformGraphData (cognitive 23) · ×1

graphTransformer.transformGraphData (cognitive 23) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1410 — graphTransformer.transformGraphData has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 8, boolean chains 2, ternaries 2 (nesting depth added 4). Of this number, 12 points are the body's own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · connectionEdits.planConnectionRemoval (cognitive 23) · ×1

connectionEdits.planConnectionRemoval (cognitive 23) system/minigraph-playground-engine/webapp/src/graphActions/connectionEdits.ts:54 — connectionEdits.planConnectionRemoval has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (9 pts), error handling 1 (nesting depth added 10). Of this number, 22 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 · memory-lint.fact_blocks (cognitive 22) · ×1

memory-lint.fact_blocks (cognitive 22) agent-skills/memory-lint/scripts/memory-lint.py:624 — memory-lint.fact_blocks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (9 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 · refresh-metadata.refresh (cognitive 22) · ×1

refresh-metadata.refresh (cognitive 22) agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:121 — refresh-metadata.refresh has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 4 (5 pts), boolean chains 2, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 132, 161, 136). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.

D2 · Cognitive Complexity · validation.validateNodeFormState (cognitive 22) · ×1

validation.validateNodeFormState (cognitive 22) system/minigraph-playground-engine/webapp/src/graphActions/validation.ts:58 — validation.validateNodeFormState has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · graphInputPaths.collectPathsFromText (cognitive 22) · ×1

graphInputPaths.collectPathsFromText (cognitive 22) system/minigraph-playground-engine/webapp/src/graphRun/graphInputPaths.ts:14 — graphInputPaths.collectPathsFromText has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 7, loops 4 (7 pts), if/else 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · RightPanel.RightPanel (cognitive 22) · ×1

RightPanel.RightPanel (cognitive 22) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:67 — RightPanel.RightPanel has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7, ternaries 4 (5 pts) (nesting depth added 1). Of this number, 12 points are the body's own statements and 10 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · useGraphUndo.useGraphUndo (cognitive 22) · ×1

useGraphUndo.useGraphUndo (cognitive 22) system/minigraph-playground-engine/webapp/src/hooks/useGraphUndo.ts:54 — useGraphUndo.useGraphUndo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 112, 132, 150, …). 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 · memory-lint.undeclared_references_from_git (cognitive 21) · ×1

memory-lint.undeclared_references_from_git (cognitive 21) agent-skills/memory-lint/scripts/memory-lint.py:745 — memory-lint.undeclared_references_from_git has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · check-minigraph-grammar.main (cognitive 21) · ×1

check-minigraph-grammar.main (cognitive 21) scripts/check-minigraph-grammar.py:35 — check-minigraph-grammar.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · graphTransformer.relieveNodeIntrusions (cognitive 21) · ×1

graphTransformer.relieveNodeIntrusions (cognitive 21) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:942 — graphTransformer.relieveNodeIntrusions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · useAutocomplete.useAutocomplete (cognitive 21) · ×1

useAutocomplete.useAutocomplete (cognitive 21) system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts:37 — useAutocomplete.useAutocomplete has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 81, 63, 98). 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 · memory-lint.fact_blocks (cognitive 20) · ×1

memory-lint.fact_blocks (cognitive 20) agent-skills/memory-lint/scripts/memory-lint.mjs:651 — memory-lint.fact_blocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (9 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GraphMinimap.GraphMinimap (cognitive 20) · ×1

GraphMinimap.GraphMinimap (cognitive 20) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphMinimap.tsx:83 — GraphMinimap.GraphMinimap has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 6, ternaries 5. Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 176, 149, 98, …). 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 · messageParser.detectMutation (cognitive 19) · ×1

messageParser.detectMutation (cognitive 19) system/minigraph-playground-engine/webapp/src/utils/messageParser.ts:409 — messageParser.detectMutation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · GraphSaveButton.GraphSaveButton (cognitive 19) · ×1

GraphSaveButton.GraphSaveButton (cognitive 19) system/minigraph-playground-engine/webapp/src/components/GraphSaveButton/GraphSaveButton.tsx:30 — GraphSaveButton.GraphSaveButton has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 6, boolean chains 2 (nesting depth added 4). Of this number, 14 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: 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 · useGraphAuthoring.eventMatchesPendingAction (cognitive 19) · ×1

useGraphAuthoring.eventMatchesPendingAction (cognitive 19) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:158 — useGraphAuthoring.eventMatchesPendingAction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ClipboardSidebar.ClipboardSidebar (cognitive 19) · ×1

ClipboardSidebar.ClipboardSidebar (cognitive 19) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:47 — ClipboardSidebar.ClipboardSidebar has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, ternaries 5 (6 pts), if/else 5 (nesting depth added 1). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 96, 76, 81, …). 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 · ServiceQuery.handleEvent (cognitive 18) · ×1

ServiceQuery.handleEvent (cognitive 18) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:64 — ServiceQuery.handleEvent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · SseRelay.onLine (cognitive 17) · ×1

SseRelay.onLine (cognitive 17) REDACTED:838 — SseRelay.onLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TaskExecutor.handlePipelineTask (cognitive 17) · ×1

TaskExecutor.handlePipelineTask (cognitive 17) system/event-script-engine/src/main/java/com/accenture/automation/TaskExecutor.java:838 — TaskExecutor.handlePipelineTask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). 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 · memory-lint.load_repo (cognitive 17) · ×1

memory-lint.load_repo (cognitive 17) agent-skills/memory-lint/scripts/memory-lint.mjs:180 — memory-lint.load_repo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · memory-lint.undeclared_references_from_git (cognitive 17) · ×1

memory-lint.undeclared_references_from_git (cognitive 17) agent-skills/memory-lint/scripts/memory-lint.mjs:762 — memory-lint.undeclared_references_from_git has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · graphTransformer.collectGeometryPairs (cognitive 17) · ×1

graphTransformer.collectGeometryPairs (cognitive 17) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:496 — graphTransformer.collectGeometryPairs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · WebSocketContext.WebSocketProvider (cognitive 17) · ×1

WebSocketContext.WebSocketProvider (cognitive 17) system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:182 — WebSocketContext.WebSocketProvider has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, error handling 1, ternaries 1. Most of this is not in the body itself: 0 of the 17 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 230, 245, 325, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.

D2 · Cognitive Complexity · NavMenu.NavMenu (cognitive 17) · ×1

NavMenu.NavMenu (cognitive 17) system/minigraph-playground-engine/webapp/src/components/NavMenu/NavMenu.tsx:34 — NavMenu.NavMenu has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (11 pts), boolean chains 3, if/else 3 (nesting depth added 6). Of this number, 13 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · SessionMenu.SessionMenuContent (cognitive 17) · ×1

SessionMenu.SessionMenuContent (cognitive 17) system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:34 — SessionMenu.SessionMenuContent has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 4, error handling 1, ternaries 1. Of this number, 12 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.

D2 · Cognitive Complexity · GraphCommandService.handleDeleteCommand (cognitive 16) · ×1

GraphCommandService.handleDeleteCommand (cognitive 16) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1276 — GraphCommandService.handleDeleteCommand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TaskExecutor.setInputDataMappingRhs (cognitive 16) · ×1

TaskExecutor.setInputDataMappingRhs (cognitive 16) system/event-script-engine/src/main/java/com/accenture/automation/TaskExecutor.java:1219 — TaskExecutor.setInputDataMappingRhs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · memory-lint.pinned_open_threads (cognitive 16) · ×1

memory-lint.pinned_open_threads (cognitive 16) agent-skills/memory-lint/scripts/memory-lint.mjs:84 — memory-lint.pinned_open_threads has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ConnectionPopover.ConnectionPopover (cognitive 16) · ×1

ConnectionPopover.ConnectionPopover (cognitive 16) system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:34 — ConnectionPopover.ConnectionPopover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 2. Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 57, 93, 88, …). 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 · HelpBrowser.HelpBrowser (cognitive 16) · ×1

HelpBrowser.HelpBrowser (cognitive 16) system/minigraph-playground-engine/webapp/src/components/HelpBrowser/HelpBrowser.tsx:64 — HelpBrowser.HelpBrowser has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 5 (6 pts), if/else 4 (nesting depth added 1). Of this number, 9 points are the body's own statements and 7 belong to 5 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D20 · ADR Quality · Context/problem and consequences are both present but sparse; only one decision (schema-registry standalone mock server) is named with rationale in body text rather than a dedicated Context/Decision section · ×1

Context/problem and consequences are both present but sparse; only one decision (schema-registry standalone mock server) is named with rationale in body text rather than a dedicated Context/Decision section memory/archive/2026-Q3.md — Add a Context section explaining why an end-to-end schema registry mock was needed (testing Avro+JSON, replacing the real Confluent API), and a Consequences section covering trade-offs like mocking latency vs. real integration, and whether it is maintained as a standalone demo

D31 · IaC & Container Security · REDACTED IaC · ×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

D4 · Code Duplication · Near-duplicate member family (4 members, 14 shared lines) · ×1

Near-duplicate member family (4 members, 14 shared lines) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:99 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:99-126 | system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:105-143 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java:90-117 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:95-134 — These 4 members are variants of one another: a block of 14 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.

D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1

Edited copy of a member (13 corresponding lines) REDACTED:791 — REDACTED:791-803 | system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:156-170 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.

D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×1

Edited copy of a member (23 corresponding lines) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:176 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:176-198 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:114-136 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.

D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1

Edited copy of a member (12 corresponding lines) system/platform-core/src/main/java/org/platformlambda/core/models/GraphProperties.java:60 — system/platform-core/src/main/java/org/platformlambda/core/models/GraphProperties.java:60-71 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:279-290 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.

D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1

Edited copy of a member (14 corresponding lines) extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/PersistModel.java:58 — extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/PersistModel.java:58-80 | extensions/minigraph-state-redis/src/main/java/org/platformlambda/graph/redis/RetrieveModel.java:59-79 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.

D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1

Members sharing a duplicated core (7 members, 50+ identical tokens) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:48 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:48-89 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:33-54 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:44-88 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:57-83 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:40-68 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphStateSkill.java:67-95 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:55-100 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.

D4 · Code Duplication · Duplicated block (31 lines × 2) · ×1

Duplicated block (31 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1387 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1387-1417 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1488-1518 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1387` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.

D4 · Code Duplication · Duplicated block (19–21 lines × 2) · ×1

Duplicated block (19–21 lines × 2) examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java:41 — examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java:41-59 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphHealth.java:48-68 — before extracting anything, compare `examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphHealth.java` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java:41` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1

Duplicated block (17 lines × 3) system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:472 — system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:472-488 | system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:608-624 | system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:657-673 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (15–17 lines × 2) · ×1

Duplicated block (15–17 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:201 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:201-217 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:236-250 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:201` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1

Duplicated block (17 lines × 2) system/event-script-engine/src/main/java/com/accenture/services/plugins/collection/GetFirstOperator.java:36 — system/event-script-engine/src/main/java/com/accenture/services/plugins/collection/GetFirstOperator.java:36-52 | system/event-script-engine/src/main/java/com/accenture/services/plugins/collection/GetLastOperator.java:36-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (14–16 lines × 2) · ×1

Duplicated block (14–16 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:207 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:207-220 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:144-159 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:207` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (14–15 lines × 3) · ×1

Duplicated block (14–15 lines × 3) examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java:48 — examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java:48-62 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/GraphUserInterface.java:54-67 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/JsonPathHandler.java:61-75 — before extracting anything, compare `examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/GraphUserInterface.java` as WHOLE FILES: 84% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java:48` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1

Duplicated block (15 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:73 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:73-87 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:71-85 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1

Duplicated block (14 lines × 3) examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java:70 — examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java:70-83 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/GraphUserInterface.java:84-97 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/JsonPathHandler.java:84-97 — before extracting anything, compare `examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/GraphUserInterface.java` as WHOLE FILES: 84% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/GraphUserInterface.java:82` calls `send`, `EventEnvelope`, `setTo` and `examples/rest-spring-4-example/src/main/java/com/accenture/examples/websocket/server/WsEchoDemo.java:69` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1

Duplicated block (13 lines × 3) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:871 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:871-883 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:959-971 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1114-1126 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (10–13 lines × 2) · ×1

Duplicated block (10–13 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:338 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:338-350 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:367-376 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:338` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1

Duplicated block (12 lines × 3) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:264 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:264-275 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphStateSkill.java:109-120 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:251-262 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.

D4 · Code Duplication · Duplicated block (3–12 lines × 4) · ×1

Duplicated block (3–12 lines × 4) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:105 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:105-107 | system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:111-122 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java:96-98 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:102-113 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:111` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:110` calls `getAnnotations`, `clearAnnotations`, `setRoundTrip` and `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:105` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (11 lines × 4) · ×1

Duplicated block (11 lines × 4) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:116 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:116-126 | system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:132-142 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureInbox.java:107-117 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:123-133 — before extracting anything, compare `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java` and `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java:116` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1

Duplicated block (11 lines × 3) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/ConnectorConfig.java:82 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/ConnectorConfig.java:82-92 | system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:144-154 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:350-360 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/ConnectorConfig.java:82` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1

Duplicated block (10–11 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1007 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1007-1017 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1040-1049 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1007` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (9–10 lines × 3) · ×1

Duplicated block (9–10 lines × 3) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:377 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:377-385 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:527-535 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:127-136 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:127` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (10 lines × 3) · ×1

Duplicated block (10 lines × 3) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:52 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:52-61 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:48-57 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:59-68 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1

Duplicated block (9 lines × 3) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:37 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:37-45 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:61-69 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:44-52 — before extracting anything, compare `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:71` calls `getEntries`, `getProperty` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:47` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1

Duplicated block (8 lines × 4) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:180 — system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:180-187 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:192-199 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:204-211 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:216-223 — all 4 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. Read the line range as the matched WINDOW rather than a finished unit: at `system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:180` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `Integer` in one and `Long` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.

D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1

Duplicated block (8 lines × 3) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:211 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:211-218 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:280-287 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:267-274 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:211` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (6–8 lines × 2) · ×1

Duplicated block (6–8 lines × 2) system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaFlowAutoStart.java:87 — system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaFlowAutoStart.java:87-94 | system/twin-kafka/src/main/java/org/platformlambda/twin/kafka/SecondaryKafkaAutoStart.java:93-98 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaFlowAutoStart.java:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1

Duplicated block (7–8 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:317 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:317-323 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:364-371 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:364` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (7 lines × 6) · ×1

Duplicated block (7 lines × 6) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:50 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:50-56 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:35-41 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:46-52 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:59-65 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:42-48 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:57-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:50` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (7 lines × 3) · ×1

Duplicated block (7 lines × 3) examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java:40 — examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java:40-46 | examples/lambda-example/src/main/java/org/platformlambda/services/DemoHealth.java:39-45 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphHealth.java:47-53 — before extracting anything, compare `examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphHealth.java` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `examples/composable-example/src/main/java/com/accenture/demo/services/DemoHealth.java:40` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (2–7 lines × 3) · ×1

Duplicated block (2–7 lines × 3) system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:163 — system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:163-164 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:284-290 | system/platform-core/src/main/java/org/platformlambda/core/models/GraphProperties.java:65-71 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:284` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:283` calls `charAt` and `system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:162` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (6 lines × 7) · ×1

Duplicated block (6 lines × 7) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:49 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:49-54 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:34-39 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:45-50 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:58-63 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:41-46 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphStateSkill.java:68-73 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:56-61 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 7 call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:37` calls `ExpressionEngine` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphDataMapper.java:30` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1

Duplicated block (5 lines × 3) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java:91 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java:91-95 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:55-59 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:95-99 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:91` calls `equals`, `getProperty` and `connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:51` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (9–11 lines × 2) · ×1

Duplicated block (9–11 lines × 2) examples/kafka-demo/src/main/java/com/accenture/kafka/demo/tasks/DemoProcessor.java:66 — examples/kafka-demo/src/main/java/com/accenture/kafka/demo/tasks/DemoProcessor.java:66-74 | examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/tasks/SystemOfRecordAvro.java:59-69 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `examples/kafka-demo/src/main/java/com/accenture/kafka/demo/tasks/DemoProcessor.java:66` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.

D4 · Code Duplication · Duplicated block (5–6 lines × 2) · ×1

Duplicated block (5–6 lines × 2) examples/composable-example/src/main/java/com/accenture/demo/tasks/HelloExceptionHandler.java:52 — examples/composable-example/src/main/java/com/accenture/demo/tasks/HelloExceptionHandler.java:52-56 | examples/distributed-cache-example/src/main/java/com/accenture/cache/demo/functions/ProfileExceptionHandler.java:53-58 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `examples/distributed-cache-example/src/main/java/com/accenture/cache/demo/functions/ProfileExceptionHandler.java:53` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (68 lines × 2) · ×1

Duplicated block (68 lines × 2) examples/lambda-example/src/main/java/org/platformlambda/models/SamplePoJo.java:33 — examples/lambda-example/src/main/java/org/platformlambda/models/SamplePoJo.java:33-100 | examples/rest-spring-4-example/src/main/java/org/platformlambda/models/SamplePoJo.java:33-100 — before extracting anything, compare `examples/lambda-example/src/main/java/org/platformlambda/models/SamplePoJo.java` and `examples/rest-spring-4-example/src/main/java/org/platformlambda/models/SamplePoJo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (56 lines × 2) · ×1

Duplicated block (56 lines × 2) examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/MainApp.java:1 — examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/MainApp.java:1-56 | examples/twin-kafka-demo/src/main/java/com/accenture/twin/demo/MainApp.java:1-63 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/MainApp.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (47 lines × 2) · ×1

Duplicated block (47 lines × 2) examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/tasks/SoaReplyAvro.java:1 — examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/tasks/SoaReplyAvro.java:1-47 | examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/tasks/SoaReplyJson.java:1-47 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `examples/sync-over-async-demo/src/main/java/com/accenture/soa/demo/tasks/SoaReplyAvro.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.

D8 · Code Coverage · Coverage not measured · ×1

Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — system/minigraph-playground-engine/webapp/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.

R10 · Code Duplication · Duplication concentrated across 10 sibling directories (12 clone groups) · ×1

Duplication concentrated across 10 sibling directories (12 clone groups) system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:44 — 12 duplicated blocks under system/minigraph-playground-engine/webapp/src/components/ have copies in at least two of the sibling directories ClipboardSidebar, ConnectionPopover, Console, GraphDataView, GraphView, LeftPanel (+4 more sibling(s) not listed) — 8 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 12 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 12 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 12 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.

R10 · Code Duplication · Duplication concentrated across 3 sibling directories (7 clone groups) · ×1

Duplication concentrated across 3 sibling directories (7 clone groups) agent-skills/archive-fact/scripts/archive-fact.mjs:21 — 7 duplicated blocks under agent-skills/ have copies in at least two of the sibling directories archive-fact, memory-lint, refresh-metadata — 6 of them are reported below, and 1 is 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 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 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 7 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 (44 matched lines × 2 locations) · ×1

Duplicated block with local edits (44 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/EdgeContextMenu.tsx:35 — system/minigraph-playground-engine/webapp/src/components/GraphView/EdgeContextMenu.tsx:35 · system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:63 — the two spans are one implementation copied and then locally edited — 354 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.

R10 · Code Duplication · Duplicated block with local edits (31 matched lines × 2 locations) · ×1

Duplicated block with local edits (31 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:44 — system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:44 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:57 — the two spans are one implementation copied and then locally edited — 198 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 (27 lines × 2 locations) · ×1

Duplicated block (27 lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:219 — system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:219 · system/minigraph-playground-engine/webapp/src/hooks/useWebSocket.ts:257 — 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 (23 lines × 3 locations) · ×1

Duplicated block (23 lines × 3 locations) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:55 — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItemContextMenu.tsx:55 · system/minigraph-playground-engine/webapp/src/components/GraphView/EdgeContextMenu.tsx:62 · system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:99 — the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.

R10 · Code Duplication · Duplicated block (19 lines × 2 locations) · ×1

Duplicated block (19 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:182 — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:182 · system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:216 — 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 (18 lines × 2 locations) · ×1

Duplicated block (18 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:47 — system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:47 · system/minigraph-playground-engine/webapp/src/components/GraphView/NodeTypes.tsx:122 — 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 (17 lines × 2 locations) · ×1

Duplicated block (17 lines × 2 locations) system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:49 — system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:49 · system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts:79 — 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 (16 matched lines × 2 locations) · ×1

Duplicated block with local edits (16 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:24 — the two spans are one implementation copied and then locally edited — 101 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 (15 lines × 2 locations) · ×1

Duplicated block (15 lines × 2 locations) agent-skills/archive-fact/scripts/archive-fact.mjs:21 — agent-skills/archive-fact/scripts/archive-fact.mjs:21 · agent-skills/memory-lint/scripts/memory-lint.mjs:42 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.

R10 · Code Duplication · Duplicated block (14 lines × 2 locations) · ×1

Duplicated block (14 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs:297 — agent-skills/memory-lint/scripts/test_memory_lint.mjs:297 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:320 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.

R10 · Code Duplication · Duplicated block with local edits (12 matched lines × 2 locations) · ×1

Duplicated block with local edits (12 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:433 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:433 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:117 — the two spans are one implementation copied and then locally edited — 73 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 (10 lines × 2 locations) · ×1

Duplicated block (10 lines × 2 locations) agent-skills/memory-lint/scripts/memory-lint.mjs:472 — agent-skills/memory-lint/scripts/memory-lint.mjs:472 · agent-skills/refresh-metadata/scripts/refresh-metadata.mjs:96 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.

R10 · Code Duplication · Duplicated block with local edits (9 matched lines × 2 locations) · ×1

Duplicated block with local edits (9 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:24 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx:24 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:117 — the two spans are one implementation copied and then locally edited — 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.

R10 · Code Duplication · Duplicated block (9 lines × 3 locations) · ×1

Duplicated block (9 lines × 3 locations) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:155 — system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:155 · system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:173 · system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:208 — all 3 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 (8 lines × 3 locations) · ×1

Duplicated block (8 lines × 3 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs:553 — agent-skills/memory-lint/scripts/test_memory_lint.mjs:553 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:874 · agent-skills/memory-lint/scripts/test_memory_lint.mjs:914 — all 3 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.

R2 · Cyclomatic Complexity · Complex function Playground (cyclomatic 80, cognitive 74) · ×1

Complex function Playground (cyclomatic 80, cognitive 74) system/minigraph-playground-engine/webapp/src/components/Playground.tsx:87 — Playground has cyclomatic complexity 80 and cognitive complexity 74; 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 GraphView (cyclomatic 58, cognitive 47) · ×1

Complex function GraphView (cyclomatic 58, cognitive 47) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:95 — GraphView has cyclomatic complexity 58 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 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 computeLayout (cyclomatic 51, cognitive 86) · ×1

Complex function computeLayout (cyclomatic 51, cognitive 86) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1053 — computeLayout has cyclomatic complexity 51 and cognitive complexity 86; 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 classifyMessage (cyclomatic 40, cognitive 42) · ×1

Complex function classifyMessage (cyclomatic 40, cognitive 42) system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:44 — classifyMessage has cyclomatic complexity 40 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 ConsoleMessage (cyclomatic 33, cognitive 29) · ×1

Complex function ConsoleMessage (cyclomatic 33, cognitive 29) system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx:35 — ConsoleMessage has cyclomatic complexity 33 and cognitive complexity 29; 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 NodeContextMenu (cyclomatic 33, cognitive 27) · ×1

Complex function NodeContextMenu (cyclomatic 33, cognitive 27) system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx:39 — NodeContextMenu has cyclomatic complexity 33 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 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 archive_facts (cyclomatic 26, cognitive 38) · ×1

Complex function archive_facts (cyclomatic 26, cognitive 38) agent-skills/archive-fact/scripts/archive-fact.mjs:91 — archive_facts has cyclomatic complexity 26 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 scan_lines (cyclomatic 25, cognitive 50) · ×1

Complex function scan_lines (cyclomatic 25, cognitive 50) agent-skills/memory-lint/scripts/memory-lint.mjs:956 — scan_lines has cyclomatic complexity 25 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.

R2 · Cyclomatic Complexity · Complex function main (cyclomatic 22, cognitive 36) · ×1

Complex function main (cyclomatic 22, cognitive 36) agent-skills/memory-lint/scripts/memory-lint.mjs:1046 — main has cyclomatic complexity 22 and cognitive complexity 36; 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 minimizeCrossings (cyclomatic 22, cognitive 28) · ×1

Complex function minimizeCrossings (cyclomatic 22, cognitive 28) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:703 — minimizeCrossings has cyclomatic complexity 22 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 RightPanel (cyclomatic 22, cognitive 21) · ×1

Complex function RightPanel (cyclomatic 22, cognitive 21) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:67 — RightPanel 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 check_undeclared_references (cyclomatic 21, cognitive 38) · ×1

Complex function check_undeclared_references (cyclomatic 21, cognitive 38) agent-skills/memory-lint/scripts/memory-lint.mjs:700 — check_undeclared_references has cyclomatic complexity 21 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 handleWheel (cyclomatic 21, cognitive 24) · ×1

Complex function handleWheel (cyclomatic 21, cognitive 24) system/minigraph-playground-engine/webapp/src/hooks/useHelpScrollNavigation.ts:109 — handleWheel has cyclomatic complexity 21 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 SessionMenuContent (cyclomatic 21, cognitive 20) · ×1

Complex function SessionMenuContent (cyclomatic 21, cognitive 20) system/minigraph-playground-engine/webapp/src/components/SessionMenu/SessionMenu.tsx:34 — SessionMenuContent has cyclomatic complexity 21 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 validateNodeFormState (cyclomatic 19, cognitive 24) · ×1

Complex function validateNodeFormState (cyclomatic 19, cognitive 24) system/minigraph-playground-engine/webapp/src/graphActions/validation.ts:58 — validateNodeFormState has cyclomatic complexity 19 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 collectPathsFromText (cyclomatic 19, cognitive 22) · ×1

Complex function collectPathsFromText (cyclomatic 19, cognitive 22) system/minigraph-playground-engine/webapp/src/graphRun/graphInputPaths.ts:14 — collectPathsFromText has cyclomatic complexity 19 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 MockUploadPanel (cyclomatic 16, cognitive 15) · ×1

Complex function MockUploadPanel (cyclomatic 16, cognitive 15) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:71 — MockUploadPanel has cyclomatic complexity 16 and cognitive complexity 15; 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 segmentsIntersect (cyclomatic 16, cognitive 15) · ×1

Complex function segmentsIntersect (cyclomatic 16, cognitive 15) system/minigraph-playground-engine/webapp/src/utils/__tests__/graphTransformer.test.ts:187 — segmentsIntersect has cyclomatic complexity 16 and cognitive complexity 15; 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 NodeEditPanel (cyclomatic 16, cognitive 14) · ×1

Complex function NodeEditPanel (cyclomatic 16, cognitive 14) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:47 — NodeEditPanel has cyclomatic complexity 16 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 transposeForBetterScore (cyclomatic 15, cognitive 46) · ×1

Complex function transposeForBetterScore (cyclomatic 15, cognitive 46) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:642 — transposeForBetterScore has cyclomatic complexity 15 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.

R6 · Tooling · No lint script · ×1

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

R7 · Dead Code · Dead file (~185 LoC) · ×1

Dead file (~185 LoC) agent-skills/archive-fact/scripts/test_archive_fact.mjs — no import path from any entry point (8 application, 8 tooling, 41 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make

R7 · Dead Code · Dead file (~164 LoC) · ×1

Dead file (~164 LoC) agent-skills/refresh-metadata/scripts/test_refresh_metadata.mjs — no import path from any entry point (8 application, 8 tooling, 41 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make

R7 · Dead Code · Dead file (~129 LoC) · ×1

Dead file (~129 LoC) system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts — no import path from any entry point (8 application, 8 tooling, 41 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make

R7 · Dead Code · Dead file (~20 LoC) · ×1

Dead file (~20 LoC) system/minigraph-playground-engine/webapp/src/protocol/index.ts — no import path from any entry point (8 application, 8 tooling, 41 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 'fake-indexeddb' · ×1

Unused dependency 'fake-indexeddb' — Declared in system/minigraph-playground-engine/webapp/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 — 13 finding(s)

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D31 · IaC & Container Security · REDACTED IaC · ×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

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

P3 · Security & performance tooling · No SAST · ×1

No SAST — No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 11581 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

R7 · Dead Code · Unused export 'buildConnectCommand' · ×1

Unused export 'buildConnectCommand' system/minigraph-playground-engine/webapp/src/clipboard/commandBuilder.ts:62 — Nothing imports this binding — it is safe to review for removal.

R7 · Dead Code · Unused export 'putItem' · ×1

Unused export 'putItem' system/minigraph-playground-engine/webapp/src/clipboard/db.ts:95 — Nothing imports this binding — it is safe to review for removal.

R7 · Dead Code · Unused export 'ORDERED_HELP_PAGES' · ×1

Unused export 'ORDERED_HELP_PAGES' system/minigraph-playground-engine/webapp/src/data/helpContent.ts:193 — Nothing imports this binding — it is safe to review for removal.

R7 · Dead Code · Unused export 'SESSION_RESTARTED_MSG' · ×1

Unused export 'SESSION_RESTARTED_MSG' system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:30 — Nothing imports this binding — it is safe to review for removal.

R7 · Dead Code · Unused export 'isLargePayloadMessage' · ×1

Unused export 'isLargePayloadMessage' system/minigraph-playground-engine/webapp/src/utils/messageParser.ts:204 — Nothing imports this binding — it is safe to review for removal.

R7 · Dead Code · Unused export 'isMockUploadMessage' · ×1

Unused export 'isMockUploadMessage' system/minigraph-playground-engine/webapp/src/utils/messageParser.ts:228 — Nothing imports this binding — it is safe to review for removal.

Minor — 1 finding(s)

D10 · Test Quality · Skipped (documented) · ×1

Skipped (documented): wrapsAnExportFailureWithContextAndCause system/ai-contract-provider/src/test/java/org/platformlambda/discovery/OfflineSkillWriterTest.java:93 — Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a JUnit assumption

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.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-47fb2252d96d4b5b95d6e9d9c3c0942f/history.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-47fb2252d96d4b5b95d6e9d9c3c0942f/tree.json --exit-code 0 --source .	0	artifacts/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/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .	18	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	—
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	3	artifacts/raw/trivy-config.json
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 29 file(s) — `agent-skills/archive-fact/scripts/archive-fact.mjs`, `agent-skills/memory-lint/scripts/memory-lint.mjs`, `agent-skills/refresh-metadata/scripts/refresh-metadata.mjs`, `connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java`, `extensions/reactive-postgres/src/main/java/org/platformlambda/db/SqlPreparedStatement.java`, … (+24 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.	0	—
D37 · Vulnerability-disclosure Policy	disclosure	—	disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.	0	—
D40 · Network Egress Confinement	runtime-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 Confinement	runtime-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 Enforcement	runtime-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 Dependencies	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	—

Run 01a0c4aa-292c-7692-81bd-1ac1ac4f4ff5 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Accenture/mercury-Composable

Findings by grade

This survey was produced by

Executive summary

Top priorities

Diagnosis — what's actually going on

Architecture — module dependency matrix

At a glance — Code Health · 81% · Strong ·

At a glance — Architecture · 84% · Strong ·

At a glance — Maturity · 84% · Strong ·

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

At a glance — Security · 60% · Adequate · gated by D36 ·

At a glance — Accessibility · 56% · Adequate · gated by AC3 ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

The LLM boundary

Dimensions

Frontend & cross-cutting dimensions

WCAG coverage — what static analysis assessed

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts