Public report of Accenture/mercury-composable, published 10 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.2). Assert signed this survey, so anyone you share the signed package with can check, without an account, that it came from Assert and hasn't been changed since. Check a package → Signed 10 November 2026, 14:31 UTC · Survey ID cd_e16dd8d9b9ba46d99770400127d7a103

Accenture/mercury-composable

Measured 10 November 2026, 14:29 UTC, at code version 3634b1a

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

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

CAI score 58out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey

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

A large codebase: 104,146 lines of product code in 33 projects, tests not counted · Estimated rebuild effort: about 1.5 person-years · Weakest lens: Accessibility, 44

Findings by how serious they are

31 critical 532 serious 48 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
10 November 2026, 14:29 UTC

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

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

78of 78 dimensions measured by tools.
597of 611 findings point to an exact file and line, so you can open each one in the code. The other 14 concern the repository as a whole, such as missing documentation.
78dimensions across 7 lenses, read from 104,146 lines of product code in 33 projects.
Chapters

Executive summary

Accenture/mercury-composable falls short of our standard for production because it has pages that don't say their language. It scores 58 out of 100 and is rated Adequate, and 17 of its 31 critical findings are security problems.

Accessibility, at 44, is the weakest lens and counts most in the score. The best first steps are fixing focus, motion and contrast and adding automated security scanning, each worth about 5 points. Raising Accessibility to 70 would lift the score to about 67.

Eleven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Three settings leave the servers or containers unsafe, and two pipeline steps install packages that can change without warning. Pinning each tool to an exact version, correcting the unsafe settings and pinning what the pipeline installs would close these risks. Reading outside data into plain values would fix the place where outside data is turned straight into objects. The six pages or frames without a title need a descriptive title.

The product code is 104,146 lines, about €210,000 to rebuild. Two of our security checks couldn't finish, among them the one for known security holes in its packages, so those results are missing, not clean passes.

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

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

If Accessibility rose from 44 to 70, the lowest score rated Strong, the score would rise from 58 to about 67.

Code composition: what the lines of code are
Product code 61%Tests 39%
New since the last survey: 34 findings

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

  • Cyclomatic Complexity · ToolCatalog.parseRow (cyclomatic 16) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolCatalog.java
  • God Classes · ClassTooLong: AgentLoop extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java
  • God Classes · TooManyMethods: AgentLoop extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java
  • God Classes · FileTooLong: agentloop/AgentLoop.java extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java
  • God Classes · TooManyMethods: ToolSchema extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java
  • Code Duplication · Edited copy of a member (13 corresponding lines) system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java
  • Code Duplication · Duplicated block (47 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java
  • Code Duplication · Duplicated block (22–23 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java
  • Code Duplication · Duplicated block (10–11 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java
  • Code Duplication · Duplicated block (11 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java
  • Code Duplication · Duplicated block (8 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java
  • Code Duplication · Duplicated block (7 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java
  • Code Duplication · Duplicated block (6–7 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Lexer.java
  • Code Duplication · Duplicated block (6 lines × 5) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java
  • Code Duplication · Duplicated block (6 lines × 3) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java
  • Code Duplication · Duplicated block (5 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java
  • Code Duplication · Duplicated block (7 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java
  • Code Duplication · Duplicated block (7 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java
  • Code Duplication · Duplicated block (6 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java
  • Code Duplication · Duplicated block (8 lines × 2) examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/DecryptFields.kt
  • Coupling · Off the main sequence: minimalist-kafka
  • Churn × Complexity Hotspots · Hotspot: system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java
  • Churn × Complexity Hotspots · Repeated repair: system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java
  • IaC & Container Security · REDACTED
  • IaC & Container Security · REDACTED
  • IaC & Container Security · REDACTED
  • IaC & Container Security · REDACTED
  • Large Files · system/minigraph-playground-engine/webapp/src/components/Playground.tsx: 1117 lines of code system/minigraph-playground-engine/webapp/src/components/Playground.tsx
  • Test Coverage · No test reaches this file templates/starter-graph/scripts/ai-companion-broker.mjs
  • Exception handling · Swallowed exception (empty catch) REDACTED
  • Exception handling · Swallowed exception (empty catch) REDACTED

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

Fixed since the last survey: 68 findings

These 68 critical or serious findings were in the previous survey, on 23 October 2026, and are gone from this one.

  • Cyclomatic Complexity · check-doc-canon.main (cyclomatic 41) scripts/check-doc-canon.py
  • Cyclomatic Complexity · check-minigraph-grammar.main (cyclomatic 17) scripts/check-minigraph-grammar.py
  • Cognitive Complexity · check-doc-canon.main (cognitive 85) scripts/check-doc-canon.py
  • Cognitive Complexity · check-minigraph-grammar.main (cognitive 21) scripts/check-minigraph-grammar.py
  • Code Duplication · Edited copy of a member (13 corresponding lines) system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java
  • Code Duplication · Duplicated block (25 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java
  • Code Duplication · Duplicated block (16 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java
  • Code Duplication · Duplicated block (11 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java
  • Code Duplication · Duplicated block (7 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java
  • Code Duplication · Duplicated block (6 lines × 3) system/event-script-engine/src/main/java/com/accenture/util/JsonPathSource.java
  • Code Duplication · Duplicated block (6 lines × 2) system/event-script-engine/src/main/java/com/accenture/util/JsonPathSource.java
  • Code Duplication · Duplicated block (5 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java
  • Code Duplication · Duplicated block (6 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java
  • Code Duplication · Duplicated block (10 lines × 2) examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/DecryptFields.kt
  • Churn × Complexity Hotspots · Hotspot: system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx system/minigraph-playground-engine/webapp/src/components/GraphView/NodeContextMenu.tsx
  • Churn × Complexity Hotspots · Hotspot: system/minigraph-playground-engine/webapp/src/protocol/classifier.ts system/minigraph-playground-engine/webapp/src/protocol/classifier.ts
  • Churn × Complexity Hotspots · Hotspot: system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx
  • Churn × Complexity Hotspots · Hotspot: system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx
  • Churn × Complexity Hotspots · Repeated repair: system/platform-core/src/main/java/org/platformlambda/core/system/WorkerHandler.java system/platform-core/src/main/java/org/platformlambda/core/system/WorkerHandler.java
  • Code Duplication · Duplicated block (10 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.tsx
  • Code Duplication · Duplicated block (10 lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphSetPanel.ts
  • Code Duplication · Duplicated block (9 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs
  • Code Duplication · Duplicated block (9 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs
  • Code Duplication · Duplicated block with local edits (9 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphContextMenu.tsx
  • Code Duplication · Duplicated block (9 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx
  • Code Duplication · Duplicated block (9 lines × 3 locations) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx
  • Code Duplication · Duplicated block (8 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (8 lines × 3 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (8 lines × 3 locations) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx
  • Code Duplication · Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx
  • Code Duplication · Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx
  • Code Duplication · Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/PayloadEditor/SampleButtons.tsx
  • Code Duplication · Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/graphActions/minigraphCommandBuilder.ts
  • Code Duplication · Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts
  • Code Duplication · Duplicated block (8 lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphSetPanel.ts
  • Code Duplication · Duplicated block (7 lines × 2 locations) agent-skills/memory-lint/scripts/memory-lint.mjs
  • Code Duplication · Duplicated block (7 lines × 2 locations) agent-skills/memory-lint/scripts/memory-lint.mjs
  • Code Duplication · Duplicated block (7 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts
  • Code Duplication · Duplicated block (7 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/messageParser.ts
  • Code Duplication · Duplicated block (6 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs
  • Code Duplication · Duplicated block (6 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (6 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (6 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (6 lines × 2 locations) system/minigraph-playground-engine/webapp/src/graphActions/propertyRows.ts
  • Code Duplication · Duplicated block with local edits (6 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/graphActions/validation.ts
  • Code Duplication · Duplicated block (5 lines × 2 locations) agent-skills/archive-fact/scripts/archive-fact.mjs
  • Code Duplication · Duplicated block (5 lines × 2 locations) agent-skills/archive-fact/scripts/test_archive_fact.mjs
  • Code Duplication · Duplicated block (5 lines × 7 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (5 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (5 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (5 lines × 2 locations) agent-skills/memory-lint/scripts/test_memory_lint.mjs
  • Code Duplication · Duplicated block (5 lines × 4 locations) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts
  • Code Duplication · Duplicated block (5 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx
  • Code Duplication · Duplicated block (5 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphFile.ts
  • Code Duplication · Duplicated block (5 lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphSet.ts
  • Large Files · system/minigraph-playground-engine/webapp/src/components/Playground.tsx: 1111 lines of code system/minigraph-playground-engine/webapp/src/components/Playground.tsx
  • Test Coverage · No test reaches this file templates/starter-graph/scripts/playground-session-broker.mjs
  • Exception handling · Swallowed exception (empty catch) REDACTED
  • Exception handling · Swallowed exception (empty catch) REDACTED
Rebuild cost: about €210,000 · Estimate
Cost to rebuild€71,000 to €360,000, for 1,188 to 3,769 hours of work, about 1.5 person-years for 1 to 3 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 58. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 104,146 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Raises the score by about 5 points · Medium effort · Visual & motion safety
2
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.
Raises the score by about 5 points · Medium effort · Security & performance tooling
3
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Raises the score by about 3 points · Medium effort · Page structure

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €210,000 to build again, about 1.5 person-years of work. Its weakest lens is Accessibility, at 44 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.4 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 194,266 lines over the last 90 days, which is about 787,857 lines a year. At that pace, the extra work comes to an estimated 39.4 to 262.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

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

arch agent-loop agent-loop platform-core platform-core agent-loop->platform-core ai-contract-provider ai-contract-provider event-script-engine event-script-engine ai-contract-provider->event-script-engine ai-contract-provider->platform-core api-playground api-playground api-playground->platform-core cloud-connector cloud-connector cloud-connector->platform-core distributed-cache distributed-cache distributed-cache->platform-core redis-connection redis-connection distributed-cache->redis-connection dynatrace-oneagent dynatrace-oneagent dynatrace-oneagent->platform-core event-script-engine->platform-core graph-packager graph-packager minigraph-playground-engine minigraph-playground-engine graph-packager->minigraph-playground-engine kafka-connector kafka-connector kafka-connector->cloud-connector kafka-presence kafka-presence kafka-presence->kafka-connector service-monitor service-monitor kafka-presence->service-monitor kafka-standalone kafka-standalone kafka-standalone->platform-core lab-edge lab-edge lab-edge->dynatrace-oneagent minimalist-kafka minimalist-kafka lab-edge->minimalist-kafka lab-worker lab-worker lab-worker->dynatrace-oneagent lab-worker->minimalist-kafka minigraph-playground-engine->event-script-engine minimalist-kafka->event-script-engine redis-connection->platform-core rest-spring-4 rest-spring-4 rest-spring-4->platform-core service-monitor->cloud-connector service-monitor->platform-core sync-over-async sync-over-async sync-over-async->platform-core sync-over-async->redis-connection __more__ +11 more projects

Architecture: which parts of the code depend on which

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

236 modules, with 343 dependencies between them. One loop runs through 7 of the modules, marked above the diagonal.

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 com.accenture.models2 org.platformlambda.core.exception3 org.platformlambda.core.util.common4 system.minigraph-playground-engine.webapp.src.components5 system.minigraph-playground-engine.webapp.src.components.RightPanel.RightPanel6 system.minigraph-playground-engine.webapp.src.data.helpContent7 system.minigraph-playground-engine.webapp.src.protocol.bus8 system.minigraph-playground-engine.webapp.src.utils.graphTypes9 org.platformlambda.automation.models10 org.platformlambda.core.util11 system.minigraph-playground-engine.webapp.src.clipboard.db12 system.minigraph-playground-engine.webapp.src.components.GraphAuthoring.useGraphAuthoring13 system.minigraph-playground-engine.webapp.src.components.GraphView14 system.minigraph-playground-engine.webapp.src.graphActions15 system.minigraph-playground-engine.webapp.src.hooks16 system.minigraph-playground-engine.webapp.src.utils17 org.platformlambda.core.serializers18 org.platformlambda.mini.kafka.schema19 system.minigraph-playground-engine.webapp.src.clipboard20 org.platformlambda.automation.util21 org.platformlambda.core.system22 org.platformlambda.core.models23 com.accenture.minigraph.progress24 com.accenture.util25 org.platformlambda.automation.services26 org.platformlambda.core.graph27 org.platformlambda.mini.kafka28 org.platformlambda.redis29 org.platformlambda.scheduler30 org.platformlambda.scheduler.services31 org.platformlambda.services32 com.accenture.automation33 com.accenture.minigraph.models34 org.platformlambda.automation.http35 org.platformlambda.sync36 org.platformlambda.twin.kafka37 com.accenture.minigraph.common38 com.accenture.minigraph.services39 com.accenture.minigraph.skills40 com.accenture.minigraph.start
1 com.accenture.models
2 org.platformlambda.core.exception
3 org.platformlambda.core.util.common
4 system.minigraph-playground-engine.webapp.src.components
5 system.minigraph-playground-engine.webapp.src.components.RightPanel.RightPanel
6 system.minigraph-playground-engine.webapp.src.data.helpContent
7 system.minigraph-playground-engine.webapp.src.protocol.bus
8 system.minigraph-playground-engine.webapp.src.utils.graphTypes
9 org.platformlambda.automation.models12
10 org.platformlambda.core.util23
11 system.minigraph-playground-engine.webapp.src.clipboard.db1
12 system.minigraph-playground-engine.webapp.src.components.GraphAuthoring.useGraphAuthoring1
13 system.minigraph-playground-engine.webapp.src.components.GraphView1
14 system.minigraph-playground-engine.webapp.src.graphActions5
15 system.minigraph-playground-engine.webapp.src.hooks12
16 system.minigraph-playground-engine.webapp.src.utils12
17 org.platformlambda.core.serializers11
18 org.platformlambda.mini.kafka.schema12
19 system.minigraph-playground-engine.webapp.src.clipboard24
20 org.platformlambda.automation.util11
21 org.platformlambda.core.system26140
22 org.platformlambda.core.models1111
23 com.accenture.minigraph.progress12
24 com.accenture.util41
25 org.platformlambda.automation.services932229
26 org.platformlambda.core.graph23
27 org.platformlambda.mini.kafka24715
28 org.platformlambda.redis111
29 org.platformlambda.scheduler223
30 org.platformlambda.scheduler.services112
31 org.platformlambda.services113
32 com.accenture.automation98172
33 com.accenture.minigraph.models111
34 org.platformlambda.automation.http2121161
35 org.platformlambda.sync324
36 org.platformlambda.twin.kafka1216
37 com.accenture.minigraph.common3182312
38 com.accenture.minigraph.services1331011144
39 com.accenture.minigraph.skills66241110
40 com.accenture.minigraph.start3212
Uses a module listed above itPart of a loopThe module itself
1 com.accenture.models2 org.platformlambda.core.exception3 org.platformlambda.core.util.common4 system.minigraph-playground-engine.webapp.src.components5 system.minigraph-playground-engine.webapp.src.components.RightPanel.RightPanel6 system.minigraph-playground-engine.webapp.src.data.helpContent7 system.minigraph-playground-engine.webapp.src.protocol.bus8 system.minigraph-playground-engine.webapp.src.utils.graphTypes9 org.platformlambda.automation.models10 org.platformlambda.core.util11 system.minigraph-playground-engine.webapp.src.clipboard.db12 system.minigraph-playground-engine.webapp.src.components.GraphAuthoring.useGraphAuthoring13 system.minigraph-playground-engine.webapp.src.components.GraphView14 system.minigraph-playground-engine.webapp.src.graphActions15 system.minigraph-playground-engine.webapp.src.hooks16 system.minigraph-playground-engine.webapp.src.utils17 org.platformlambda.core.serializers18 org.platformlambda.mini.kafka.schema19 system.minigraph-playground-engine.webapp.src.clipboard20 org.platformlambda.automation.util21 org.platformlambda.core.system22 org.platformlambda.core.models23 com.accenture.minigraph.progress24 com.accenture.util25 org.platformlambda.automation.services26 org.platformlambda.core.graph27 org.platformlambda.mini.kafka28 org.platformlambda.redis29 org.platformlambda.scheduler30 org.platformlambda.scheduler.services31 org.platformlambda.services32 com.accenture.automation33 com.accenture.minigraph.models34 org.platformlambda.automation.http35 org.platformlambda.sync36 org.platformlambda.twin.kafka37 com.accenture.minigraph.common38 com.accenture.minigraph.services39 com.accenture.minigraph.skills40 com.accenture.minigraph.startcom.accenture.models1org.platformlambda.core.exception2org.platformlambda.core.util.common3system.minigraph-playground-engine.webapp.src.components4system.minigraph-playground-engine.webapp.src.components.RightPanel.RightPanel5system.minigraph-playground-engine.webapp.src.data.helpContent6system.minigraph-playground-engine.webapp.src.protocol.bus7system.minigraph-playground-engine.webapp.src.utils.graphTypes8org.platformlambda.automation.models9org.platformlambda.core.util10system.minigraph-playground-engine.webapp.src.clipboard.db11system.minigraph-playground-engine.webapp.src.components.GraphAuthoring.useGraphAuthoring12system.minigraph-playground-engine.webapp.src.components.GraphView13system.minigraph-playground-engine.webapp.src.graphActions14system.minigraph-playground-engine.webapp.src.hooks15system.minigraph-playground-engine.webapp.src.utils16org.platformlambda.core.serializers17org.platformlambda.mini.kafka.schema18system.minigraph-playground-engine.webapp.src.clipboard19org.platformlambda.automation.util20org.platformlambda.core.system21org.platformlambda.core.models22com.accenture.minigraph.progress23com.accenture.util24org.platformlambda.automation.services25org.platformlambda.core.graph26org.platformlambda.mini.kafka27org.platformlambda.redis28org.platformlambda.scheduler29org.platformlambda.scheduler.services30org.platformlambda.services31com.accenture.automation32com.accenture.minigraph.models33org.platformlambda.automation.http34org.platformlambda.sync35org.platformlambda.twin.kafka36com.accenture.minigraph.common37com.accenture.minigraph.services38com.accenture.minigraph.skills39com.accenture.minigraph.start401223111512121112241126140111112419322292324715111223112113981721112121161324121631823121331011144662411103212+196 more modules (most-connected shown)

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

At a glance — Architecture · 95% · Exemplary ·

At a glance — Maturity · 91% · Exemplary ·

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

At a glance — Security · 79% · Checked 4 of 11 ·

At a glance — Accessibility · 44% · Weak · gated by AC6 ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection17High / Critical
A02:2025 — Security Misconfiguration7High / Critical

Roadmap

Top priorities: Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1; 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; Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

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

Do thisHelpsEffortDimension
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.+5.4 ptsMediumVisual & motion safety
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.8 ptsMediumSecurity & performance tooling
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+3.3 ptsMediumPage structure
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.+3.3 ptsMediumA11y enforcement
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+2.9 ptsMediumKeyboard semantics
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.+1.8 ptsMediumDeployment & Rollback
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+0.5 ptsLowStatic Analysis (SAST)
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2).+0.5 ptsLowStatic Analysis (SAST)

File quality

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

FileScoreBandWorst signal
REDACTED1.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedIaC & Container Security: High IaC: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedIaC & Container Security: High IaC: REDACTED
REDACTED5.1MixedIaC & Container Security: High IaC: REDACTED
system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java6.3MixedGod Classes: ClassTooLong: AsyncHttpClient
system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts7.0MixedCyclomatic Complexity: graphTransformer.computeLayout (cyclomatic 54)
agent-skills/memory-lint/scripts/memory-lint.mjs7.0MixedCyclomatic Complexity: memory-lint.scan_lines (cyclomatic 26)
agent-skills/memory-lint/scripts/memory-lint.py7.0MixedCyclomatic Complexity: memory-lint._scan_lines (cyclomatic 24)
system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java7.0MixedGod Classes: TooManyMethods: EventEmitter
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java7.0MixedCode Duplication: Members sharing a duplicated core (7 members, 50+ identical tokens)
system/platform-core/src/main/java/org/platformlambda/automation/util/SimpleHttpUtility.java7.0MixedCode Duplication: Duplicated block (7 lines × 2)
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java7.0MixedCode Duplication: Duplicated block (15–17 lines × 2)
system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java7.0MixedGod Classes: ClassTooLong: HttpRouter
system/platform-core/src/main/java/org/platformlambda/core/models/AsyncInbox.java7.0MixedCode Duplication: Near-duplicate member family (4 members, 14 shared lines)
system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java7.0MixedCode Duplication: Edited copy of a member (23 corresponding lines)
system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts7.1MixedCyclomatic Complexity: graphSchema.schemaRowIssues (cyclomatic 25)
system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts7.1MixedCognitive Complexity: useGraphAuthoring.eventMatchesPendingAction (cognitive 19)
extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java7.1MixedGod Classes: TooManyMethods: ToolSchema

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

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

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

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

Could not be resolved — 16

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

Methodology & how to trust this report

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

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

What we checked — 78 dimensions across the health lenses
D1D2D3D4D5D6D7D9D10D13D14D15D17D19D20D24D26D27D29D31D34D35D44AC2AC3AC4AC5AC6AC7AX1AX10AX2AX3AX5AX6IC1M1M2M3M4P1P10P2P3P4P6P7PF3R1R10R2R3R4R5R6R7R8R9X1X12X15X16X17X18X19X2X21X23X24X25X26X27X28X29X3X30X4X5

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 597 of 611 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1c5dd-85c4-7643-914b-fae8fa6335a3.

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 — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 1,851 test(s) behind this row are the ones the code-model census could read, and this repository also carries at least 62 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .java, and the jvm executor ran against the .java half and did not finish re-running within its tier budget — 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/ (497 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. The half was driven by a runner we ship, so this is not a missing-runner gap.
  • D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — a Gradle build resolved 14 artifact(s) across its subprojects (1 behind a shipped release, reported), but the currency signal was not established over the whole graph, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
  • 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 (13 contributor(s) across 2202 commit(s) sampled, automation and bot accounts excluded). One of them holds 94% of the history; the other 12 hold 0.5% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (system/twin-kafka/pom.xml), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D28 Secrets (history) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `gitleaks` TIMED OUT after 180.3s against a 180s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. Nothing about this repository is asserted by the absence of a result; the budget is ours to raise, and raising it is our backlog item, not an action for this repository's owner.
  • D30 Dependency Vulnerabilities — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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.
  • D31 IaC & Container Security — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Checkov ran but its report could not be read (checkov produced no output — not a clean result). Every misconfiguration only checkov reports — most of its Terraform, CloudFormation, Bicep and Ansible policies — is absent from this card, so its absence here is not evidence those resources are configured correctly.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `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/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java`, … (+36 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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.
  • AX6 Interface segregation — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — 2 | EXPOSE 9092 3 | WORKDIR /app 4 | >>> COPY target/kafka-standalone-4.9.2-exec.jar . 5 | ENTRYPOINT ["java","-jar","kafka-standalone-4.9.2-exec.jar"] 6 | -------------------- ERROR: failed to solve: failed to compute cache key: failed to calculate checksum of ref c8e3ddf5-2cdd-4a77-ba49-108a4e5ad4ce::3sgiujpxd5z5v3dvp7n3imu18: "/target/kafka-standalone-4.9.2-exec.jar": not found; runtime evidence skipped.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
  • C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
  • C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
  • ED5 Idempotency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check decides whether a handler's mutation is safe to re-run by recognising its persistence writes (a database save, a repository write, an event publish) and its guards. Those markers are .NET member names, so in this repository's language a write such as `repository.save(order)` is not recognised and a same-named call on an unrelated library type could be. The handlers were found; their idempotency was neither confirmed nor ruled out.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Java, Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 42 further occurrence(s) are not listed individually; the score already reflects all 82.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • 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").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • 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.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • 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: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

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

49 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Playground.Playground at 176. A further 9 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 MsgPackReader.skipValue at 38 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackReader.java (MsgPackReader.skipValue at 38), system/platform-core/src/main/java/org/platformlambda/core/serializers/CanonicalPackager.java (CanonicalPackager.write at 21), system/minimalist-jsonpath/src/main/java/org/platformlambda/mini/jsonpath/IRegexp.java (IRegexp.singleCharEscape at 19), 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 176)system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113
GraphView.GraphView (cyclomatic 139)system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113
useSessionCollaboration.useSessionCollaboration (cyclomatic 58)system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:40
MockUploadPanel.MockUploadPanel (cyclomatic 57)system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153

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

What to do

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

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

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

60 method(s) exceeded the cognitive complexity threshold of 15; the worst was Playground.Playground at 187.

Playground.Playground (cognitive 187)system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113
GraphView.GraphView (cognitive 145)system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113
graphTransformer.computeLayout (cognitive 91)system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131
MockUploadPanel.MockUploadPanel (cognitive 57)system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153
useSessionCollaboration.useSessionCollaboration (cognitive 54)system/minigraph-playground-engine/webapp/src/session/useSessionCollaboration.ts:40

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

What to do

  1. Bring the 3 bodies over 60 down to 60 or less in Cognitive Complexity — start with Playground.Playground (cognitive 187), GraphView.GraphView (cognitive 145), graphTransformer.computeLayout (cognitive 91). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cognitive Complexity from 5.4 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes7.6 / 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.6 / 10 · rule-coverage 100% · ceiling Prevented

92 god class(es) detected.

FunctionTooLong: GraphView.GraphView · ×24system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113
TooManyMethods: GraphCommandService · ×24system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:58
ClassTooLong: GraphCommandService · ×22system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:58
FileTooLong: services/GraphCommandService.java · ×22system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java

What to do

  1. Resolve the 24 FunctionTooLong finding(s) in God Classes — start with graphTransformer.ts (2), GraphView.tsx, MockUploadPanel.tsx. — One of this dimension's main actionable groups (24 warning-level).
  2. Resolve the 24 TooManyMethods finding(s) in God Classes — start with GraphCommandService.java, Utility.java, REDACTED. — One of this dimension's main actionable groups (24 warning-level).
  3. Resolve the 22 ClassTooLong finding(s) in God Classes — start with GraphCommandService.java, TaskExecutor.java, EventEmitter.java. — One of this dimension's main actionable groups (22 warning-level).

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

D4 · Code Duplication9.4 / 10Stronggated by 144 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.4 / 10 · rule-coverage 100% · ceiling Verified

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

Duplicated block (7 lines × 2) · ×16extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:347
Duplicated block (6 lines × 2) · ×13connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java:55
Duplicated block (8 lines × 2) · ×10connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/CloudHealthCheck.java:173
Duplicated block (9 lines × 2) · ×9connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/ConnectorConfig.java:148
Duplicated block (11 lines × 2) · ×8system/event-script-engine/src/main/java/com/accenture/services/SimpleExceptionHandler.java:49

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

What to do

  1. Resolve the 16 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with ToolSchema.java (3), GreaterThanOperator.java, ParseDate.java. — One of this dimension's main actionable groups (16 warning-level).
  2. Resolve the 13 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with GraphExecutor.java (2), ServiceQuery.java, EventScriptMock.java. — One of this dimension's main actionable groups (13 warning-level).
  3. Resolve the 10 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with memory-lint.py (2), CloudHealthCheck.java, GraphExecutor.java. — One of this dimension's main actionable groups (10 warning-level).

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

D5 · Coupling8.7 / 10Strong✓ Tool-verified

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

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

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

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

31 production modules (Maven+npm), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 5 module(s) off the main sequence.

Off the main sequence: minimalist-msgpack · ×5

What to do

  1. Resolve the 5 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (5 warning-level).

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

D6 · Cohesion (LCOM4)9.6 / 10Stronggated by 5 serious findings✓ Tool-verified

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

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

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

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

5 of 152 classes have LCOM4 above 3.

Low cohesion: Builder (LCOM4 14) · ×5system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaConsumerBinding.java:164

What to do

  1. Resolve the 5 Low cohesion finding(s) in Cohesion (LCOM4) — start with KafkaConsumerBinding.java, AsyncContextHolder.java, SimpleHttpUtility.java. — One of this dimension's main actionable groups (5 warning-level).

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

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

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

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

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

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

Detailed fixes: d7_recommendation.md.

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

2391 test methods: 2391 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 434 `it`/`test` case(s) across 61 test file(s) declaring at least one beside 1851 .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.

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

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

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

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

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

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

✓ On the Gold path — maintain.

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 29 declared JVM dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the coordinates this repository's 52 Maven/Gradle manifest(s) declare with a version resolvable from the manifest itself — the same declaration-site closure this analysis reads for dependency currency. The JVM has no lockfile a checkout is guaranteed to carry, so this is deliberately NOT the transitive closure. 75 further coordinate(s) are declared with no version at the declaration site — inherited from a parent POM, a BOM or an unresolved Gradle version reference — and are NOT graded: this verdict covers what the checkout pins, not the full transitive graph. A further 25 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

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

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

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

Top hotspots: system/minigraph-playground-engine/webapp/src/components/Playground.tsx (15×176=2640); system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx (8×139=1112); agent-skills/memory-lint/scripts/memory-lint.mjs (16×26=416) Repeated repair below the complexity floor: system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java (4 of 5 changes were fixes)

Hotspot: system/minigraph-playground-engine/webapp/src/components/Playground.tsx · ×12system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113
Repeated repair: system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.javasystem/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java:173

What to do

  1. Resolve the 12 Hotspot finding(s) in Churn × Complexity Hotspots — start with Playground.tsx, GraphView.tsx, memory-lint.mjs. — One of this dimension's main actionable groups (12 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with ActiveEnvironment.java. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d20_recommendation.md.

D24 · Comment Value10.0 9.9 / 10Exemplary○ Nothing flagged

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

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

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

0 of 724 judged comments only repeat the code they sit on (0.0 %). 12 comment(s) in another language or script were not judged.

✓ On the Gold path — maintain.

Detailed fixes: d24_recommendation.md.

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

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

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

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

4 of 33 build units (Maven, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

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

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D29 · Static Analysis (SAST)5.1 / 10Adequate✓ Tool-verified

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

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

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

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

17 finding(s): 0 critical, 14 high, 3 medium, 0 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 50 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), … (+45 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

D31 · IaC & Container Security8.7 / 10Adequategated by 3 critical findings✓ 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 8.7 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 3 High IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 3 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).
  3. Resolve the 1 Low 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.

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

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change 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.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

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

  • This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close. — system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:127
  • 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:78

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

AC6 · Visual & motion safety2.5 / 10Critical✓ Tool-verified

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

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

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

  • `.tabBody:focus-visible` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.module.css:60
  • `.graphSurface:not([data-exporting]) :global(.react-flow__node.selectable.selected)` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.module.css:119
  • `.preview:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItem.module.css:97
  • `._graphSurface_ped3d_24:not([data-exporting]) .react-flow__node.selectable.selected` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._tabBody_xa3j1_51:focus-visible` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._preview_1ne62_13:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `.react-flow__nodesselection-rect:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/src/main/resources/public/assets/vendor-xyflow-DLioOiRN.css:1
  • `.react-flow__edge.selected` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/src/main/resources/public/assets/vendor-xyflow-DLioOiRN.css:1
  • `.react-flow__node.selectable:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — system/minigraph-playground-engine/src/main/resources/public/assets/vendor-xyflow-DLioOiRN.css:1
  • `.toast` moves (`animation: slideIn 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/Toast.module.css:21
  • `.spinner` moves (`animation: spin 0.65s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×3) — system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.module.css:545, system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.module.css:387, system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.module.css:550
  • `.chevron` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/NavMenu/NavMenu.module.css:39
  • `.dropdown` moves (`animation: fadeIn 0.12s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/NavMenu/NavMenu.module.css:76
  • `.refreshingSpinner` moves (`animation: graphRefreshSpin 0.75s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.module.css:248
  • `.stats` moves (`transition: opacity 0.2s ease, max-width 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.module.css:41
  • `.actionTooltip[data-state='open']` moves (`transition: opacity 0.12s ease 0.15s, transform 0.12s ease 0.15s, visibility 0s linear 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.module.css:111
  • `.popover` moves (`transition: opacity 0.15s ease, transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/CommandInput/CommandInput.module.css:92
  • `.removeChrome` moves (`transition: opacity 120ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItem.module.css:62
  • `.sortButtonCaret` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.module.css:118
  • `._toast_1rn7u_1` moves (`animation: .3s _slideIn_1rn7u_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._chevron_9dbh2_37` moves (`transition: transform .2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._dotConnecting_9dbh2_57` moves (`animation: 1.5s infinite _pulse_9dbh2_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._dotConnected_9dbh2_58` moves (`animation: 2s infinite _pulse_9dbh2_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._dropdown_9dbh2_65` moves (`animation: .12s _fadeIn_9dbh2_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._toolDotConnecting_7x22x_123` moves (`animation: 1.5s infinite _pulse_7x22x_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._toolDotConnected_7x22x_124` moves (`animation: 2s infinite _pulse_7x22x_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._refreshingSpinner_ped3d_242` moves (`animation: .75s linear infinite _graphRefreshSpin_ped3d_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._stats_stok4_33` moves (`transition: opacity .2s,max-width .3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._actionTooltip_stok4_76[data-state=open]` moves (`transition: opacity .12s .15s,transform .12s .15s,visibility 0s linear .15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._popover_188pe_73` moves (`transition: opacity .15s,transform .15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._spinner_15u4d_380` moves (`animation: .65s linear infinite _spin_15u4d_380`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._spinner_iz4rh_543` moves (`animation: .65s linear infinite _spin_iz4rh_543`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._spinner_7s9c5_538` moves (`animation: .65s linear infinite _spin_7s9c5_538`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._removeChrome_1ne62_40` moves (`transition: opacity .12s,transform .12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1
  • `._sortButtonCaret_1jo34_114` moves (`transition: transform .2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
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 55 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. — system/minigraph-playground-engine/webapp/package.json:33

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.
AX1 · Captive dependencies10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether any singleton service captures a scoped/transient dependency — a silent lifetime/threading bug.

Method: Roslyn scan: DI registrations parsed from AddSingleton/Scoped/Transient; each singleton checked for captured shorter-lifetime dependencies. Exhaustive, deterministic.

AX10 · Code composition9.6 / 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.
AX2 · Stateful singletons10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.

Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.

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

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

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

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

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

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

AX6 · Interface segregation9.9 / 10Exemplary✓ Tool-verified

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

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

  • `PubSubProvider` declares 18 abstract methods under just 14 distinct name(s): `cleanup`, `createQueue`, `createTopic`, `createTopic`, `deleteQueue`, `deleteTopic`, `exists`, `isStreamingPubSub`, `list`, `listen`, `partitionCount`, `publish`, `publish`, `send`, `subscribe`, `subscribe`, `unsubscribe`, `unsubscribe`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 18 separate responsibilities: a caller binds to 14 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 18 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — system/platform-core/src/main/java/org/platformlambda/core/models/PubSubProvider.java:29

What to do

  • Collapse overload sets (optional/default parameters, or an options object) — these interfaces are wide in SIGNATURES, not in responsibilities, so segregating them would relieve no caller.
IC1 · Incompleteness & stubs8.0 / 10Strong✓ Tool-verified

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

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

  • `createQueue` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:179
  • `deleteQueue` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:184
  • `send` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:386
  • `listen` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:391

What to do

  • Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
M1 · Documentation (README)9.1 / 10Exemplary✓ 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

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Describe the projects a newcomer cannot place from the root README: 7 of 52 have no README of their own, in their folder or in their family's project (`examples/kotlin-example`, `examples/rest-spring-3-example`, `system/minimalist-kafka`, `system/rest-spring-3`, `system/twin-kafka` and 2 more).
M2 · Architecture documentation10.0 / 10Exemplary✓ Tool-verified

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

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

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

Maturity · Maturity — Whether the 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.

M4 · Documentation accuracy8.0 / 10Strong✓ Tool-verified

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

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

  • system/minigraph-playground-engine/webapp/docs/build-test-deploy.md names Vitest 5, but the manifest declares `vitest` ^4.1.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — system/minigraph-playground-engine/webapp/docs/build-test-deploy.md:118

What to do

  • Reconcile the README with reality: system/minigraph-playground-engine/webapp/docs/build-test-deploy.md names Vitest 5, but the manifest declares `vitest` ^4.1.12.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

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

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

P2 · Observability9.9 / 10Exemplary✓ Tool-verified

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

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

  • Only 30/31 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `helpers/graph-packager`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
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 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:10
  • `examples/kafka-demo/node/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — examples/kafka-demo/node/package.json:12

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

P7 · Outbound HTTP resilience10.0 / 10Exemplary○ Nothing flagged

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

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

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

R1 · Type Safety9.3 / 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.
R10 · Code Duplication8.4 / 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.

  • 25 duplicated blocks under system/minigraph-playground-engine/webapp/src/components/ have copies in at least two of the sibling directories ClipboardSidebar, ConnectionPopover, Console, GraphDataView, GraphFileDialogs, GraphSetPanel (+7 more sibling(s) not listed) — 18 of them are reported below, and 7 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 25 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 25 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 25 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/GraphSetPanel/GraphSetPanel.tsx:62
  • 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/GraphSetPanel/GraphSetPanel.tsx:62 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:308 — the two spans are one implementation copied and then locally edited — 912 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/GraphSetPanel/GraphSetPanel.tsx:62
  • 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/GraphSetPanel/GraphSetPanel.tsx:138 · system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:220 — the two spans are one implementation copied and then locally edited — 212 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/components/GraphSetPanel/GraphSetPanel.tsx:138
  • 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
  • system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391 · system/minigraph-playground-engine/webapp/src/utils/graphSet.ts:97 — the two spans are one implementation copied and then locally edited — 203 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/utils/graphSchema.ts:391
  • 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:1657 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1675 — 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:1657
  • 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/hooks/useGraphFileImport.ts:93 · system/minigraph-playground-engine/webapp/src/hooks/useGraphSetPanel.ts:194 — the two spans are one implementation copied and then locally edited — 83 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/hooks/useGraphFileImport.ts:93
  • system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardDuplicateDialog.tsx:19 · system/minigraph-playground-engine/webapp/src/components/GraphFileDialogs/GraphDownloadDialog.tsx:34 — the two spans are one implementation copied and then locally edited — 55 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/ClipboardDuplicateDialog.tsx:19
  • 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:621 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:634 — 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:621
  • system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.tsx:106 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 57 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/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/GraphToolbar/GraphToolbar.tsx:70 · system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.tsx:84 — 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/GraphToolbar/GraphToolbar.tsx:70
  • system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:476 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:229 — 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:476
  • system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:167 · system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:180 — 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/Navigation.tsx:167
  • 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/components/GraphView/GraphView.tsx:480 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 63 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:480
  • 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:230 — 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/ConnectionPopover/ConnectionPopover.tsx:85 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 68 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:85
  • system/minigraph-playground-engine/webapp/src/components/GraphFileDialogs/GraphDownloadDialog.tsx:59 · system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:299 — 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/GraphFileDialogs/GraphDownloadDialog.tsx:59
  • system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:47 · system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.tsx:82 — 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/GraphSetPanel/GraphSetPanel.tsx:47
  • system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:163 · system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:176 — 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/GraphToolbar/GraphRunControls.tsx:163
  • system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:592 · 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:592
  • system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:229 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 65 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/MockUploadPanel/MockUploadPanel.tsx:229

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R2 · Cyclomatic Complexity7.2 / 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 93 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 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:113
  • GraphView has cyclomatic complexity 67 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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:113
  • computeLayout has cyclomatic complexity 57 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131
  • 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
  • schemaRowIssues has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391
  • 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
  • validateGraphModel has cyclomatic complexity 25 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 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/graphFile.ts:53
  • nodeSchema has cyclomatic complexity 23 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/graphSchema.ts:446
  • minimizeCrossings has cyclomatic complexity 23 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 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:776
  • 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
  • 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:77
  • 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
  • GraphSetPanel 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/GraphSetPanel/GraphSetPanel.tsx:26
  • 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
  • MockUploadPanel has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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:153
  • 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

What to do

  • Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
R3 · Large Files7.9 / 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.

  • system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts has 1621 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1
  • system/minigraph-playground-engine/webapp/src/components/Playground.tsx has 1117 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/components/Playground.tsx:1
  • system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx has 866 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:1
  • system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts has 707 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:1
  • system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx has 607 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:1
  • system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:1
  • system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:1

What to do

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

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

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

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×10) — templates/starter-graph/scripts/ai-companion-broker.mjs:1, REDACTED:1, extensions/api-playground/scripts/fetch-swagger-ui.js:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness8.4 / 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.
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.
R7 · Dead Code9.7 / 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 14 application, 10 tooling and 65 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 (14 application, 10 tooling, 65 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 (×2) — system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts, system/minigraph-playground-engine/webapp/src/protocol/index.ts
  • Nothing imports this binding — it is safe to review for removal. (×5) — system/minigraph-playground-engine/webapp/src/clipboard/db.ts:95, system/minigraph-playground-engine/webapp/src/data/helpContent.ts:193, system/minigraph-playground-engine/webapp/src/protocol/classifier.ts:30, …

What to do

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

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

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

  • Declared in 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.
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.

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

X15 · Unvalidated length from an untrusted reader3.5 / 10Weak✓ Tool-verified

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

  • `len` is read from the bytes being parsed at line 371 (`getInt`), then used to size a `ByteBuffer.allocate` at line 372 — and nowhere in its scope is `len` bounded from above — compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an `OutOfMemoryError` or, negative, throws `NegativeArraySizeException` out of a parser whose failure path was written for malformed input, not for hostile input. Bound `len` against the bytes actually remaining and a maximum the format allows before allocating. — system/platform-core/src/main/java/org/platformlambda/core/util/FileElasticStore.java:372

What to do

  • Each finding names the read that takes the length from the input and the site that spends it, and states that the value is never compared in between. Confirm from the two, then bound the length against the remaining stream before using it.
X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

What to do

  • Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

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

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

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

X2 · Cancellation propagation7.0 / 10Strong✓ Tool-verified

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

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

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

What to do

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

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

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

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped2.7 / 10Weak✓ Tool-verified

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

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

  • `n` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — system/minigraph-playground-engine/src/main/resources/public/assets/index-CXcJLB42.js:9
  • `e.value` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — system/minigraph-playground-engine/src/main/resources/public/assets/index-CXcJLB42.js:6570

What to do

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

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

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

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

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

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

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

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

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

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

X3 · Exception handling7.5 / 10Strong✓ Tool-verified

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

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

  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×7) — system/minigraph-playground-engine/webapp/src/utils/graphFile.ts:205, system/minigraph-playground-engine/webapp/src/utils/httpResponse.ts:10, system/minigraph-playground-engine/webapp/src/utils/messageParser.ts:55, …
  • `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:171
  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included. — system/minigraph-playground-engine/webapp/src/contexts/ClipboardContext.tsx:83

What to do

  • Swallowed exception (empty catch)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

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

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

X4 · Structured logging10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.

Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.

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

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

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

  • ~2.3 `!` null assertions per 1k TypeScript source lines — 49 assertion(s) across the 21533 source line(s) of the 118 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts (37), system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx (4), system/minigraph-playground-engine/webapp/src/components/HelpBrowser/HelpBrowser.tsx (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.

What to do

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

WCAG coverage — what static analysis assessed

Statically assessed 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).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC4 · Keyboard semantics2.1.1, 2.4.3Partial signal
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only
AC7 · A11y enforcementenforcement — no page criterionEnforcement 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.

LensScoreRatingImpact
Code Health75%StrongSolid.
Architecture95%ExemplarySolid.
Maturity91%ExemplarySolid.
Readiness57%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security79%Checked 4 of 11Solid.
Accessibility44%Weak — gated by AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100%ExemplaryStrongest area.
Unscored — 4 check(s) recorded observations but carry no score

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

  • D36 Supply-chain Provenance & Signing — 2 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • SC1 Supply-chain hygiene — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
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 — 46 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.
  • AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — docker build failed (exit 1) — 2 | EXPOSE 9092 3 | WORKDIR /app 4 | >>> COPY target/kafka-standalone-4.9.2-exec.jar . 5 | ENTRYPOINT ["java","-jar","kafka-standalone-4.9.2-exec.jar"] 6 | -------------------- ERROR: failed to solve: failed to compute cache key: failed to calculate checksum of ref c8e3ddf5-2cdd-4a77-ba49-108a4e5ad4ce::3sgiujpxd5z5v3dvp7n3imu18: "/target/kafka-standalone-4.9.2-exec.jar": not found; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — 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's runner produced no measurement
  • D12 Dependency Hygiene — Not scored — a Gradle build resolved 14 artifact(s) across its subprojects (1 behind a shipped release, reported), but the currency signal was not established over the whole graph, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; Java, JavaScript, Kotlin, Python, html not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D25 ADR Conformance — None of 0 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
  • D28 Secrets (history) — gitleaks killed before it finished — this repository's git history not scanned
  • D30 Dependency Vulnerabilities — Scanner failed to run — not a clean result
  • D32 Data Compliance (PII/GDPR) — 41 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
  • 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): 98 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • 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 — Not assessed, and this one is on us: 7 command handler(s) or message consumer(s) were found here, but this check does not yet recognise persistence writes in this repository's language. Idempotency was neither confirmed nor ruled out — this 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#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • 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'.
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — 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 — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • 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.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 31 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC3 · Page structure · <html> without a lang · ×6
  • <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/public/index.html:7 — 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> · ×6
  • 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/public/index.html:7 — 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>.
D31 · IaC & Container Security · High IaC · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
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:78 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 532 finding(s)
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×28
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/Toast.module.css:21 — `.toast` moves (`animation: slideIn 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.module.css:545 — `.spinner` moves (`animation: spin 0.65s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/NavMenu/NavMenu.module.css:39 — `.chevron` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/NavMenu/NavMenu.module.css:76 — `.dropdown` moves (`animation: fadeIn 0.12s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.module.css:387 — `.spinner` moves (`animation: spin 0.65s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.module.css:248 — `.refreshingSpinner` moves (`animation: graphRefreshSpin 0.75s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.module.css:41 — `.stats` moves (`transition: opacity 0.2s ease, max-width 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.module.css:111 — `.actionTooltip[data-state='open']` moves (`transition: opacity 0.12s ease 0.15s, transform 0.12s ease 0.15s, visibility 0s linear 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.module.css:550 — `.spinner` moves (`animation: spin 0.65s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/CommandInput/CommandInput.module.css:92 — `.popover` moves (`transition: opacity 0.15s ease, transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItem.module.css:62 — `.removeChrome` moves (`transition: opacity 120ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardSidebar.module.css:118 — `.sortButtonCaret` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._toast_1rn7u_1` moves (`animation: .3s _slideIn_1rn7u_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._chevron_9dbh2_37` moves (`transition: transform .2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._dotConnecting_9dbh2_57` moves (`animation: 1.5s infinite _pulse_9dbh2_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._dotConnected_9dbh2_58` moves (`animation: 2s infinite _pulse_9dbh2_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._dropdown_9dbh2_65` moves (`animation: .12s _fadeIn_9dbh2_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._toolDotConnecting_7x22x_123` moves (`animation: 1.5s infinite _pulse_7x22x_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._toolDotConnected_7x22x_124` moves (`animation: 2s infinite _pulse_7x22x_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._refreshingSpinner_ped3d_242` moves (`animation: .75s linear infinite _graphRefreshSpin_ped3d_1`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._stats_stok4_33` moves (`transition: opacity .2s,max-width .3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._actionTooltip_stok4_76[data-state=open]` moves (`transition: opacity .12s .15s,transform .12s .15s,visibility 0s linear .15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._popover_188pe_73` moves (`transition: opacity .15s,transform .15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._spinner_15u4d_380` moves (`animation: .65s linear infinite _spin_15u4d_380`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._spinner_iz4rh_543` moves (`animation: .65s linear infinite _spin_iz4rh_543`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • + 3 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×24
  • FunctionTooLong: GraphView.GraphView system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113 — FunctionTooLong — GraphView runs 594 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 494 over it, 5.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: MockUploadPanel.MockUploadPanel system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153 — FunctionTooLong — MockUploadPanel runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.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: GraphSetPanel.GraphSetPanel system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:26 — FunctionTooLong — GraphSetPanel runs 351 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 251 over it, 3.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: 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:49 — FunctionTooLong — NodeEditPanel runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91× 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: SchemaPanel.SchemaPanel system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.tsx:69 — FunctionTooLong — SchemaPanel runs 270 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 170 over it, 2.70× 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: useSchemaPanel.useSchemaPanel system/minigraph-playground-engine/webapp/src/hooks/useSchemaPanel.ts:122 — FunctionTooLong — useSchemaPanel runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 146 over it, 2.46× 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: useGraphSetPanel.useGraphSetPanel system/minigraph-playground-engine/webapp/src/hooks/useGraphSetPanel.ts:105 — FunctionTooLong — useGraphSetPanel runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.09× 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:77 — FunctionTooLong — RightPanel runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08× 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: graphTransformer.computeLayout system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131 — FunctionTooLong — computeLayout runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× 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: useGraphRunWorkflow.useGraphRunWorkflow system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:89 — FunctionTooLong — useGraphRunWorkflow runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84× 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:776 — FunctionTooLong — minimizeCrossings runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.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: 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 · ×24
  • TooManyMethods: GraphCommandService system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:58 — TooManyMethods — 112 methods. The bar is 30 methods; this is 82 over it, 3.73× 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: Utility system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java: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: 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:35 — 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:50 — TooManyMethods — 78 methods. The bar is 30 methods; this is 48 over it, 2.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: GraphContract system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphContract.java:58 — TooManyMethods — 69 methods. The bar is 30 methods; this is 39 over it, 2.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: TaskExecutor system/event-script-engine/src/main/java/com/accenture/automation/TaskExecutor.java:51 — TooManyMethods — 66 methods. The bar is 30 methods; this is 36 over it, 2.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: GraphLambdaFunction system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:48 — 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: Parser system/minimalist-jsonpath/src/main/java/org/platformlambda/mini/jsonpath/Parser.java:31 — TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× 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: GraphSchema system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:57 — TooManyMethods — 53 methods. The bar is 30 methods; this is 23 over it, 1.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: 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: HttpRouter system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:66 — 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: 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: CompileFlows system/event-script-engine/src/main/java/com/accenture/automation/CompileFlows.java:49 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× 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: AgentLoop extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java:56 — 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: DataMappingHelper system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:41 — TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× 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: ToolSchema extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:52 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CryptoApi system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:37 — 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: 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 · ClassTooLong · ×22
  • ClassTooLong: GraphCommandService system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:58 — ClassTooLong — 1376 significant lines (blank, comment-only and punctuation-only lines excluded), 112 methods. The bar is 400 significant lines; this is 976 over it, 3.44× 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:51 — ClassTooLong — 983 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods. The bar is 400 significant lines; this is 583 over it, 2.46× 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:50 — ClassTooLong — 871 significant lines (blank, comment-only and punctuation-only lines excluded), 78 methods. The bar is 400 significant lines; this is 471 over it, 2.18× 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 system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:50 — ClassTooLong — 819 significant lines (blank, comment-only and punctuation-only lines excluded), 109 methods. The bar is 400 significant lines; this is 419 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: GraphLambdaFunction system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:48 — ClassTooLong — 748 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods. The bar is 400 significant lines; this is 348 over it, 1.87× 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 system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java:68 — ClassTooLong — 716 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 316 over it, 1.79× 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:66 — ClassTooLong — 713 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 400 significant lines; this is 313 over it, 1.78× 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 — 670 significant lines (blank, comment-only and punctuation-only lines excluded), 54 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: GraphContract system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphContract.java:58 — ClassTooLong — 653 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 253 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.
  • ClassTooLong: CompileFlows system/event-script-engine/src/main/java/com/accenture/automation/CompileFlows.java:49 — ClassTooLong — 635 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 235 over it, 1.59× 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: GraphView system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:1 — ClassTooLong — 594 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 194 over it, 1.49× 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: AgentLoop extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java:56 — ClassTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 189 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.
  • 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: AsyncHttpRequest system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:35 — ClassTooLong — 508 significant lines (blank, comment-only and punctuation-only lines excluded), 80 methods. The bar is 400 significant lines; this is 108 over it, 1.27× 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:41 — ClassTooLong — 486 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 86 over it, 1.22× 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: GraphSchema system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:57 — ClassTooLong — 456 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 400 significant lines; this is 56 over it, 1.14× 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:49 — ClassTooLong — 436 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 36 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: MiniGraph system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:36 — ClassTooLong — 429 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 29 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: MockUploadPanel system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:1 — ClassTooLong — 413 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 13 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.
  • 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.
  • ClassTooLong: Parser system/minimalist-jsonpath/src/main/java/org/platformlambda/mini/jsonpath/Parser.java:31 — ClassTooLong — 411 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 400 significant lines; this is 11 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 · ×22
  • FileTooLong: services/GraphCommandService.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java — FileTooLong — 1412 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GraphCommandService (58-2135). The bar is 500 significant lines; this is 912 over it, 2.82× 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 — 1121 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 621 over it, 2.24× 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 — 1008 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TaskExecutor (51-1477). The bar is 500 significant lines; this is 508 over it, 2.02× 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 — 896 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: EventEmitter (50-1672). The bar is 500 significant lines; this is 396 over it, 1.79× 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: util/Utility.java system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java — FileTooLong — 844 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Utility (50-1468). The bar is 500 significant lines; this is 344 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 — 811 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: HttpRouter (66-1199). The bar is 500 significant lines; this is 311 over it, 1.62× 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 — 811 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 311 over it, 1.62× 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: common/GraphLambdaFunction.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java — FileTooLong — 773 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GraphLambdaFunction (48-1300). The bar is 500 significant lines; this is 273 over it, 1.55× 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: http/AsyncHttpClient.java system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java — FileTooLong — 762 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AsyncHttpClient (68-1190). The bar is 500 significant lines; this is 262 over it, 1.52× 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: config/RoutingEntry.java system/platform-core/src/main/java/org/platformlambda/automation/config/RoutingEntry.java — FileTooLong — 683 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: RoutingEntry (38-1007). The bar is 500 significant lines; this is 183 over it, 1.37× 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 — 675 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: GraphView (113-923). The bar is 500 significant lines; this is 175 over it, 1.35× 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.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: contract/GraphContract.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphContract.java — FileTooLong — 665 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: GraphContract (58-1075). The bar is 500 significant lines; this is 165 over it, 1.33× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: automation/CompileFlows.java system/event-script-engine/src/main/java/com/accenture/automation/CompileFlows.java — FileTooLong — 651 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: CompileFlows (49-982). The bar is 500 significant lines; this is 151 over it, 1.30× 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: agentloop/AgentLoop.java extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java — FileTooLong — 612 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: AgentLoop (56-905). 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 — 521 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: AsyncHttpRequest (35-878). The bar is 500 significant lines; this is 21 over it, 1.04× 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: util/DataMappingHelper.java system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java — FileTooLong — 502 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DataMappingHelper (41-738). The bar is 500 significant lines; this is 2 over it, 1.00× 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: MockUploadPanel/MockUploadPanel.tsx system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx — FileTooLong — 501 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: MockUploadPanel (153-651). The bar is 500 significant lines; this is 1 over it, 1.00× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×16
  • Duplicated block (7 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:347 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:347-353 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:549-555 — 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 (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/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphContract.java:549 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphContract.java:549-555 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphContract.java:772-778 — 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/contract/GraphContract.java:549` 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/services/GraphExecutor.java:328 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:328-334 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:266-272 — 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:335` calls `put` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:273` 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:152 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:152-158 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:223-229 — 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:152` 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/automation/util/SimpleHttpUtility.java:173 — system/platform-core/src/main/java/org/platformlambda/automation/util/SimpleHttpUtility.java:173-179 | 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 — 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/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:1424 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1424-1430 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1525-1531 — 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/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) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:338 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:338-344 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:539-545 — 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) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:363 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:363-369 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:566-572 — 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) 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) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:93 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:93-99 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:83-89 — 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 5 separate duplicated blocks between them, totalling at least 50 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) agent-skills/archive-fact/scripts/archive-fact.py:216 — agent-skills/archive-fact/scripts/archive-fact.py:216-223 | agent-skills/refresh-metadata/scripts/refresh-metadata.py:205-211 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (7 lines × 2) examples/rest-spring-4-example/src/main/java/com/accenture/examples/rest/AsyncHelloConcurrent.java:44 — examples/rest-spring-4-example/src/main/java/com/accenture/examples/rest/AsyncHelloConcurrent.java:44-50 | 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×13
  • 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/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) system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:216 — system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:216-221 | system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:796-801 — 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:216` 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/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:337 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:337-342 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:274-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. 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:337` 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/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:335` calls `put` and `system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:272` 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 (6 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:390 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:390-395 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:313-318 — 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:390` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • 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:153-158 — 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/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:124-129 — 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/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:366 — system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:366-371 | system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:390-395 — 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:366` 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/event-script-engine/src/main/java/com/accenture/util/DecimalPluginUtils.java:178 — system/event-script-engine/src/main/java/com/accenture/util/DecimalPluginUtils.java:178-183 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/DecimalEvaluator.java:135-140 — 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 (6 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:246 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncHttpRequest.java:246-251 | 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) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java:569 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java:569-574 | extensions/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java:783-788 — 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) 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×12
  • Hotspot: system/minigraph-playground-engine/webapp/src/components/Playground.tsx system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113 — system/minigraph-playground-engine/webapp/src/components/Playground.tsx changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 176 in Playground.Playground at line 113. 3 of those changes were fix/bug commits, and the other 12 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08: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:113 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in GraphView.GraphView at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08: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: agent-skills/memory-lint/scripts/memory-lint.mjs agent-skills/memory-lint/scripts/memory-lint.mjs:956 — agent-skills/memory-lint/scripts/memory-lint.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in memory-lint.scan_lines at line 956. 1 of those changes was a fix/bug commit, and the other 15 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- agent-skills/memory-lint/scripts/memory-lint.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: agent-skills/memory-lint/scripts/memory-lint.py agent-skills/memory-lint/scripts/memory-lint.py:936 — agent-skills/memory-lint/scripts/memory-lint.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in memory-lint._scan_lines at line 936. 1 of those changes was a fix/bug commit, and the other 15 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- agent-skills/memory-lint/scripts/memory-lint.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153 — system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in MockUploadPanel.MockUploadPanel at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.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/RightPanel/RightPanel.tsx system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:77 — system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in RightPanel.RightPanel at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08: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/utils/graphTransformer.ts system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in graphTransformer.computeLayout at line 1131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08: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/hooks/useGraphRunWorkflow.ts system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:89 — system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in useGraphRunWorkflow.useGraphRunWorkflow at line 89. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.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: scripts/check-doc-canon.py scripts/check-doc-canon.py:48 — scripts/check-doc-canon.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in check-doc-canon.main at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- scripts/check-doc-canon.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.java system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.java:101 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.java changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Evaluator.evalBinary at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.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/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:81 — system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in AsyncHttpResponse.handleEvent at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.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/Navigation.tsx system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:65 — system/minigraph-playground-engine/webapp/src/components/Navigation.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Navigation.Navigation at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- system/minigraph-playground-engine/webapp/src/components/Navigation.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.
AC3 · Page structure · Page without a main landmark · ×11
  • 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:7 — 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/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/playground.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/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 (8 lines × 2) · ×10
  • 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/services/GraphExecutor.java:355 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:355-362 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:292-299 — 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:355` 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/skills/GraphExtension.java:194 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:194-201 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:249-256 — 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) 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 5 separate duplicated blocks between them, totalling at least 50 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) system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:336 — system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:336-343 | system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:352-359 — 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/Utility.java:336` 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/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) agent-skills/memory-lint/scripts/memory-lint.py:110 — agent-skills/memory-lint/scripts/memory-lint.py:110-117 | agent-skills/refresh-metadata/scripts/refresh-metadata.py:62-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. 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 (8 lines × 2) agent-skills/memory-lint/scripts/memory-lint.py:134 — agent-skills/memory-lint/scripts/memory-lint.py:134-141 | agent-skills/refresh-metadata/scripts/refresh-metadata.py:116-123 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (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.
  • Duplicated block (8 lines × 2) examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/DecryptFields.kt:20 — examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/DecryptFields.kt:20-27 | examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/EncryptFields.kt:20-27 — before extracting anything, compare `examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/DecryptFields.kt` and `examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/EncryptFields.kt` 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 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 `examples/kotlin-example/src/main/kotlin/com/accenture/demo/tasks/DecryptFields.kt:20` 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.
R4 · Test Coverage · No test reaches this file · ×10
  • No test reaches this file templates/starter-graph/scripts/ai-companion-broker.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file extensions/api-playground/scripts/fetch-swagger-ui.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file agent-skills/sync-adapters/scripts/sync-adapters.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file system/minigraph-playground-engine/webapp/scripts/targets.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file system/minigraph-playground-engine/webapp/src/App.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file system/minigraph-playground-engine/webapp/scripts/deploy.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file system/minigraph-playground-engine/webapp/scripts/clean.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file system/minigraph-playground-engine/webapp/src/main.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×9
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.module.css:60 — `.tabBody:focus-visible` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.module.css:119 — `.graphSurface:not([data-exporting]) :global(.react-flow__node.selectable.selected)` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardItem.module.css:97 — `.preview:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._graphSurface_ped3d_24:not([data-exporting]) .react-flow__node.selectable.selected` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._tabBody_xa3j1_51:focus-visible` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/src/main/resources/public/assets/index-BH572KKk.css:1 — `._preview_1ne62_13:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/src/main/resources/public/assets/vendor-xyflow-DLioOiRN.css:1 — `.react-flow__nodesselection-rect:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/src/main/resources/public/assets/vendor-xyflow-DLioOiRN.css:1 — `.react-flow__edge.selected` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement system/minigraph-playground-engine/src/main/resources/public/assets/vendor-xyflow-DLioOiRN.css:1 — `.react-flow__node.selectable:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×9
  • 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) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1875 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1875-1883 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1904-1912 — 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:1875` 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:118-126 — 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 76 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/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 49 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:1272 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1272-1280 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1358-1366 — 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:1272` 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/util/Utility.java:639 — system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:639-647 | system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:683-691 — 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/Utility.java:639` 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/math/DecimalEvaluator.java:419 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/DecimalEvaluator.java:419-427 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.java:91-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. 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/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.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×8
  • 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/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:163 — system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:163-173 | system/event-script-engine/src/main/java/com/accenture/util/DataMappingHelper.java:220-230 — 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:163` 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/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-276 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:208-218 — 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 (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/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1080 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1080-1090 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1202-1212 — 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:1080` 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:1289 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1289-1299 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1375-1385 — 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:1289` 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/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.
  • Duplicated block (11 lines × 2) scripts/check-event-script-grammar.py:61 — scripts/check-event-script-grammar.py:61-71 | scripts/check-rest-automation-grammar.py:57-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. 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 (5 lines × 2) · ×8
  • Duplicated block (5 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:357 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:357-361 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:560-564 — 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/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:357` 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 (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/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:283-288 — 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 76 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/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:839 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:839-843 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:863-867 — 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:839` 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/system/WorkerHandler.java:386 — system/platform-core/src/main/java/org/platformlambda/core/system/WorkerHandler.java:386-390 | system/platform-core/src/main/java/org/platformlambda/core/system/WorkerHandler.java:407-411 — 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/WorkerHandler.java:386` 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.
  • Duplicated block (5 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:519 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:519-523 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/common/GraphLambdaFunction.java:799-803 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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:519` 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:1278 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphCommandService.java:1278-1282 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:374-378 — 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:1278` 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:82 — examples/scheduler-example/src/main/java/org/platformlambda/quartz/rest/ScheduleAdmin.java:82-86 | examples/scheduler-example/src/main/java/org/platformlambda/quartz/rest/ScheduleAdmin.java:98-102 — 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: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. 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×8
  • Swallowed exception (empty catch) system/minigraph-playground-engine/webapp/src/utils/graphFile.ts:205 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) system/minigraph-playground-engine/webapp/src/utils/httpResponse.ts:10 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) system/minigraph-playground-engine/webapp/src/utils/messageParser.ts:55 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) system/minigraph-playground-engine/webapp/src/hooks/useGraphData.ts:171 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) system/minigraph-playground-engine/webapp/src/hooks/useLargePayloadDownload.ts:75 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:240 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:228 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:241 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×7
  • Duplicated block (13 lines × 2) system/event-script-engine/src/main/java/com/accenture/util/RangeNotation.java:204 — system/event-script-engine/src/main/java/com/accenture/util/RangeNotation.java:204-216 | system/minimalist-jsonpath/src/main/java/org/platformlambda/mini/jsonpath/Values.java:87-99 — 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:274 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:274-286 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphApiFetcher.java:421-433 — 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:274` 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:95-107 — 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 76 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) 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 49 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) agent-skills/memory-lint/scripts/memory-lint.py:438 — agent-skills/memory-lint/scripts/memory-lint.py:438-450 | agent-skills/refresh-metadata/scripts/refresh-metadata.py:99-111 — 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 (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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×7
  • Duplicated block (10 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:548 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:548-557 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:475-484 — 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:548` 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/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:127 — system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:127-136 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:336-345 — 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/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:127` 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/automation/services/HttpRouter.java:470 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:470-479 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:984-993 — 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:497 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:497-506 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1023-1032 — 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:1023` 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:202 — system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:202-211 | system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:224-233 — 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:202` 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:200` calls `write` and `system/platform-core/src/main/java/org/platformlambda/core/util/CryptoApi.java:222` 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/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 49 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:353 — system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:353-362 | system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:374-383 — 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:353` 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 · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×5
  • Members sharing a duplicated core (4 members, 50+ identical tokens) system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:172 — system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:172-182 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:184-194 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:196-206 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:208-218 — 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:54-103 | 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:94-115 — 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/GraphJs.java:222 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:222-237 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:170-191 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:210-231 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:260-280 — 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/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:99 — system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:99-149 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:262-281 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:290-309 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:332-352 — 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/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.
D5 · Coupling · Off the main sequence · ×5
  • Off the main sequence: minimalist-msgpack — minimalist-msgpack: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: minimalist-jsonpath — minimalist-jsonpath: abstractness 0.12, instability 0.00, distance 0.88 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: event-script-engine — event-script-engine: abstractness 0.02, instability 0.20, distance 0.78 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
  • Off the main sequence: platform-core — platform-core: abstractness 0.16, instability 0.11, distance 0.74 — zone of pain — concrete and depended on by 17 project(s), so it's rigid to change.
  • Off the main sequence: minimalist-kafka — minimalist-kafka: abstractness 0.04, instability 0.25, distance 0.71 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
D6 · Cohesion (LCOM4) · Low cohesion · ×5
  • Low cohesion: Builder (LCOM4 14) system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaConsumerBinding.java:164 — Builder's methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: AsyncContextHolder (LCOM4 8) system/platform-core/src/main/java/org/platformlambda/automation/models/AsyncContextHolder.java:28 — AsyncContextHolder's methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: SimpleHttpUtility (LCOM4 5) system/platform-core/src/main/java/org/platformlambda/automation/util/SimpleHttpUtility.java:41 — SimpleHttpUtility's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: AsyncHttpClient (LCOM4 4) system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java:68 — AsyncHttpClient's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: ProcessStatus (LCOM4 4) system/platform-core/src/main/java/org/platformlambda/core/models/ProcessStatus.java:28 — ProcessStatus's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
IC1 · Incompleteness & stubs · Unfinished stub · ×4
  • Unfinished stub — throws a "not implemented" exception connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:179 — `createQueue` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
  • Unfinished stub — throws a "not implemented" exception connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:184 — `deleteQueue` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
  • Unfinished stub — throws a "not implemented" exception connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:386 — `send` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
  • Unfinished stub — throws a "not implemented" exception connectors/adapters/kafka/kafka-connector/src/main/java/org/platformlambda/kafka/services/PubSubManager.java:391 — `listen` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
R10 · Code Duplication · Duplicated block (12 lines × 2 locations) · ×4
  • 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/components/GraphToolbar/GraphToolbar.tsx:70 — system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.tsx:70 · system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphToolbar.tsx:84 — 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 (12 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:167 — system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:167 · system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:180 — 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 (10 lines × 2 locations) · ×4
  • 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.
  • Duplicated block (10 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphFileDialogs/GraphDownloadDialog.tsx:59 — system/minigraph-playground-engine/webapp/src/components/GraphFileDialogs/GraphDownloadDialog.tsx:59 · system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:299 — 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 (10 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:47 — system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:47 · system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.tsx:82 — 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 (10 lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:163 — system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:163 · system/minigraph-playground-engine/webapp/src/components/GraphToolbar/GraphRunControls.tsx:176 — 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 (10 matched lines × 2 locations) · ×4
  • 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:230 — 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/ConnectionPopover/ConnectionPopover.tsx:85 — system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:85 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 68 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:592 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:592 · 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.
  • Duplicated block with local edits (10 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:229 — system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:229 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 65 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.
D31 · IaC & Container Security · Medium IaC · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×3
  • 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.
  • 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) 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.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×3
  • Duplicated block (12 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:497 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:497-508 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:513-524 — 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:497` 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) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:180 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:180-191 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:243-254 — 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: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.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×3
  • 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:89-93 | 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:103-107 — 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.
  • 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/GraphJs.java:226 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:226-230 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:174-178 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:213-217 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java:263-267 — 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 76 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.
R10 · Code Duplication · Duplicated block (11 lines × 2 locations) · ×3
  • 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.
SC1 · Supply-chain hygiene · JavaScript dependencies are not locked · ×3
  • JavaScript dependencies are not locked examples/kafka-demo/node/package.json:12 — examples/kafka-demo/node/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked examples/sync-over-async-demo/node/package.json:10 — examples/sync-over-async-demo/node/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked examples/twin-kafka-demo/node/package.json:11 — examples/twin-kafka-demo/node/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
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
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (47 lines × 2) · ×2
  • Duplicated block (47 lines × 2) system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:974 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:974-1020 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1131-1177 — 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 (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.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:224 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:224-241 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:182-199 — 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:224` 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/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:119 — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:119-136 | system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java:110-127 — 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 5 separate duplicated blocks between them, totalling at least 50 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:119` 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) 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.
  • Duplicated block (16 lines × 2) system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaRuntime.java:92 — system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaRuntime.java:92-107 | system/twin-kafka/src/main/java/org/platformlambda/twin/kafka/SecondaryKafkaRuntime.java:88-103 — 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/KafkaRuntime.java:92` 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 (12 lines × 3) · ×2
  • Duplicated block (12 lines × 3) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:516 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:516-527 | 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:257-268 — 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.
  • Duplicated block (12 lines × 3) agent-skills/archive-fact/scripts/archive-fact.py:33 — agent-skills/archive-fact/scripts/archive-fact.py:33-44 | agent-skills/memory-lint/scripts/memory-lint.py:33-44 | agent-skills/refresh-metadata/scripts/refresh-metadata.py:33-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The 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, `agent-skills/memory-lint/scripts/memory-lint.py:23` calls `compile` and `agent-skills/archive-fact/scripts/archive-fact.py:29` 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 × 3) · ×2
  • 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:195-205 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:357-367 — 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.
  • Duplicated block (11 lines × 3) system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:269 — system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:269-279 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:297-307 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:341-351 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:269` 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 (10–11 lines × 2) · ×2
  • Duplicated block (10–11 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:76 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:76-86 | system/event-script-engine/src/main/java/com/accenture/util/JsonPathSource.java:280-289 — 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/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:76` 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–11 lines × 2) system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1102 — system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1102-1112 | system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java:1135-1144 — 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:1102` 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 (7 lines × 3) · ×2
  • 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.
  • Duplicated block (7 lines × 3) helpers/graph-packager/src/main/java/com/accenture/minigraph/packager/GraphPackager.java:372 — helpers/graph-packager/src/main/java/com/accenture/minigraph/packager/GraphPackager.java:372-378 | system/ai-contract-provider/src/main/java/org/platformlambda/discovery/services/SkillSnapshot.java:234-240 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/start/GraphSetLoader.java:384-390 — 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×2
  • Duplicated block (6 lines × 3) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:81 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:81-86 | system/event-script-engine/src/main/java/com/accenture/util/JsonPathSource.java:284-289 | system/minimalist-jsonpath/src/main/java/org/platformlambda/mini/jsonpath/Node.java:87-92 — 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 `extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:81` 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 × 3) system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:266 — system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:266-271 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:294-299 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:333-338 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.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.
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:1657 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1657 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1675 — 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:621 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:621 · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:634 — 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) · ×2
  • Duplicated block with local edits (12 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/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 57 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 (12 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:476 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:476 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:229 — 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.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×2
  • Recursive walk over a caller-supplied document has no depth cap system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:314 — `rowsFromValue` is exported, takes a document from its caller (line 331) and hands it to `collectValueRows`, which calls itself at line 314 (`collectValueRows`) with a piece of `value` — and nowhere in `collectValueRows` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `collectValueRows` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:548 — `schemaToPropertyRows` is exported, takes a document from its caller (line 571) and hands it to `flattenForGrammar`, which calls itself at line 548 (`flattenForGrammar`) with a piece of `value` — and nowhere in `flattenForGrammar` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `flattenForGrammar` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×2
  • Untrusted text written into markup unescaped system/minigraph-playground-engine/src/main/resources/public/assets/index-CXcJLB42.js:9 — `n` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped system/minigraph-playground-engine/src/main/resources/public/assets/index-CXcJLB42.js:6570 — `e.value` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
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).
AC4 · Keyboard semantics · Modal dialog does not manage focus · ×1
  • Modal dialog does not manage focus system/minigraph-playground-engine/webapp/src/components/ConnectionPopover/ConnectionPopover.tsx:127 — This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1
  • Accessibility enforcement below the top rung system/minigraph-playground-engine/webapp/package.json:33 — 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 55 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 176) · ×1
  • Playground.Playground (cyclomatic 176) system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113 — Playground.Playground has cyclomatic complexity 176 (threshold 15). Of this number, 87 points are the body's own statements and 89 belong to 32 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 · GraphView.GraphView (cyclomatic 139) · ×1
  • GraphView.GraphView (cyclomatic 139) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113 — GraphView.GraphView has cyclomatic complexity 139 (threshold 15). Of this number, 58 points are the body's own statements and 81 belong to 40 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 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 · MockUploadPanel.MockUploadPanel (cyclomatic 57) · ×1
  • MockUploadPanel.MockUploadPanel (cyclomatic 57) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153 — MockUploadPanel.MockUploadPanel has cyclomatic complexity 57 (threshold 15). Of this number, 20 points are the body's own statements and 37 belong to 15 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.computeLayout (cyclomatic 54) · ×1
  • graphTransformer.computeLayout (cyclomatic 54) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131 — graphTransformer.computeLayout has cyclomatic complexity 54 (threshold 15). Of this number, 45 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 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 items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · SchemaPanel.SchemaPanel (cyclomatic 43) · ×1
  • SchemaPanel.SchemaPanel (cyclomatic 43) system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.tsx:69 — SchemaPanel.SchemaPanel has cyclomatic complexity 43 (threshold 15). Of this number, 19 points are the body's own statements and 24 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NodeEditPanel.NodeEditPanel (cyclomatic 42) · ×1
  • NodeEditPanel.NodeEditPanel (cyclomatic 42) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:49 — NodeEditPanel.NodeEditPanel has cyclomatic complexity 42 (threshold 15). Of this number, 17 points are the body's own statements and 25 belong to 13 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 · GraphSetPanel.GraphSetPanel (cyclomatic 40) · ×1
  • GraphSetPanel.GraphSetPanel (cyclomatic 40) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:26 — GraphSetPanel.GraphSetPanel has cyclomatic complexity 40 (threshold 15). Of this number, 21 points are the body's own statements and 19 belong to 9 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 · 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:64 — 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 · useGraphRunWorkflow.useGraphRunWorkflow (cyclomatic 33) · ×1
  • useGraphRunWorkflow.useGraphRunWorkflow (cyclomatic 33) system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:89 — useGraphRunWorkflow.useGraphRunWorkflow has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 12 of the 33 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 189, 234, 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 · RightPanel.RightPanel (cyclomatic 30) · ×1
  • RightPanel.RightPanel (cyclomatic 30) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:77 — 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:776 — 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 items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · 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 item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 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 items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Navigation.Navigation (cyclomatic 26) · ×1
  • Navigation.Navigation (cyclomatic 26) system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:65 — Navigation.Navigation has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 101, 115, 84, …). 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 · 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 5 function literals inside it that branch (lines 109, 75, 93, …). 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 · graphFile.validateGraphModel (cyclomatic 25) · ×1
  • graphFile.validateGraphModel (cyclomatic 25) system/minigraph-playground-engine/webapp/src/utils/graphFile.ts:53 — graphFile.validateGraphModel has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · graphSchema.schemaRowIssues (cyclomatic 25) · ×1
  • graphSchema.schemaRowIssues (cyclomatic 25) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391 — graphSchema.schemaRowIssues has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MsgPack.pack (cyclomatic 24) · ×1
  • MsgPack.pack (cyclomatic 24) system/platform-core/src/main/java/org/platformlambda/core/serializers/MsgPack.java:278 — 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 items inside it that branch (footer_repl, a function literal at line 161, a function literal at line 136). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · graphSchema.nodeSchema (cyclomatic 22) · ×1
  • graphSchema.nodeSchema (cyclomatic 22) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:446 — graphSchema.nodeSchema has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 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 · Evaluator.evalBinary (cyclomatic 20) · ×1
  • Evaluator.evalBinary (cyclomatic 20) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Evaluator.java:101 — Evaluator.evalBinary has cyclomatic complexity 20 (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.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 · WebSocketContext.WebSocketProvider (cyclomatic 20) · ×1
  • WebSocketContext.WebSocketProvider (cyclomatic 20) system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:182 — WebSocketContext.WebSocketProvider has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 11 function items inside it that branch (isKeepAliveMessage, a function literal at line 248, a function literal at line 300, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · 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 items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 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 · useSchemaPanel.useSchemaPanel (cyclomatic 19) · ×1
  • useSchemaPanel.useSchemaPanel (cyclomatic 19) system/minigraph-playground-engine/webapp/src/hooks/useSchemaPanel.ts:122 — useSchemaPanel.useSchemaPanel has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 381, 245, 398). 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 · 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 · graphInputPaths.collectPathsFromText (cyclomatic 18) · ×1
  • graphInputPaths.collectPathsFromText (cyclomatic 18) system/minigraph-playground-engine/webapp/src/graphRun/graphInputPaths.ts:15 — 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 · 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 · ws-graph.html.connectToEdge (cyclomatic 17) · ×1
  • ws-graph.html.connectToEdge (cyclomatic 17) system/minigraph-playground-engine/src/main/resources/template/ws-graph.html:105 — ws-graph.html.connectToEdge has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 110, 165). 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 · ws-json.html.connectToEdge (cyclomatic 17) · ×1
  • ws-json.html.connectToEdge (cyclomatic 17) system/minigraph-playground-engine/src/main/resources/template/ws-json.html:105 — ws-json.html.connectToEdge has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 110, 164). 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.deriveFlowHandleOffsets (cyclomatic 17) · ×1
  • graphTransformer.deriveFlowHandleOffsets (cyclomatic 17) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:603 — 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 item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 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 · ToolCatalog.parseRow (cyclomatic 16) · ×1
  • ToolCatalog.parseRow (cyclomatic 16) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolCatalog.java:107 — ToolCatalog.parseRow has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 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 · DecimalEvaluator.compare (cyclomatic 16) · ×1
  • DecimalEvaluator.compare (cyclomatic 16) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/DecimalEvaluator.java:279 — DecimalEvaluator.compare 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: DecimalEvaluator.binary (cyclomatic 17) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 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.
D1 · Cyclomatic Complexity · useAutocomplete.useAutocomplete.onKeyDown (cyclomatic 16) · ×1
  • useAutocomplete.useAutocomplete.onKeyDown (cyclomatic 16) system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts:81 — useAutocomplete.useAutocomplete.onKeyDown has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java:173 — system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.java changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is ActiveEnvironment.refresh at line 173), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(mini-scheduler): retry a slow state resolver or environment store, with the firing id in the resolver's parameters (#603)”; “fix(mini-scheduler): the environment name is scheduler.environment.name, so it can sit beside the store (#584)”; “fix(scheduler): rename the active-environment field to current - it differed from the constant ACTIVE only by case (#561)”; “fix: the field's Sonar findings on 4.12.24 - forty code smells and one bug across 25 files, no behaviour change (#560)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-12 09:56:50 +08:00' --until='2026-11-10 09:56:50 +08:00' --full-history --no-merges -- system/mini-scheduler/src/main/java/org/platformlambda/scheduler/ActiveEnvironment.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.
D2 · Cognitive Complexity · Playground.Playground (cognitive 187) · ×1
  • Playground.Playground (cognitive 187) system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113 — Playground.Playground has cognitive complexity 187 (threshold 15). Drivers by points: ternaries 51 (81 pts), if/else 52 (63 pts), boolean chains 35, error handling 5 (6 pts), loops 1, match/switch 1 (nesting depth added 42). Of this number, 88 points are the body's own statements and 99 belong to 32 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 · GraphView.GraphView (cognitive 145) · ×1
  • GraphView.GraphView (cognitive 145) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113 — GraphView.GraphView has cognitive complexity 145 (threshold 15). Drivers by points: if/else 57 (71 pts), boolean chains 48, ternaries 15 (22 pts), loops 2 (3 pts), error handling 1 (nesting depth added 22). Of this number, 47 points are the body's own statements and 98 belong to 40 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · graphTransformer.computeLayout (cognitive 91) · ×1
  • graphTransformer.computeLayout (cognitive 91) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131 — graphTransformer.computeLayout has cognitive complexity 91 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 26 (39 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 40). Of this number, 82 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MockUploadPanel.MockUploadPanel (cognitive 57) · ×1
  • MockUploadPanel.MockUploadPanel (cognitive 57) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153 — MockUploadPanel.MockUploadPanel has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 24, if/else 15 (18 pts), ternaries 10 (12 pts), loops 2, error handling 1 (nesting depth added 5). Of this number, 18 points are the body's own statements and 39 belong to 15 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 · 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). None of this is in the body itself: all 54 points belong 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 item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 · SchemaPanel.SchemaPanel (cognitive 47) · ×1
  • SchemaPanel.SchemaPanel (cognitive 47) system/minigraph-playground-engine/webapp/src/components/SchemaPanel/SchemaPanel.tsx:69 — SchemaPanel.SchemaPanel has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 21 (31 pts), boolean chains 15, if/else 1 (nesting depth added 10). Of this number, 17 points are the body's own statements and 30 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · graphTransformer.transposeForBetterScore (cognitive 46) · ×1
  • graphTransformer.transposeForBetterScore (cognitive 46) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:715 — 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 43) · ×1
  • NodeEditPanel.NodeEditPanel (cognitive 43) system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:49 — NodeEditPanel.NodeEditPanel has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 12, ternaries 11 (nesting depth added 2). Most of this is not in the body itself: 14 of the 43 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 171, 152, 289, …). 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 · graphSchema.collectValueRows (cognitive 41) · ×1
  • graphSchema.collectValueRows (cognitive 41) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:287 — graphSchema.collectValueRows has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (11 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 26). Of this number, 40 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 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 items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · GraphSetPanel.GraphSetPanel (cognitive 39) · ×1
  • GraphSetPanel.GraphSetPanel (cognitive 39) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:26 — GraphSetPanel.GraphSetPanel has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 17, ternaries 13 (15 pts), if/else 7 (nesting depth added 2). Of this number, 21 points are the body's own statements and 18 belong to 9 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 · 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 · graphSchema.nodeSchema (cognitive 38) · ×1
  • graphSchema.nodeSchema (cognitive 38) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:446 — graphSchema.nodeSchema has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 · ws-graph.html.connectToEdge (cognitive 37) · ×1
  • ws-graph.html.connectToEdge (cognitive 37) system/minigraph-playground-engine/src/main/resources/template/ws-graph.html:105 — ws-graph.html.connectToEdge has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 2 (nesting depth added 20). Most of this is not in the body itself: 7 of the 37 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 110, 165). 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 · 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 · ws-json.html.connectToEdge (cognitive 36) · ×1
  • ws-json.html.connectToEdge (cognitive 36) system/minigraph-playground-engine/src/main/resources/template/ws-json.html:105 — ws-json.html.connectToEdge has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 2 (nesting depth added 20). Most of this is not in the body itself: 7 of the 36 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 110, 164). 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.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 · useGraphRunWorkflow.useGraphRunWorkflow (cognitive 34) · ×1
  • useGraphRunWorkflow.useGraphRunWorkflow (cognitive 34) system/minigraph-playground-engine/webapp/src/hooks/useGraphRunWorkflow.ts:89 — useGraphRunWorkflow.useGraphRunWorkflow has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17, boolean chains 10, ternaries 4 (7 pts) (nesting depth added 3). Most of this is not in the body itself: 13 of the 34 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 189, 234, 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.
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 · 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:776 — 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 items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Navigation.Navigation (cognitive 30) · ×1
  • Navigation.Navigation (cognitive 30) system/minigraph-playground-engine/webapp/src/components/Navigation.tsx:65 — Navigation.Navigation has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 16 (21 pts), boolean chains 7, if/else 2 (nesting depth added 5). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 101, 115, 84, …). 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 · graphSchema.schemaRowIssues (cognitive 29) · ×1
  • graphSchema.schemaRowIssues (cognitive 29) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391 — graphSchema.schemaRowIssues has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, ternaries 1 (3 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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). None of this is in the body itself: all 29 points belong to 5 function literals inside it that branch (lines 109, 75, 93, …). 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 · graphFile.validateGraphModel (cognitive 26) · ×1
  • graphFile.validateGraphModel (cognitive 26) system/minigraph-playground-engine/webapp/src/utils/graphFile.ts:53 — graphFile.validateGraphModel has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · graphTransformer.deriveFlowHandleOffsets (cognitive 25) · ×1
  • graphTransformer.deriveFlowHandleOffsets (cognitive 25) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:603 — 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 item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 items inside it that branch (footer_repl, a function literal at line 161, a function literal at line 136). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · 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:15 — 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:77 — 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 · 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 · graphTransformer.relieveNodeIntrusions (cognitive 21) · ×1
  • graphTransformer.relieveNodeIntrusions (cognitive 21) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1018 — 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 · 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 · fetch-swagger-ui.tarEntries (cognitive 19) · ×1
  • fetch-swagger-ui.tarEntries (cognitive 19) extensions/api-playground/scripts/fetch-swagger-ui.js:91 — fetch-swagger-ui.tarEntries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 · useGraphAuthoring.useGraphAuthoring (cognitive 19) · ×1
  • useGraphAuthoring.useGraphAuthoring (cognitive 19) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:305 — useGraphAuthoring.useGraphAuthoring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 19 points belong to 2 function literals inside it that branch (lines 702, 754). 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 · useGraphAuthoring.useGraphAuthoring.deleteNodes (cognitive 19) · ×1
  • useGraphAuthoring.useGraphAuthoring.deleteNodes (cognitive 19) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:505 — useGraphAuthoring.useGraphAuthoring.deleteNodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), error handling 1 (2 pts), loops 2 (nesting depth added 7). Of this number, 18 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 · 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 · graphSchema.mergeRunRows (cognitive 18) · ×1
  • graphSchema.mergeRunRows (cognitive 18) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:350 — graphSchema.mergeRunRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useAutocomplete.useAutocomplete.onKeyDown (cognitive 18) · ×1
  • useAutocomplete.useAutocomplete.onKeyDown (cognitive 18) system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts:81 — useAutocomplete.useAutocomplete.onKeyDown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 7). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · 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:569 — 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 · NavMenu.NavMenu (cognitive 17) · ×1
  • NavMenu.NavMenu (cognitive 17) system/minigraph-playground-engine/webapp/src/components/NavMenu/NavMenu.tsx:37 — 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 items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · 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 · WebSocketContext.WebSocketProvider (cognitive 16) · ×1
  • WebSocketContext.WebSocketProvider (cognitive 16) system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:182 — WebSocketContext.WebSocketProvider has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, error handling 1. None of this is in the body itself: all 16 points belong to 11 function items inside it that branch (isKeepAliveMessage, a function literal at line 248, a function literal at line 328, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · 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 · useGraphAuthoring.useGraphAuthoring.submit (cognitive 16) · ×1
  • useGraphAuthoring.useGraphAuthoring.submit (cognitive 16) system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:610 — useGraphAuthoring.useGraphAuthoring.submit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, ternaries 3 (5 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 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 items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D29 · Static Analysis (SAST) · 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
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:101-136 | 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:91-127 — 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) system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:207 — system/mini-scheduler/src/main/java/org/platformlambda/scheduler/JobLoader.java:207-221 | system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:789-801 — 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:117-139 — 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 (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:54-103 | 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:43-71 | 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:56-101 — 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:1432 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1432-1462 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1533-1563 — 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:1432` 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 (22–23 lines × 2) · ×1
  • Duplicated block (22–23 lines × 2) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:315 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:315-336 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java:514-536 — 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.
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 (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:263 — system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:263-281 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:291-309 — 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. 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 (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:466 — system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:466-482 | system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:602-618 | system/platform-core/src/main/java/org/platformlambda/core/graph/MiniGraph.java:651-667 — 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 (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 (15–17 lines × 2) · ×1
  • Duplicated block (15–17 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:291 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:291-307 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:234-248 — 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:291` 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 (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:153-168 — 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 76 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: 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 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:83-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.
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: 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 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:897 — system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:897-909 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:998-1010 | system/platform-core/src/main/java/org/platformlambda/core/system/EventEmitter.java:1155-1167 — 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:480 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:480-492 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java:398-407 — 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:480` 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 (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:125-135 | 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:116-126 — 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 49 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 (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:58-67 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:60-69 — 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:47-55 — 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 76 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:175 — system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:175-182 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:187-194 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:199-206 | system/event-script-engine/src/main/java/com/accenture/services/plugins/types/InputValidation.java:211-218 — 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:175` 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:532-539 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:273-280 — 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 (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:320 — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:320-326 | connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:370-377 — 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:370` 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:112 — system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaFlowAutoStart.java:112-119 | system/twin-kafka/src/main/java/org/platformlambda/twin/kafka/SecondaryKafkaAutoStart.java:101-106 — 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:112` 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 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:56-62 | 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:45-51 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java:58-64 — 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 × 4) · ×1
  • Duplicated block (7 lines × 4) system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:114 — system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:114-120 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:270-276 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:298-304 | system/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:342-348 — 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/minimalist-msgpack/src/main/java/org/platformlambda/mini/msgpack/MsgPackWriter.java:114` 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 (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Lexer.java:50 — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Lexer.java:50-55 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/rest/GetIndexHtml.java:86-92 — 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/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Lexer.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 (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:55-60 | 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:44-49 | 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:57-62 — 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.
D4 · Code Duplication · Duplicated block (6 lines × 5) · ×1
  • Duplicated block (6 lines × 5) extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:78 — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:78-83 | system/event-script-engine/src/main/java/com/accenture/util/JsonPathSource.java:282-287 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/math/Lexer.java:47-52 | system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/rest/GetIndexHtml.java:84-89 | system/minimalist-jsonpath/src/main/java/org/platformlambda/mini/jsonpath/Parser.java:516-521 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. Read the line range as the matched WINDOW rather than a finished unit: at `extensions/agent-loop/src/main/java/org/platformlambda/agentloop/Json.java:78` 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 (3–6 lines × 4) · ×1
  • Duplicated block (3–6 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:107-112 | 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:98-103 — 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 49 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:107` 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:106` 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 (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.
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 13 sibling directories (25 clone groups) · ×1
  • Duplication concentrated across 13 sibling directories (25 clone groups) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:62 — 25 duplicated blocks under system/minigraph-playground-engine/webapp/src/components/ have copies in at least two of the sibling directories ClipboardSidebar, ConnectionPopover, Console, GraphDataView, GraphFileDialogs, GraphSetPanel (+7 more sibling(s) not listed) — 18 of them are reported below, and 7 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 25 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 25 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 25 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 (126 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (126 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:62 — system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:62 · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:308 — the two spans are one implementation copied and then locally edited — 912 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 (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 (29 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (29 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:138 — system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:138 · system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:220 — the two spans are one implementation copied and then locally edited — 212 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 (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 with local edits (19 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (19 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391 — system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391 · system/minigraph-playground-engine/webapp/src/utils/graphSet.ts:97 — the two spans are one implementation copied and then locally edited — 203 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (18 lines × 2 locations) · ×1
  • Duplicated block (18 lines × 2 locations) 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 (14 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (14 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/hooks/useGraphFileImport.ts:93 — system/minigraph-playground-engine/webapp/src/hooks/useGraphFileImport.ts:93 · system/minigraph-playground-engine/webapp/src/hooks/useGraphSetPanel.ts:194 — the two spans are one implementation copied and then locally edited — 83 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 (13 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (13 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardDuplicateDialog.tsx:19 — system/minigraph-playground-engine/webapp/src/components/ClipboardSidebar/ClipboardDuplicateDialog.tsx:19 · system/minigraph-playground-engine/webapp/src/components/GraphFileDialogs/GraphDownloadDialog.tsx:34 — the two spans are one implementation copied and then locally edited — 55 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 (11 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (11 matched lines × 2 locations) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:480 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:480 · system/minigraph-playground-engine/webapp/src/components/NodeEditPanel/NodeEditPanel.tsx:76 — the two spans are one implementation copied and then locally edited — 63 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.
R2 · Cyclomatic Complexity · Complex function Playground (cyclomatic 93, cognitive 86) · ×1
  • Complex function Playground (cyclomatic 93, cognitive 86) system/minigraph-playground-engine/webapp/src/components/Playground.tsx:113 — Playground has cyclomatic complexity 93 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 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 67, cognitive 56) · ×1
  • Complex function GraphView (cyclomatic 67, cognitive 56) system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:113 — GraphView has cyclomatic complexity 67 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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 57, cognitive 95) · ×1
  • Complex function computeLayout (cyclomatic 57, cognitive 95) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1131 — computeLayout has cyclomatic complexity 57 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function 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 schemaRowIssues (cyclomatic 26, cognitive 30) · ×1
  • Complex function schemaRowIssues (cyclomatic 26, cognitive 30) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:391 — schemaRowIssues has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function 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 validateGraphModel (cyclomatic 25, cognitive 29) · ×1
  • Complex function validateGraphModel (cyclomatic 25, cognitive 29) system/minigraph-playground-engine/webapp/src/utils/graphFile.ts:53 — validateGraphModel has cyclomatic complexity 25 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 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 nodeSchema (cyclomatic 23, cognitive 39) · ×1
  • Complex function nodeSchema (cyclomatic 23, cognitive 39) system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:446 — nodeSchema has cyclomatic complexity 23 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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 23, cognitive 29) · ×1
  • Complex function minimizeCrossings (cyclomatic 23, cognitive 29) system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:776 — minimizeCrossings has cyclomatic complexity 23 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 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 RightPanel (cyclomatic 22, cognitive 21) · ×1
  • Complex function RightPanel (cyclomatic 22, cognitive 21) system/minigraph-playground-engine/webapp/src/components/RightPanel/RightPanel.tsx:77 — 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 GraphSetPanel (cyclomatic 21, cognitive 20) · ×1
  • Complex function GraphSetPanel (cyclomatic 21, cognitive 20) system/minigraph-playground-engine/webapp/src/components/GraphSetPanel/GraphSetPanel.tsx:26 — GraphSetPanel 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 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 MockUploadPanel (cyclomatic 20, cognitive 18) · ×1
  • Complex function MockUploadPanel (cyclomatic 20, cognitive 18) system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:153 — MockUploadPanel has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts · ×1
  • system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts: 1621 lines of code system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts:1 — system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts has 1621 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/components/Playground.tsx · ×1
  • system/minigraph-playground-engine/webapp/src/components/Playground.tsx: 1117 lines of code system/minigraph-playground-engine/webapp/src/components/Playground.tsx:1 — system/minigraph-playground-engine/webapp/src/components/Playground.tsx has 1117 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx · ×1
  • system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx: 866 lines of code system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx:1 — system/minigraph-playground-engine/webapp/src/components/GraphView/GraphView.tsx has 866 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts · ×1
  • system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts: 707 lines of code system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts:1 — system/minigraph-playground-engine/webapp/src/components/GraphAuthoring/useGraphAuthoring.ts has 707 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx · ×1
  • system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx: 607 lines of code system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx:1 — system/minigraph-playground-engine/webapp/src/components/MockUploadPanel/MockUploadPanel.tsx has 607 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts · ×1
  • system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts: 545 lines of code system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts:1 — system/minigraph-playground-engine/webapp/src/utils/graphSchema.ts has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx · ×1
  • system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx: 439 lines of code system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx:1 — system/minigraph-playground-engine/webapp/src/contexts/WebSocketContext.tsx has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · No lint 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 (~129 LoC) · ×1
  • Dead file (~129 LoC) system/minigraph-playground-engine/webapp/src/hooks/useAutocomplete.ts — no import path from any entry point (14 application, 10 tooling, 65 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 (14 application, 10 tooling, 65 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.
X15 · Unvalidated length from an untrusted reader · Length read from the parsed input is spent without ever being bounded · ×1
  • Length read from the parsed input is spent without ever being bounded system/platform-core/src/main/java/org/platformlambda/core/util/FileElasticStore.java:372 — `len` is read from the bytes being parsed at line 371 (`getInt`), then used to size a `ByteBuffer.allocate` at line 372 — and nowhere in its scope is `len` bounded from above — compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an `OutOfMemoryError` or, negative, throws `NegativeArraySizeException` out of a parser whose failure path was written for malformed input, not for hostile input. Bound `len` against the bytes actually remaining and a maximum the format allows before allocating.
X2 · Cancellation propagation · Async function without AbortSignal · ×1
  • Async function without AbortSignal: fetchBytes extensions/api-playground/scripts/fetch-swagger-ui.js:64 — `fetchBytes` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×1
  • Swallowed exception (caught, then discarded) system/minigraph-playground-engine/webapp/src/contexts/ClipboardContext.tsx:83 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Minor — 47 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java:209 — `!headers.containsKey(ORIGIN) || !headers.containsKey(TOPIC)` appears character-identically in 2 files — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java, connectors/core/service-monitor/src/main/java/org/platformlambda/services/TopicController.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java:339 — `!po.exists(route) && po.getEventHttpTarget(route) == null` appears character-identically in 2 files — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphExtension.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphTask.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java:150 — `!ready && System.currentTimeMillis() < graceDeadline` appears character-identically in 2 files — extensions/redis-connection/src/main/java/org/platformlambda/redis/RedisHealthProbe.java, system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/KafkaHealthCheck.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:343 — `(next >= '1' && next <= '9') || next == 'k'` appears character-identically in 2 files — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:360 — `(previous == '*' || previous == '+' || previous == '?' || previous == '}') && !escaped(p, i - 1)` appears character-identically in 2 files — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java:292 — `INIT.equals(input) && INIT.equals(headers.get(TYPE))` appears character-identically in 2 files — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java, connectors/core/service-monitor/src/main/java/org/platformlambda/MainApp.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java:316 — `LOOP_BACK.equals(input) && headers.containsKey(REPLY_TO) && clientId.equals(headers.get(ORIGIN))` appears character-identically in 2 files — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java, connectors/core/service-monitor/src/main/java/org/platformlambda/MainApp.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java:236 — `POST.equals(method) || PUT.equals(method) || PATCH.equals(method)` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java, system/platform-core/src/main/java/org/platformlambda/automation/services/HttpRouter.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java:436 — `accept != null && accept.contains(TEXT_EVENT_STREAM)` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java, system/platform-core/src/main/java/org/platformlambda/core/services/EventApiService.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java:554 — `afterResume && SUSPEND.equals(next.getAlias())` appears character-identically in 2 files — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExecutor.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphTraveler.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/rest/UploadMockContent.java:81 — `body instanceof Map || body instanceof List` appears character-identically in 3 files — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/rest/UploadMockContent.java, system/minimalist-kafka/src/main/java/org/platformlambda/mini/kafka/RoutingRuleSet.java, system/platform-core/src/main/java/org/platformlambda/automation/http/AsyncHttpClient.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java:92 — `closedUserGroup < 1 || closedUserGroup > maxGroups` appears character-identically in 3 files — connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/reporter/PresenceConnector.java, connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceQuery.java, connectors/core/cloud-connector/src/main/java/org/platformlambda/cloud/services/ServiceRegistry.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/core/system/ServiceDef.java:79 — `clsName.contains(".") && !clsName.startsWith("java.")` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/core/system/ServiceDef.java, system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:440 — `compiledPattern != null && !compiledPattern.matcher(text).find()` appears character-identically in 2 files — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/core/system/ServiceQueue.java:213 — `consumer != null && consumer.isRegistered()` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/core/system/ServiceQueue.java, system/platform-core/src/main/java/org/platformlambda/core/system/WorkerQueues.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java:118 — `correlation.to() != null && holder.traceId != null && holder.tracePath != null` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/core/models/AsyncMultiInbox.java, system/platform-core/src/main/java/org/platformlambda/core/models/FutureMultiInbox.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/event-script-engine/src/main/java/com/accenture/adapters/HttpToFlow.java:61 — `event.getReplyTo() != null && event.getCorrelationId() != null` appears character-identically in 2 files — system/event-script-engine/src/main/java/com/accenture/adapters/HttpToFlow.java, system/event-script-engine/src/main/java/com/accenture/automation/EventScriptManager.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/automation/services/EventStreamRenderer.java:511 — `eventName != null && !eventName.isEmpty()` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/automation/services/EventStreamRenderer.java, system/platform-core/src/main/java/org/platformlambda/core/system/EventStreamWriter.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java:172 — `holder.cidHeaderName != null && holder.businessCorrelationId != null` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/automation/services/AsyncHttpResponse.java, system/platform-core/src/main/java/org/platformlambda/automation/services/EventStreamRenderer.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java:281 — `ifStatement.isEmpty() || thenStatement.isEmpty() || elseStatement.isEmpty()` appears character-identically in 2 files — system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphJs.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/skills/GraphMath.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/platform-core/src/main/java/org/platformlambda/core/websocket/client/WsClientTransmitter.java:53 — `input instanceof Map || input instanceof List` appears character-identically in 2 files — system/platform-core/src/main/java/org/platformlambda/core/websocket/client/WsClientTransmitter.java, system/platform-core/src/main/java/org/platformlambda/core/websocket/server/WsServerTransmitter.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/event-script-engine/src/main/java/com/accenture/services/SimpleExceptionHandler.java:48 — `input.containsKey(STATUS) && input.containsKey(MESSAGE)` appears character-identically in 2 files — system/event-script-engine/src/main/java/com/accenture/services/SimpleExceptionHandler.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/services/GraphExceptionHandler.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:329 — `isJavaOnlyGroup(p, i) || isPossessive(p, i)` appears character-identically in 2 files — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java:449 — `maxItems != null && list.size() > maxItems` appears character-identically in 2 files — extensions/agent-loop/src/main/java/org/platformlambda/agentloop/ToolSchema.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/contract/GraphSchema.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate system/event-script-engine/src/main/java/com/accenture/util/SimplePluginUtils.java:61 — `message.startsWith("[") && message.endsWith("]")` appears character-identically in 2 files — system/event-script-engine/src/main/java/com/accenture/util/SimplePluginUtils.java, system/minigraph-playground-engine/src/main/java/com/accenture/minigraph/websocket/server/JsonPathHandler.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×6
  • Silent fallback default on parse failure extensions/opentelemetry-forwarder/src/main/java/org/platformlambda/opentelemetry/support/TraceMetricsSpanData.java:209 — `toDouble` returns `0.0` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default on parse failure extensions/opentelemetry-forwarder/src/main/java/org/platformlambda/opentelemetry/support/TraceMetricsSpanData.java:220 — `toLong` returns `0L` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default on parse failure system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:723 — `str2double` returns `-1.0d` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default on parse failure system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:712 — `str2float` returns `-1.0f` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default on parse failure system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:666 — `str2int` returns `-1` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default on parse failure system/platform-core/src/main/java/org/platformlambda/core/util/Utility.java:701 — `str2long` returns `-1` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
AX6 · Interface segregation · Fat interface · ×1
  • Fat interface: PubSubProvider (18 abstract methods) system/platform-core/src/main/java/org/platformlambda/core/models/PubSubProvider.java:29 — `PubSubProvider` declares 18 abstract methods under just 14 distinct name(s): `cleanup`, `createQueue`, `createTopic`, `createTopic`, `deleteQueue`, `deleteTopic`, `exists`, `isStreamingPubSub`, `list`, `listen`, `partitionCount`, `publish`, `publish`, `send`, `subscribe`, `subscribe`, `unsubscribe`, `unsubscribe`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 18 separate responsibilities: a caller binds to 14 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 18 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 4 of 33 project(s) overshoot their size bounds, lowering Project Cohesion to 7.7/10. The most over is `system/platform-core` (25594 LoC, 135 module-visible types across 19 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D31 · IaC & Container Security · Low IaC · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M4 · Documentation accuracy · README/code drift · ×1
  • README/code drift system/minigraph-playground-engine/webapp/docs/build-test-deploy.md:118 — system/minigraph-playground-engine/webapp/docs/build-test-deploy.md names Vitest 5, but the manifest declares `vitest` ^4.1.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 30/31 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `helpers/graph-packager`.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:10 — 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 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation examples/kafka-demo/node/package.json:12 — `examples/kafka-demo/node/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
R7 · Dead Code · Unused export '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.
X2 · Cancellation propagation · Not all async functions that make a request accept an AbortSignal · ×1
  • Not all async functions that make a request accept an AbortSignal — Only 1/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X5 · Nullable reference types · Null assertions (`!`) override strict null checking · ×1
  • Null assertions (`!`) override strict null checking — ~2.3 `!` null assertions per 1k TypeScript source lines — 49 assertion(s) across the 21533 source line(s) of the 118 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: system/minigraph-playground-engine/webapp/src/utils/graphTransformer.ts (37), system/minigraph-playground-engine/webapp/src/components/Console/ConsoleMessage.tsx (4), system/minigraph-playground-engine/webapp/src/components/HelpBrowser/HelpBrowser.tsx (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
X7 · Silent fallback defaults · Silent fallback default in catch · ×1
  • Silent fallback default in catch agent-skills/memory-lint/scripts/memory-lint.mjs:746 — `git` swallows every exception into `return ""` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Minor — 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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-40a54b2f3f504516afa5d0302f48c5c9/history.json --exit-code 0 --source .0—
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .17artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0—
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .7artifacts/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 41 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/agent-loop/src/main/java/org/platformlambda/agentloop/AgentLoop.java`, … (+36 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 Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0—

Run 01a1c5dd-85c4-7643-914b-fae8fa6335a3 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md