Public report — moon, published 30 Sep 2026.
Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches,
dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase surveyMeasured under the Code Assurance Index · rubric rubric-2026.09.18 (frozen) · verify this surveyFiledcd_ff3ad464d87744308c85fd382fa60119
Filed 30 September 2026, 17:07 UTC
Public
Medium · 67,562 LoC · 94 projects · rebuild ~0.9 person-years · weakest lens: Accessibility (51%)
Findings by grade
127 critical416 serious19 minor39 could not be resolved — could be critical — see Limitations
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
30 September 2026, 16:55 UTC
A measurement, not a certificate. The Code Assurance Index does not certify,
approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The
standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said
here so the number is checked rather than believed.
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
510findings with an exact file:lineof 562 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
60/133dimensions across the health lenses67562 LoC · 94 projects — wide & deep
⚠ A critical security finding caps this grade — resolve it before relying on the score below; see the Security lens.
The system holds a moderate health score of 55%, indicating a workable asset carrying significant compliance and operational risk. With nearly 70,000 lines of production code and a rebuild cost of approximately €130,000, the value tied up here is substantial. While the core logic is sound, the weakest areas threaten delivery speed and legal exposure, requiring immediate attention to protect the business.
The most critical vulnerability lies in accessibility, which scores only 51%. This is not merely a technical debt issue but a direct business risk affecting user trust and regulatory compliance. Without programmatic labels for controls and buttons, the application excludes users relying on assistive technologies, potentially leading to legal challenges and reputational damage. Remediation here offers the highest return on effort, as fixing these issues is relatively low-cost compared to the risk of non-compliance.
Operational readiness also poses a medium risk, scoring 55%. The lack of request timeouts and retry logic means the system is fragile under load or network instability. This can lead to indefinite hangs, resource exhaustion, and poor user experience during outages. Strengthening these boundaries ensures the system behaves predictably, reducing the cost of incidents and improving reliability for end-users.
Despite these risks, the codebase demonstrates genuine strength in its architectural foundation and event sourcing, which score 71% and 100% respectively. This solid backbone means that core business logic is maintainable and scalable, providing a stable platform for future growth. The high maturity in these areas suggests that the team has good practices in place for the core domain.
Focus first on enforcing accessibility in the toolchain by adding linting and automated testing. This single action addresses the highest-risk area with minimal effort, securing the business against compliance failures while laying the groundwork for a more robust, user-friendly product.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
D22 · Duplicate intent: Two methods appear to check for the same CI environment condition. 'is_ci' is likely the standard accessor, while 'is_ci_env' is redundant or a legacy alias.
D22 · Duplicate intent: Both methods take a path and return a String, implying they perform the same normalization of path separators. The names 'normalize' and 'standardize' are semantically identical in this context.
D22 · Confusing naming convention: 'new' and 'new_full' suggest a constructor pattern, but 'new_full' implies 'new' is incomplete or defaulting. In Rust, 'new' is the standard constructor. Using 'new_full' for a second constructor is non-idiomatic and confusing.
D22 · Inconsistent return types and error handling: 'locate_root' returns a VirtualPath directly (implying it never fails or panics on failure), while 'locate_root_with_check' returns AnyResult. This inconsistency in error handling strategy for similar operations is confusing.
D22 · Inconsistent return types and error handling: Same issue as 'locate_root' vs 'locate_root_with_check'. 'locate_root_many' returns VirtualPath directly, while the 'with_check' variant returns AnyResult.
A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.
0.8× (at 55% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~0.9 person-years of build effort (about ~€130,000 to rebuild). Its weakest lens is Accessibility at 51% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.1) — vertical slice × a 0.8× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.
Value concentrated against a weak lens · Medium · Value at risk
This is a Medium asset (~0.9 person-years to rebuild), and its weakest lens is Accessibility at 51%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Accessibility first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture — module dependency matrix
Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
471 modules, 736 dependencies. 3 dependency cycles across 9 modules, marked above the diagonal.
Showing the 40 most-connected modules; 431 more are not drawn.
Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
moon_graph_utils.graph_context uses moon_config.extensions_config. Changing moon_config.extensions_config can break moon_graph_utils.graph_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
16→6 moon_graph_utils.graph_context depends on moon_config.toolchains_config✕
Type pairs
1 distinct (type in moon_graph_utils.graph_context → type in moon_config.toolchains_config) reference.
moon_graph_utils.graph_context uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_graph_utils.graph_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
16→7 moon_graph_utils.graph_context depends on moon_config.workspace_config✕
Type pairs
1 distinct (type in moon_graph_utils.graph_context → type in moon_config.workspace_config) reference.
moon_graph_utils.graph_context uses moon_config.workspace_config. Changing moon_config.workspace_config can break moon_graph_utils.graph_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
17→8 moon_process.command depends on moon_console✕
Type pairs
1 distinct (type in moon_process.command → type in moon_console) reference.
moon_toolchain_plugin.toolchain_registry uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_toolchain_plugin.toolchain_registry, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
20→13 moon_action.operation depends on moon_action.action✕
Type pairs
1 distinct (type in moon_action.operation → type in moon_action.action) reference.
moon_project_builder.project_builder uses moon_config.project.dep_config. Changing moon_config.project.dep_config can break moon_project_builder.project_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
22→6 moon_project_builder.project_builder depends on moon_config.toolchains_config✕
Type pairs
1 distinct (type in moon_project_builder.project_builder → type in moon_config.toolchains_config) reference.
moon_project_builder.project_builder uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_project_builder.project_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
22→18 moon_project_builder.project_builder depends on moon_project.project✕
Type pairs
2 distinct (type in moon_project_builder.project_builder → type in moon_project.project) references.
moon_project_builder.project_builder uses moon_project.project. Changing moon_project.project can break moon_project_builder.project_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
22→19 moon_project_builder.project_builder depends on moon_toolchain_plugin.toolchain_registry✕
Type pairs
1 distinct (type in moon_project_builder.project_builder → type in moon_toolchain_plugin.toolchain_registry) reference.
moon_project_builder.project_builder uses moon_toolchain_plugin.toolchain_registry. Changing moon_toolchain_plugin.toolchain_registry can break moon_project_builder.project_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→5 moon_project_graph.project_graph depends on moon_config.project.dep_config✕
Type pairs
2 distinct (type in moon_project_graph.project_graph → type in moon_config.project.dep_config) references.
moon_project_graph.project_graph uses moon_config.project.dep_config. Changing moon_config.project.dep_config can break moon_project_graph.project_graph, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→16 moon_project_graph.project_graph depends on moon_graph_utils.graph_context✕
Type pairs
1 distinct (type in moon_project_graph.project_graph → type in moon_graph_utils.graph_context) reference.
moon_project_graph.project_graph uses moon_graph_utils.graph_context. Changing moon_graph_utils.graph_context can break moon_project_graph.project_graph, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→18 moon_project_graph.project_graph depends on moon_project.project✕
Type pairs
2 distinct (type in moon_project_graph.project_graph → type in moon_project.project) references.
moon_task_builder.tasks_builder uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_task_builder.tasks_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
24→10 moon_task_builder.tasks_builder depends on moon_task.task✕
Type pairs
2 distinct (type in moon_task_builder.tasks_builder → type in moon_task.task) references.
moon_task_builder.tasks_builder uses moon_toolchain_plugin.toolchain_registry. Changing moon_toolchain_plugin.toolchain_registry can break moon_task_builder.tasks_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
25→4 moon_token.contexts depends on moon_config.extensions_config✕
Type pairs
1 distinct (type in moon_token.contexts → type in moon_config.extensions_config) reference.
moon_daemon_client.daemon_client uses moon_manifest.manifest. Changing moon_manifest.manifest can break moon_daemon_client.daemon_client, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
29→10 moon_workspace_graph depends on moon_task.task✕
Type pairs
1 distinct (type in moon_workspace_graph → type in moon_task.task) reference.
moon_action_pipeline.job_context uses moon_action_pipeline.event_emitter. Changing moon_action_pipeline.event_emitter can break moon_action_pipeline.job_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
30→13 moon_action_pipeline.job_context depends on moon_action.action✕
Type pairs
1 distinct (type in moon_action_pipeline.job_context → type in moon_action.action) reference.
moon_action_pipeline.job_context uses moon_daemon_client.daemon_client. Changing moon_daemon_client.daemon_client can break moon_action_pipeline.job_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
30→29 moon_action_pipeline.job_context depends on moon_workspace_graph✕
Type pairs
1 distinct (type in moon_action_pipeline.job_context → type in moon_workspace_graph) reference.
moon_app_context.app_context uses moon_config.extensions_config. Changing moon_config.extensions_config can break moon_app_context.app_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→6 moon_app_context.app_context depends on moon_config.toolchains_config✕
Type pairs
1 distinct (type in moon_app_context.app_context → type in moon_config.toolchains_config) reference.
moon_app_context.app_context uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_app_context.app_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→7 moon_app_context.app_context depends on moon_config.workspace_config✕
Type pairs
1 distinct (type in moon_app_context.app_context → type in moon_config.workspace_config) reference.
moon_app_context.app_context uses moon_config.workspace_config. Changing moon_config.workspace_config can break moon_app_context.app_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→8 moon_app_context.app_context depends on moon_console✕
Type pairs
1 distinct (type in moon_app_context.app_context → type in moon_console) reference.
moon_app_context.app_context uses moon_toolchain_plugin.toolchain_registry. Changing moon_toolchain_plugin.toolchain_registry can break moon_app_context.app_context, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→31 moon_app_context.app_context depends on moon_cache.cache_engine✕
Type pairs
1 distinct (type in moon_app_context.app_context → type in moon_cache.cache_engine) reference.
moon_workspace.workspace_builder uses moon_config.extensions_config. Changing moon_config.extensions_config can break moon_workspace.workspace_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→5 moon_workspace.workspace_builder depends on moon_config.project.dep_config✕
Type pairs
1 distinct (type in moon_workspace.workspace_builder → type in moon_config.project.dep_config) reference.
moon_workspace.workspace_builder uses moon_config.project.dep_config. Changing moon_config.project.dep_config can break moon_workspace.workspace_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→6 moon_workspace.workspace_builder depends on moon_config.toolchains_config✕
Type pairs
1 distinct (type in moon_workspace.workspace_builder → type in moon_config.toolchains_config) reference.
moon_workspace.workspace_builder uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_workspace.workspace_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→7 moon_workspace.workspace_builder depends on moon_config.workspace_config✕
Type pairs
1 distinct (type in moon_workspace.workspace_builder → type in moon_config.workspace_config) reference.
moon_workspace.workspace_builder uses moon_config.workspace_config. Changing moon_config.workspace_config can break moon_workspace.workspace_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→19 moon_workspace.workspace_builder depends on moon_toolchain_plugin.toolchain_registry✕
Type pairs
1 distinct (type in moon_workspace.workspace_builder → type in moon_toolchain_plugin.toolchain_registry) reference.
moon_workspace.workspace_builder uses moon_toolchain_plugin.toolchain_registry. Changing moon_toolchain_plugin.toolchain_registry can break moon_workspace.workspace_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→31 moon_workspace.workspace_builder depends on moon_cache.cache_engine✕
Type pairs
1 distinct (type in moon_workspace.workspace_builder → type in moon_cache.cache_engine) reference.
moon_workspace.workspace_builder uses moon_cache.cache_engine. Changing moon_cache.cache_engine can break moon_workspace.workspace_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→1 moon_action_graph.action_graph_builder depends on moon_action.action_node✕
Type pairs
1 distinct (type in moon_action_graph.action_graph_builder → type in moon_action.action_node) reference.
moon_action_graph.action_graph_builder uses moon_action.action_node. Changing moon_action.action_node can break moon_action_graph.action_graph_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→3 moon_action_graph.action_graph_builder depends on moon_affected.affected✕
Type pairs
4 distinct (type in moon_action_graph.action_graph_builder → type in moon_affected.affected) references.
moon_action_graph.action_graph_builder uses moon_affected.affected. Changing moon_affected.affected can break moon_action_graph.action_graph_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→10 moon_action_graph.action_graph_builder depends on moon_task.task✕
Type pairs
1 distinct (type in moon_action_graph.action_graph_builder → type in moon_task.task) reference.
moon_action_graph.action_graph_builder uses moon_project.project. Changing moon_project.project can break moon_action_graph.action_graph_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→29 moon_action_graph.action_graph_builder depends on moon_workspace_graph✕
Type pairs
1 distinct (type in moon_action_graph.action_graph_builder → type in moon_workspace_graph) reference.
moon_action_graph.action_graph_builder uses moon_workspace_graph. Changing moon_workspace_graph can break moon_action_graph.action_graph_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→32 moon_action_graph.action_graph_builder depends on moon_app_context.app_context✕
Type pairs
1 distinct (type in moon_action_graph.action_graph_builder → type in moon_app_context.app_context) reference.
moon_action_graph.action_graph_builder uses moon_app_context.app_context. Changing moon_app_context.app_context can break moon_action_graph.action_graph_builder, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→1 moon_action_pipeline.action_pipeline depends on moon_action.action_node✕
Type pairs
1 distinct (type in moon_action_pipeline.action_pipeline → type in moon_action.action_node) reference.
moon_action_pipeline.action_pipeline uses moon_action.action_node. Changing moon_action.action_node can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→2 moon_action_pipeline.action_pipeline depends on moon_action_pipeline.event_emitter✕
Type pairs
1 distinct (type in moon_action_pipeline.action_pipeline → type in moon_action_pipeline.event_emitter) reference.
moon_action_pipeline.action_pipeline uses moon_action_pipeline.event_emitter. Changing moon_action_pipeline.event_emitter can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→13 moon_action_pipeline.action_pipeline depends on moon_action.action✕
Type pairs
2 distinct (type in moon_action_pipeline.action_pipeline → type in moon_action.action) references.
moon_action_pipeline.action_pipeline uses moon_action.action. Changing moon_action.action can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→14 moon_action_pipeline.action_pipeline depends on moon_action_context✕
Type pairs
2 distinct (type in moon_action_pipeline.action_pipeline → type in moon_action_context) references.
moon_action_pipeline.action_pipeline uses moon_action_context. Changing moon_action_context can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→27 moon_action_pipeline.action_pipeline depends on moon_console.reporter✕
Type pairs
1 distinct (type in moon_action_pipeline.action_pipeline → type in moon_console.reporter) reference.
moon_action_pipeline.action_pipeline uses moon_console.reporter. Changing moon_console.reporter can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→28 moon_action_pipeline.action_pipeline depends on moon_daemon_client.daemon_client✕
Type pairs
1 distinct (type in moon_action_pipeline.action_pipeline → type in moon_daemon_client.daemon_client) reference.
moon_action_pipeline.action_pipeline uses moon_daemon_client.daemon_client. Changing moon_daemon_client.daemon_client can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→29 moon_action_pipeline.action_pipeline depends on moon_workspace_graph✕
Type pairs
1 distinct (type in moon_action_pipeline.action_pipeline → type in moon_workspace_graph) reference.
moon_action_pipeline.action_pipeline uses moon_workspace_graph. Changing moon_workspace_graph can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→30 moon_action_pipeline.action_pipeline depends on moon_action_pipeline.job_context✕
Type pairs
2 distinct (type in moon_action_pipeline.action_pipeline → type in moon_action_pipeline.job_context) references.
moon_action_pipeline.action_pipeline uses moon_action_pipeline.job_context. Changing moon_action_pipeline.job_context can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→32 moon_action_pipeline.action_pipeline depends on moon_app_context.app_context✕
Type pairs
2 distinct (type in moon_action_pipeline.action_pipeline → type in moon_app_context.app_context) references.
moon_action_pipeline.action_pipeline uses moon_app_context.app_context. Changing moon_app_context.app_context can break moon_action_pipeline.action_pipeline, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→1 moon_actions.actions.install_dependencies depends on moon_action.action_node✕
Type pairs
2 distinct (type in moon_actions.actions.install_dependencies → type in moon_action.action_node) references.
moon_actions.actions.install_dependencies uses moon_action.action_node. Changing moon_action.action_node can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→11 moon_actions.actions.install_dependencies depends on moon_toolchain_plugin.toolchain_plugin✕
Type pairs
1 distinct (type in moon_actions.actions.install_dependencies → type in moon_toolchain_plugin.toolchain_plugin) reference.
moon_actions.actions.install_dependencies uses moon_toolchain_plugin.toolchain_plugin. Changing moon_toolchain_plugin.toolchain_plugin can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→13 moon_actions.actions.install_dependencies depends on moon_action.action✕
Type pairs
1 distinct (type in moon_actions.actions.install_dependencies → type in moon_action.action) reference.
moon_actions.actions.install_dependencies uses moon_action.action. Changing moon_action.action can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→14 moon_actions.actions.install_dependencies depends on moon_action_context✕
Type pairs
1 distinct (type in moon_actions.actions.install_dependencies → type in moon_action_context) reference.
moon_actions.actions.install_dependencies uses moon_action_context. Changing moon_action_context can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→18 moon_actions.actions.install_dependencies depends on moon_project.project✕
Type pairs
1 distinct (type in moon_actions.actions.install_dependencies → type in moon_project.project) reference.
moon_actions.actions.install_dependencies uses moon_project.project. Changing moon_project.project can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→29 moon_actions.actions.install_dependencies depends on moon_workspace_graph✕
Type pairs
1 distinct (type in moon_actions.actions.install_dependencies → type in moon_workspace_graph) reference.
moon_actions.actions.install_dependencies uses moon_workspace_graph. Changing moon_workspace_graph can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→32 moon_actions.actions.install_dependencies depends on moon_app_context.app_context✕
Type pairs
1 distinct (type in moon_actions.actions.install_dependencies → type in moon_app_context.app_context) reference.
moon_actions.actions.install_dependencies uses moon_app_context.app_context. Changing moon_app_context.app_context can break moon_actions.actions.install_dependencies, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→1 moon_task_hasher.task_hashing depends on moon_action.action_node✕
Type pairs
1 distinct (type in moon_task_hasher.task_hashing → type in moon_action.action_node) reference.
moon_task_hasher.task_hashing uses moon_config.project.dep_config. Changing moon_config.project.dep_config can break moon_task_hasher.task_hashing, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→10 moon_task_hasher.task_hashing depends on moon_task.task✕
Type pairs
2 distinct (type in moon_task_hasher.task_hashing → type in moon_task.task) references.
moon_task_hasher.task_hashing uses moon_toolchain_plugin.toolchain_plugin. Changing moon_toolchain_plugin.toolchain_plugin can break moon_task_hasher.task_hashing, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→14 moon_task_hasher.task_hashing depends on moon_action_context✕
Type pairs
2 distinct (type in moon_task_hasher.task_hashing → type in moon_action_context) references.
moon_task_hasher.task_hashing uses moon_app_context.app_context. Changing moon_app_context.app_context can break moon_task_hasher.task_hashing, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
38→1 moon_task_runner.task_runner depends on moon_action.action_node✕
Type pairs
1 distinct (type in moon_task_runner.task_runner → type in moon_action.action_node) reference.
moon_task_runner.task_runner uses moon_daemon_client.daemon_client. Changing moon_daemon_client.daemon_client can break moon_task_runner.task_runner, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
38→32 moon_task_runner.task_runner depends on moon_app_context.app_context✕
Type pairs
1 distinct (type in moon_task_runner.task_runner → type in moon_app_context.app_context) reference.
moon_task_runner.task_runner uses moon_app_context.app_context. Changing moon_app_context.app_context can break moon_task_runner.task_runner, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
39→4 moon_app.session depends on moon_config.extensions_config✕
Type pairs
1 distinct (type in moon_app.session → type in moon_config.extensions_config) reference.
moon_app.session uses moon_action_graph.action_graph_builder. Changing moon_action_graph.action_graph_builder can break moon_app.session, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→4 moon_test_utils.workspace_mocker depends on moon_config.extensions_config✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_config.extensions_config) reference.
moon_test_utils.workspace_mocker uses moon_config.extensions_config. Changing moon_config.extensions_config can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→6 moon_test_utils.workspace_mocker depends on moon_config.toolchains_config✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_config.toolchains_config) reference.
moon_test_utils.workspace_mocker uses moon_config.toolchains_config. Changing moon_config.toolchains_config can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→7 moon_test_utils.workspace_mocker depends on moon_config.workspace_config✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_config.workspace_config) reference.
moon_test_utils.workspace_mocker uses moon_config.workspace_config. Changing moon_config.workspace_config can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→8 moon_test_utils.workspace_mocker depends on moon_console✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_console) reference.
moon_test_utils.workspace_mocker uses moon_toolchain_plugin.toolchain_registry. Changing moon_toolchain_plugin.toolchain_registry can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→29 moon_test_utils.workspace_mocker depends on moon_workspace_graph✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_workspace_graph) reference.
moon_test_utils.workspace_mocker uses moon_cache.cache_engine. Changing moon_cache.cache_engine can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→32 moon_test_utils.workspace_mocker depends on moon_app_context.app_context✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_app_context.app_context) reference.
moon_test_utils.workspace_mocker uses moon_app_context.app_context. Changing moon_app_context.app_context can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→33 moon_test_utils.workspace_mocker depends on moon_workspace.workspace_builder✕
Type pairs
2 distinct (type in moon_test_utils.workspace_mocker → type in moon_workspace.workspace_builder) references.
moon_test_utils.workspace_mocker uses moon_workspace.workspace_builder. Changing moon_workspace.workspace_builder can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→34 moon_test_utils.workspace_mocker depends on moon_action_graph.action_graph_builder✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_action_graph.action_graph_builder) reference.
moon_test_utils.workspace_mocker uses moon_action_graph.action_graph_builder. Changing moon_action_graph.action_graph_builder can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→35 moon_test_utils.workspace_mocker depends on moon_action_pipeline.action_pipeline✕
Type pairs
1 distinct (type in moon_test_utils.workspace_mocker → type in moon_action_pipeline.action_pipeline) reference.
moon_test_utils.workspace_mocker uses moon_action_pipeline.action_pipeline. Changing moon_action_pipeline.action_pipeline can break moon_test_utils.workspace_mocker, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2021 — Injection
95
High / Critical
A06:2021 — Vulnerable & Outdated Components
61
High / Critical
A05:2021 — Security Misconfiguration
6
High / Critical
Roadmap
First, ensure every form control and button has a proper programmatic label to fix accessibility issues. Second, integrate accessibility checks into your linting, testing, and CI pipelines to prevent future regressions. Third, add request timeouts and retry logic to all outbound HTTP calls to improve system resilience. Fourth, increase test coverage by adding tests for currently unreached production modules. Finally, extend structured logging to all remaining runnable modules to ensure full observability in production.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.
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 — 127
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 — 416
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 — 19
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 39
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 55 of 60 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 60 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 510 of 562 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT READ here — but this repository measures it: a coverage step in CI (`codecov/codecov-action`) shows that coverage is collected and tracked in your own CI. The built-in collector has no runner for this ecosystem (.rs, .ts), so the analyzer could not read the number — a gap in the analyzer's language coverage, not an unmeasured repo. Not scored. To have the real number read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`, or lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) 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. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`, or lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) 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 — then the real number is read on the next scan.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 22 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 134 test source file(s) (.rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs, .ts) and this repository declares a Cargo test suite (repository root, 144 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 39 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, which could not be reached on this run, 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 (94 contributor(s) across 2290 commit(s) sampled, automation and bot accounts excluded). One of them holds 94% of the history; the other 93 hold 0.1% 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.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `website/docusaurus.config.ts` 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.
AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and no container it models, or knows cannot hold a captive, was found in this repository's source, 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.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AX7 Slice cohesion — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 39 further occurrence(s) are not listed individually; the score already reflects all 79.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
ED5 Idempotency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
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.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
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.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a 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.
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.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (5): D19, D21, D22, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
27 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was moon_cli::shared::run_cli at 56. A further 3 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being TokenExpander::replace_variable at 33 — they are counted neither in the figure above nor in this dimension's score. 2 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: crates/config-loader/src/toolchains_config_ext.rs (ToolchainsConfigExt::get_plugin_locator at 18), crates/action-pipeline/src/event_emitter.rs (Event::get_type at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 11 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 moon_app finding(s) in Cyclomatic Complexity — start with generate.rs (3), projects.rs, tasks.rs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 3 TasksBuilder finding(s) in Cyclomatic Complexity — start with tasks_builder.rs (3). — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 WorkspaceGraph finding(s) in Cyclomatic Complexity — start with query_projects.rs, query_tasks.rs. — One of this dimension's main actionable groups (2 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 39 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 14 moon_app finding(s) in Cognitive Complexity — start with v2.rs (4), generate.rs (3), file.rs. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 6 ActionGraphBuilder finding(s) in Cognitive Complexity — start with action_graph_builder.rs (6). — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 TasksBuilder finding(s) in Cognitive Complexity — start with tasks_builder.rs (5). — One of this dimension's main actionable groups (5 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.1 / 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 15 FunctionTooLong finding(s) in God Classes — start with generate.rs (3), task.rs, project.rs. — One of this dimension's main actionable groups (15 warning-level).
Resolve the 10 ClassTooLong finding(s) in God Classes — start with action_graph_builder.rs, tasks_builder.rs, workspace_builder.rs. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 8 FileTooLong finding(s) in God Classes — start with action_graph_builder.rs, tasks_builder.rs, workspace_builder.rs. — One of this dimension's main actionable groups (8 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
91 duplicated block group(s) detected. A further 2 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 7 of the 93 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 32 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 13 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with affected_tracker.rs (3), extension_wrapper.rs (2), generate.rs. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 9 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with projects_builder.rs (2), file.rs, info.rs. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 8 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with extension_plugin.rs (4), lib.rs, exec_command.rs. — One of this dimension's main actionable groups (8 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling7.0 / 10Adequate✓ 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.
94 production modules (Cargo+npm+Python), 0 dependency cycle(s), 18 unstable depended-on module(s). Read from the build's own module declarations; 13 module(s) off the main sequence, with abstractness counted on 66 of the 94 (the rest declare no modelled class or interface, export only macros, or have no source directory of their own).
Off the main sequence: moon_daemon_utils · ×13
Unstable project moon_action_graph
Unstable project moon_action_pipeline
Unstable project moon_actions
Unstable project moon_cache_local
+ 14 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 13 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 1 Unstable project moon_action_graph finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project moon_action_pipeline finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with toolchain_registry.rs, extension_registry.rs, session.rs. — One of this dimension's main actionable groups (4 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution8.8 / 10Strong✓ 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.
2854 test methods: 160 unit, 2694 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 22 `it`/`test` case(s) across 3 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 2832 `#[test]` function(s) across 144 file(s) declaring at least one; its unit/integration split is Cargo's own — 120 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
Inverted test pyramid
What to do
Resolve the 1 Inverted test pyramid finding(s) in Test Distribution. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d9_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
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.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 22 tests. Measured on the JavaScript/TypeScript suite only — at least 134 test source file(s) (.rs) went unread, so its test quality is unmeasured and is not in these counts.
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.
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.
Resolve the 10 Hotspot finding(s) in Churn × Complexity Hotspots — start with shared.rs, tasks_builder.rs, action_graph_builder.rs. — One of this dimension's main actionable groups (10 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
9 deducted task-comment markers across 67562 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.
Resolve the 9 TodoComment finding(s) in Explicit Debt — start with tasks_builder.rs (2), projects_builder.rs (2), action_graph_builder.rs. — One of this dimension's main actionable groups (9 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README is a strong overview (moon as a Rust build/management tool inspired by Bazel), with an excellent Why-use-moon section and a full Features list. The packages/*/README.md documents each directory it contains without claiming the repository itself; the root README also links to CONTRIBUTING, CODE_OF_CONDUCT, and a CHANGELOG_V0 changelog that is fully visible (v0 through v1). A companion Nix flake doc explains how moon can be built from git refs for Nix users. The only unstructured element is the standalone docs/PLUGIN_APIS.md, which lists plugin API tiers with no headings or ordering but is otherwise well written. The repository's documentation is mostly terminology and reference material (13 READMEs plus 7 architecture/Docs markdown files), with no overview, installation, usage, or contribution guidance. The only substantive content is a table of terms like 'Action', 'Dependency graph', and 'Hash' with cross-references to guides/codegen; it does not describe what the project is for, how to run it, or where to contribute.
Documentation: contradicts the code · ×2docs/CHANGELOG_V0.md
What to do
Resolve the 2 Documentation finding(s) in Documentation Quality — start with CHANGELOG_V0.md, CHANGELOG_V1.md. — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 0 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyAdequate◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
Duplicate intent: Two methods appear to check for the same CI environment condition. 'is_ci' is likely the standard accessor, while 'is_ci_env' is redundant or a legacy alias. · ×2
Inconsistent return types and error handling: 'locate_root' returns a VirtualPath directly (implying it never fails or panics on failure), while 'locate_root_with_check' returns AnyResult. This inconsistency in error handling strategy for similar operations is confusing. · ×2
Confusing naming convention: 'new' and 'new_full' suggest a constructor pattern, but 'new_full' implies 'new' is incomplete or defaulting. In Rust, 'new' is the standard constructor. Using 'new_full' for a second constructor is non-idiomatic and confusing.
What to do
Resolve the 2 Duplicate intent finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Inconsistent return types and error handling finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Confusing naming convention finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
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).
95 finding(s): 0 critical, 95 high, 0 medium, 0 low. 70 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 3 file(s) — `website/docusaurus.config.ts` (line 58, line 217), `REDACTED` (lines 7–76), `REDACTED` (lines 7–105) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 6 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 9 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (3), REDACTED. — One of this dimension's main actionable groups (9 issue-level).
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED, REDACTED. — One of this dimension's main actionable groups (5 issue-level).
No action in Static Analysis (SAST) — all 70 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 (70 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 26 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (26). — One of this dimension's main actionable groups (26 issue-level).
Resolve the 3 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 1 High IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 5 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3), REDACTED, REDACTED. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 248 of the 489 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
Resolve the 2 Change coupling finding(s) in Change Coupling — start with check.rs, output_archiver.rs. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
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.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 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.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC2 · Forms & labels1.0 / 10Critical✓ 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 no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. — packages/visualizer/src/app.tsx:42
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.
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.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 5 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
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.
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.
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.
Other · Architecture — Whether feature slices stay independent (no direct cross-slice references) — the discipline that makes vertical-slice architecture pay off.
Method: Roslyn scan (vertical-slice gated): feature slices resolved from namespaces (.Features.*, .Slices.*) or project names; cross-slice type references detected. Deterministic, traceable.
`ActionContext` (slice 'moon_action_context') depends on `Affected` from slice 'moon_affected'. — crates/action-context/src/lib.rs:45
`RunRequirements` (slice 'moon_action_graph') depends on `UpstreamScope` from slice 'moon_affected'. — crates/action-graph/src/action_graph_builder.rs:55
`ActionGraphBuilder` (slice 'moon_action_graph') depends on `Criteria` from slice 'moon_query'. — crates/action-graph/src/action_graph_builder.rs:127
`ActionPipeline` (slice 'moon_action_pipeline') depends on `Level` from slice 'moon_console'. — crates/action-pipeline/src/action_pipeline.rs:30
`Job` (slice 'moon_action_pipeline') depends on `AppContext` from slice 'moon_app_context'. — crates/action-pipeline/src/job.rs:9
`JobContext` (slice 'moon_action_pipeline') depends on `WorkspaceGraph` from slice 'moon_workspace_graph'. — crates/action-pipeline/src/job_context.rs:12
`CleanupSubscriber` (slice 'moon_action_pipeline') depends on `CacheEngine` from slice 'moon_cache'. — crates/action-pipeline/src/subscribers/cleanup_subscriber.rs:9
`ConsoleSubscriber` (slice 'moon_action_pipeline') depends on `Console` from slice 'moon_console'. — crates/action-pipeline/src/subscribers/console_subscriber.rs:6
`RunReport` (slice 'moon_action_pipeline') depends on `ActionContext` from slice 'moon_action_context'. — crates/action-pipeline/src/subscribers/reports_subscriber.rs:14
`ReportsSubscriber` (slice 'moon_action_pipeline') depends on `CacheEngine` from slice 'moon_cache'. — crates/action-pipeline/src/subscribers/reports_subscriber.rs:29
`WebhooksSubscriber` (slice 'moon_action_pipeline') depends on `WebhooksNotifier` from slice 'moon_notifier'. — crates/action-pipeline/src/subscribers/webhooks_subscriber.rs:6
`InstallDependenciesFingerprint` (slice 'moon_actions') depends on `ProjectFragment` from slice 'moon_project'. — crates/actions/src/actions/install_dependencies.rs:26
`SetupEnvironmentFingerprint` (slice 'moon_actions') depends on `ProjectFragment` from slice 'moon_project'. — crates/actions/src/actions/setup_environment.rs:15
`ExecCommandOptions` (slice 'moon_actions') depends on `Project` from slice 'moon_project'. — crates/actions/src/plugins/commands.rs:57
`AffectedTracker` (slice 'moon_affected') depends on `WorkspaceGraph` from slice 'moon_workspace_graph'. — crates/affected/src/affected_tracker.rs:18
`ProjectTracker` (slice 'moon_affected') depends on `Project` from slice 'moon_project'. — crates/affected/src/project_tracker.rs:10
`TaskTracker` (slice 'moon_affected') depends on `Task` from slice 'moon_task'. — crates/affected/src/task_tracker.rs:12
`CompletionsArgs` (slice 'moon_app') depends on `ShellType` from slice 'moon_vcs_hooks'. — crates/app/src/commands/completions.rs:11
`ToolchainDependenciesWorkspace` (slice 'moon_app') depends on `Project` from slice 'moon_project'. — crates/app/src/commands/docker/prune.rs:16
`PruneWorkflow` (slice 'moon_app') depends on `ProjectGraph` from slice 'moon_project_graph'. — crates/app/src/commands/docker/prune.rs:23
`ScaffoldWorkflow` (slice 'moon_app') depends on `ProjectGraph` from slice 'moon_project_graph'. — crates/app/src/commands/docker/scaffold.rs:24
`ExecWorkflow` (slice 'moon_app') depends on `Console` from slice 'moon_console'. — crates/app/src/commands/exec.rs:146
`QueryAffectedArgs` (slice 'moon_app') depends on `DownstreamScope` from slice 'moon_affected'. — crates/app/src/commands/query/affected.rs:11
`QueryProjectsArgs` (slice 'moon_app') depends on `DownstreamScope` from slice 'moon_affected'. — crates/app/src/commands/query/projects.rs:13
`QueryTasksArgs` (slice 'moon_app') depends on `DownstreamScope` from slice 'moon_affected'. — crates/app/src/commands/query/tasks.rs:14
`QueryProjectsOptions` (slice 'moon_app') depends on `Affected` from slice 'moon_affected'. — crates/app/src/queries/projects.rs:10
`QueryProjectsResult` (slice 'moon_app') depends on `Project` from slice 'moon_project'. — crates/app/src/queries/projects.rs:26
`QueryTasksOptions` (slice 'moon_app') depends on `Affected` from slice 'moon_affected'. — crates/app/src/queries/tasks.rs:12
`MoonSession` (slice 'moon_app') depends on `Console` from slice 'moon_console'. — crates/app/src/session.rs:45
`AppContext` (slice 'moon_app_context') depends on `CacheEngine` from slice 'moon_cache'. — crates/app-context/src/app_context.rs:15
`CacheEngine` (slice 'moon_cache') depends on `Storage` from slice 'moon_cache_storage'. — crates/cache/src/cache_engine.rs:24
`LocalStorage` (slice 'moon_cache_local') depends on `CacheContext` from slice 'moon_cache_storage'. — crates/cache-local/src/local_storage.rs:20
`CompressableBlob` (slice 'moon_cache_remote') depends on `Blob` from slice 'moon_blob'. — crates/cache-remote/src/compressable_blob.rs:9
`GrpcRemoteStorage` (slice 'moon_cache_remote') depends on `CacheContext` from slice 'moon_cache_storage'. — crates/cache-remote/src/grpc_remote_storage.rs:49
`HttpRemoteStorage` (slice 'moon_cache_remote') depends on `CacheContext` from slice 'moon_cache_storage'. — crates/cache-remote/src/http_remote_storage.rs:24
`ManifestSource` (slice 'moon_cache_storage') depends on `Manifest` from slice 'moon_manifest'. — crates/cache-storage/src/storage.rs:28
`RetrieveResult` (slice 'moon_cache_storage') depends on `BlobOutput` from slice 'moon_blob'. — crates/cache-storage/src/storage_backend.rs:25
`DaemonState` (slice 'moon_daemon_server') depends on `AppContext` from slice 'moon_app_context'. — crates/daemon-server/src/daemon_server.rs:50
`DaemonServiceInner` (slice 'moon_daemon_server') depends on `TaskTracker` from slice 'moon_affected'. — crates/daemon-server/src/daemon_server.rs:57
`GraphBlock` (slice 'moon_exec_plan') depends on `DownstreamScope` from slice 'moon_affected'. — crates/exec-plan/src/exec_plan.rs:18
What to do
Keep slices independent: share cross-slice needs via an explicit contract/shared-kernel, not direct references between slices.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 86 of 98 project(s) that lack one — worth up to 1.8 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
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 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.
Do you agree with this assessment?
P2 · Observability6.8 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 40/43 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/config-schema`, `packages/cli`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
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.
What to do
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
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.
`reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. 3 of the 3 files that make outbound calls are unbounded; the first 3 are listed. — crates/api/src/launchpad.rs:214
`Client::builder()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — crates/cache-remote/src/http_remote_storage.rs:52
`reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — crates/notifier/src/webhooks.rs:35
What to do
Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
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 the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin) or inside a Java method returning a Reactor Mono/Flux — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`appendSchemasConfig` is async and calls existsSync, readFileSync, mkdirSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/vscode-extension/src/commands.ts:111
`viewProject` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/vscode-extension/src/projectsView.ts:464
What to do
TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
Do you agree with this assessment?
R1 · Type Safety7.9 / 10Strong✓ 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.
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.
packages/vscode-extension/src/projectsView.ts:166 · packages/vscode-extension/src/projectsView.ts:249 — all 2 copies are in the same file, and each CITED SPAN is a SPECIALISATION DECLARATION — a type whose `extends` clause names a base and whose body hands that base its own values through `super(…)`. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the `super(…)` call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row — there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base — a type argument, a service, an alias, a cache — the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited. — packages/vscode-extension/src/projectsView.ts:166
packages/vscode-extension/src/commands.ts:28 · packages/vscode-extension/src/commands.ts:61 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/vscode-extension/src/commands.ts:28
packages/vscode-extension/src/lastRunView.ts:21 · packages/vscode-extension/src/projectsView.ts:312 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/vscode-extension/src/lastRunView.ts:21
packages/vscode-extension/src/commands.ts:96 · packages/vscode-extension/src/commands.ts:108 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/vscode-extension/src/commands.ts:96
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.
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.
constructor has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/vscode-extension/src/projectsView.ts:178
getActionType has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/visualizer/src/helpers/render.ts:42
findRoot has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/vscode-extension/src/workspace.ts:98
findMoonBin has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/vscode-extension/src/workspace.ts:193
getActionLabel has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/visualizer/src/helpers/render.ts:11
canShowTask has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/vscode-extension/src/projectsView.ts:61
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ 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.
Do you agree with this assessment?
R4 · Test Coverage1.5 / 10Critical✓ 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.
vite.config.ts declares environment "node", and no package here declares a DOM implementation (jsdom / happy-dom), a component testing library or a browser runner — so none of the 2 unreached component module(s) can be tested as written, however the suite is authored: packages/visualizer/src/app.tsx, packages/visualizer/src/components/Graph.tsx. Add a DOM environment and a component testing library (for example jsdom + @testing-library, or the runner's browser mode), then test the components. Reported once because these files share one cause, not one omission each. — vite.config.ts
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×15) — packages/vscode-extension/src/projectsView.ts, packages/vscode-extension/src/workspace.ts, packages/visualizer/src/helpers/render.ts, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code9.5 / 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 7 application, 8 tooling and 11 test entry point(s) detected in this repo. Gate removals on `yarn run build` — an undetected custom entry would make these reachable.
no import path from any entry point (7 application, 8 tooling, 11 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 (×5) — scenarios/signals/ctrlc.mjs, scenarios/signals/signals.mjs, scenarios/deno-signals/main.ts, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
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.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Do you agree with this assessment?
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.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 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).
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.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — 2 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 — 66 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.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX2 Stateful singletons — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX4 Dependency direction — not applicable to a vertical-slice architecture (the inward-dependency rule is for layered/clean styles)
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release.
Install the buildx component to build images with BuildKit:
https://docs.docker.com/go/bui…; 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 included — the .rs suite was found but not re-run
D12 Dependency Hygiene — Not scored — 39 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, which could not be reached on this run, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
D14 License Compliance — Not scored — this repository's 885 shipped crate(s) were read from its REDACTED, but crates.io could not be asked for the licence of 51 of them (HTTP 429 Unknown Error), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
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.
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. 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"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — symbol resolution incomplete — navigability not assessed
D32 Data Compliance (PII/GDPR) — 1 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.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 8 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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 (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) 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
PF2 Allocation hygiene — Not applicable: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Go has 26 production line(s), 0 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R5 Dependency Freshness — uses a bun lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
S1 Web-Security Posture — Not assessed: 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.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
AC2 · Forms & labels· <select> without a programmatic label · ×1
<select> without a programmatic label packages/visualizer/src/app.tsx:42— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
FunctionTooLong: moon_app::commands::task::task crates/app/src/commands/task.rs:30— FunctionTooLong — moon_app::commands::task::task runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39× 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: moon_app::commands::generate::gather_variables crates/app/src/commands/generate.rs:528— FunctionTooLong — moon_app::commands::generate::gather_variables runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04× 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: moon_app::commands::project::project crates/app/src/commands/project.rs:27— FunctionTooLong — moon_app::commands::project::project runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: moon_app::commands::docker::file::file crates/app/src/commands/docker/file.rs:54— FunctionTooLong — moon_app::commands::docker::file::file runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.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: moon_action_pipeline::action_runner::run_action crates/action-pipeline/src/action_runner.rs:12— FunctionTooLong — moon_action_pipeline::action_runner::run_action runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: moon_app::commands::toolchain::info::info crates/app/src/commands/toolchain/info.rs:23— FunctionTooLong — moon_app::commands::toolchain::info::info runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× 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: moon_app::commands::generate::generate crates/app/src/commands/generate.rs:53— FunctionTooLong — moon_app::commands::generate::generate runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: moon_actions::actions::install_dependencies::install_dependencies crates/actions/src/actions/install_dependencies.rs:38— FunctionTooLong — moon_actions::actions::install_dependencies::install_dependencies runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× 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: ContactForm.ContactForm website/src/theme/Footer/Layout/ContactForm.tsx:15— FunctionTooLong — ContactForm runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: moon_cli::shared::run_cli crates/cli/src/shared.rs:126— FunctionTooLong — moon_cli::shared::run_cli runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: index.Home website/src/pages/index.tsx:10— FunctionTooLong — Home runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× 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: moon_app::commands::generate::parse_args_into_variables crates/app/src/commands/generate.rs:326— FunctionTooLong — moon_app::commands::generate::parse_args_into_variables runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: moon_app::commands::template::template crates/app/src/commands/template.rs:24— FunctionTooLong — moon_app::commands::template::template runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: moon_app_macros::with_affected_args crates/app-macros/src/lib.rs:161— FunctionTooLong — moon_app_macros::with_affected_args runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× 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: LangGraph.LangGraph website/src/components/Docs/LangGraph.tsx:5— FunctionTooLong — LangGraph runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× 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.
R4 · Test Coverage· No test reaches this file · ×15
No test reaches this file packages/vscode-extension/src/projectsView.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/vscode-extension/src/workspace.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/visualizer/src/helpers/render.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/vscode-extension/src/commands.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/vscode-extension/src/lastRunView.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/vscode-extension/src/graphVisualizerView.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/vscode-extension/src/index.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/cli/utils.js— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scenarios/signals/ctrlc.mjs— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scenarios/signals/signals.mjs— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scenarios/deno-signals/main.ts— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/cli/moon.js— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/cli/moonx.js— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scenarios/interactive/input.mjs— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scenarios/signals/exitCode.mjs— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
moon_app::commands::generate::gather_variables (cognitive 65) crates/app/src/commands/generate.rs:528— moon_app::commands::generate::gather_variables has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 5 (16 pts), boolean chains 8, loops 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.
moon_app::commands::generate::parse_args_into_variables (cognitive 60) crates/app/src/commands/generate.rs:326— moon_app::commands::generate::parse_args_into_variables has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 4 (10 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::migrate::v2::migrate_project_config_files (cognitive 35) crates/app/src/commands/migrate/v2.rs:520— moon_app::commands::migrate::v2::migrate_project_config_files has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (9 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::docker::file::file (cognitive 30) crates/app/src/commands/docker/file.rs:54— moon_app::commands::docker::file::file has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26 (30 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
moon_app::queries::projects::load_with_regex (cognitive 30) crates/app/src/queries/projects.rs:38— moon_app::queries::projects::load_with_regex has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::generate::generate (cognitive 30) crates/app/src/commands/generate.rs:53— moon_app::commands::generate::generate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::hash::diff_hashes (cognitive 27) crates/app/src/commands/hash.rs:82— moon_app::commands::hash::diff_hashes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::queries::tasks::load_with_regex (cognitive 21) crates/app/src/queries/tasks.rs:40— moon_app::queries::tasks::load_with_regex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, 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.
moon_app::commands::migrate::v2::migrate_task_setting (cognitive 20) crates/app/src/commands/migrate/v2.rs:133— moon_app::commands::migrate::v2::migrate_task_setting has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::migrate::v2::migrate_tasks_config_files (cognitive 19) crates/app/src/commands/migrate/v2.rs:232— moon_app::commands::migrate::v2::migrate_tasks_config_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::upgrade::upgrade (cognitive 17) crates/app/src/commands/upgrade.rs:59— moon_app::commands::upgrade::upgrade has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::commands::migrate::v2::migrate_toolchain_config_file (cognitive 16) crates/app/src/commands/migrate/v2.rs:398— moon_app::commands::migrate::v2::migrate_toolchain_config_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_app::systems::startup::find_workspace_root (cognitive 16) crates/app/src/systems/startup.rs:32— moon_app::systems::startup::find_workspace_root has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 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.
moon_app::prompts::evaluate_prompts (cognitive 16) crates/app/src/prompts.rs:340— moon_app::prompts::evaluate_prompts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (13 lines × 2) crates/affected/src/affected_tracker.rs:197— crates/affected/src/affected_tracker.rs:197-209 | crates/affected/src/project_tracker.rs:31-43 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/project_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 82 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 (13 lines × 2) crates/affected/src/affected_tracker.rs:233— crates/affected/src/affected_tracker.rs:233-245 | crates/affected/src/project_tracker.rs:50-62 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/project_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 82 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 (13 lines × 2) crates/affected/src/affected_tracker.rs:550— crates/affected/src/affected_tracker.rs:550-562 | crates/affected/src/task_tracker.rs:96-108 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/task_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 126 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 (13 lines × 2) crates/app/src/commands/generate.rs:552— crates/app/src/commands/generate.rs:552-564 | crates/app/src/commands/generate.rs:656-668 — 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 (13 lines × 2) crates/app/src/commands/projects.rs:20— crates/app/src/commands/projects.rs:20-32 | crates/app/src/commands/tasks.rs: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.
Duplicated block (13 lines × 2) crates/cache-remote/src/http_remote_storage.rs:285— crates/cache-remote/src/http_remote_storage.rs:285-297 | crates/cache-remote/src/http_remote_storage.rs:331-343 — 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 (13 lines × 2) crates/config/src/shapes/input.rs:308— crates/config/src/shapes/input.rs:308-320 | crates/config/src/shapes/output.rs:102-114 — 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 (13 lines × 2) crates/config/src/patterns.rs:49— crates/config/src/patterns.rs:49-61 | crates/config/src/patterns.rs:72-84 — 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 (13 lines × 2) crates/task-expander/src/token_expander.rs:474— crates/task-expander/src/token_expander.rs:474-486 | crates/task-expander/src/token_expander.rs:514-526 — 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 (13 lines × 2) wasm/ext-task/src/lib.rs:19— wasm/ext-task/src/lib.rs:19-31 | wasm/tc-tier2/src/lib.rs:95-107 — before extracting anything, compare `wasm/ext-task/src/lib.rs` and `wasm/tc-tier2/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (13 lines × 2) crates/pdk/src/extension.rs:31— crates/pdk/src/extension.rs:31-43 | crates/pdk/src/toolchain.rs:33-45 — 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 (13 lines × 2) crates/pdk-test-utils/src/extension_wrapper.rs:81— crates/pdk-test-utils/src/extension_wrapper.rs:81-93 | crates/pdk-test-utils/src/toolchain_wrapper.rs:82-94 — before extracting anything, compare `crates/pdk-test-utils/src/extension_wrapper.rs` and `crates/pdk-test-utils/src/toolchain_wrapper.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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 (13 lines × 2) crates/pdk-test-utils/src/extension_wrapper.rs:101— crates/pdk-test-utils/src/extension_wrapper.rs:101-113 | crates/pdk-test-utils/src/toolchain_wrapper.rs:106-118 — before extracting anything, compare `crates/pdk-test-utils/src/extension_wrapper.rs` and `crates/pdk-test-utils/src/toolchain_wrapper.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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.
Off the main sequence: moon_daemon_utils — moon_daemon_utils: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: moon_feature_flags — moon_feature_flags: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
Off the main sequence: moon_env_var — moon_env_var: abstractness 0.00, instability 0.05, distance 0.95 — zone of pain — concrete and depended on by 18 project(s), so it's rigid to change.
Off the main sequence: moon_config — moon_config: abstractness 0.01, instability 0.04, distance 0.95 — zone of pain — concrete and depended on by 48 project(s), so it's rigid to change.
Off the main sequence: moon_env — moon_env: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Off the main sequence: moon_pdk_api — moon_pdk_api: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 20 project(s), so it's rigid to change.
Off the main sequence: moon_project — moon_project: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 20 project(s), so it's rigid to change.
Off the main sequence: moon_task — moon_task: abstractness 0.00, instability 0.18, distance 0.82 — zone of pain — concrete and depended on by 18 project(s), so it's rigid to change.
Off the main sequence: moon_cache_item — moon_cache_item: abstractness 0.00, instability 0.20, distance 0.80 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: moon_process — moon_process: abstractness 0.00, instability 0.20, distance 0.80 — zone of pain — concrete and depended on by 12 project(s), so it's rigid to change.
Off the main sequence: moon_blob — moon_blob: abstractness 0.00, instability 0.25, distance 0.75 — zone of pain — concrete and depended on by 6 project(s), so it's rigid to change.
Off the main sequence: moon_toolchain — moon_toolchain: abstractness 0.00, instability 0.25, distance 0.75 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
Off the main sequence: moon_config_loader — moon_config_loader: abstractness 0.00, instability 0.29, distance 0.71 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
D30 · Dependency Vulnerabilities· Medium CVE · ×12
Hotspot: crates/cli/src/shared.rs crates/cli/src/shared.rs:126— crates/cli/src/shared.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in moon_cli::shared::run_cli at line 126. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/cli/src/shared.rs`: 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: crates/task-builder/src/tasks_builder.rs crates/task-builder/src/tasks_builder.rs:284— crates/task-builder/src/tasks_builder.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in TasksBuilder::build_task at line 284. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/task-builder/src/tasks_builder.rs`: 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: crates/action-graph/src/action_graph_builder.rs crates/action-graph/src/action_graph_builder.rs:1037— crates/action-graph/src/action_graph_builder.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ActionGraphBuilder::internal_run_task at line 1037. 4 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/action-graph/src/action_graph_builder.rs`: 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: crates/config-loader/src/toolchains_config_ext.rs crates/config-loader/src/toolchains_config_ext.rs:12— crates/config-loader/src/toolchains_config_ext.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ToolchainsConfigExt::get_plugin_locator at line 12. 5 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/config-loader/src/toolchains_config_ext.rs`: 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: crates/task-runner/src/task_runner.rs crates/task-runner/src/task_runner.rs:206— crates/task-runner/src/task_runner.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TaskRunner::is_cached at line 206. 5 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/task-runner/src/task_runner.rs`: 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: crates/vcs/src/git/git_client.rs crates/vcs/src/git/git_client.rs:75— crates/vcs/src/git/git_client.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Git::load at line 75. 3 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/vcs/src/git/git_client.rs`: 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: crates/task-runner/src/output_hydrater.rs crates/task-runner/src/output_hydrater.rs:63— crates/task-runner/src/output_hydrater.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in OutputHydrater::hydrate at line 63. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/task-runner/src/output_hydrater.rs`: 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: crates/action-pipeline/src/action_pipeline.rs crates/action-pipeline/src/action_pipeline.rs:134— crates/action-pipeline/src/action_pipeline.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ActionPipeline::internal_run at line 134. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/action-pipeline/src/action_pipeline.rs`: 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: crates/app/src/commands/upgrade.rs crates/app/src/commands/upgrade.rs:59— crates/app/src/commands/upgrade.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in moon_app::commands::upgrade::upgrade at line 59. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/app/src/commands/upgrade.rs`: 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: crates/vcs/src/git/tree.rs crates/vcs/src/git/tree.rs:419— crates/vcs/src/git/tree.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GitTree::exec_status at line 419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-29 19:44:38 -07:00' --until='2026-09-27 19:44:38 -07:00' --full-history --no-merges -- crates/vcs/src/git/tree.rs`: 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.
ClassTooLong: ActionGraphBuilder crates/action-graph/src/action_graph_builder.rs:127— ClassTooLong — 937 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 45 methods, 3 blocks, lines 127-1712. The bar is 400 significant lines; this is 537 over it, 2.34× 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: TasksBuilder crates/task-builder/src/tasks_builder.rs:97— ClassTooLong — 727 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 2 blocks, lines 97-1281. The bar is 400 significant lines; this is 327 over it, 1.82× 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: WorkspaceBuilder crates/workspace/src/workspace_builder.rs:78— ClassTooLong — 644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 2 blocks, lines 78-1192. The bar is 400 significant lines; this is 244 over it, 1.61× 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: TaskRunner crates/task-runner/src/task_runner.rs:32— ClassTooLong — 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 32-1001. The bar is 400 significant lines; this is 177 over it, 1.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: TokenExpander crates/task-expander/src/token_expander.rs:57— ClassTooLong — 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 24 methods, 2 blocks, lines 57-908. The bar is 400 significant lines; this is 173 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.
ClassTooLong: Git crates/vcs/src/git/git_client.rs:46— ClassTooLong — 451 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 6 methods, 3 blocks, lines 46-828. The bar is 400 significant lines; this is 51 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.
ClassTooLong: GrpcRemoteStorage crates/cache-remote/src/grpc_remote_storage.rs:49— ClassTooLong — 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 15 methods, 5 blocks, lines 49-763. The bar is 400 significant lines; this is 34 over it, 1.09× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ToolchainPlugin crates/toolchain-plugin/src/toolchain_plugin.rs:33— ClassTooLong — 432 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 33 methods, 5 blocks, lines 33-766. The bar is 400 significant lines; this is 32 over it, 1.08× 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: AffectedTracker crates/affected/src/affected_tracker.rs:18— ClassTooLong — 431 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 26 methods, 3 blocks, lines 18-701. The bar is 400 significant lines; this is 31 over it, 1.08× 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: WorkspaceProjectsBuilder crates/workspace/src/projects_builder.rs:213— ClassTooLong — 424 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 3 blocks, lines 213-931. The bar is 400 significant lines; this is 24 over it, 1.06× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TodoComment crates/action-graph/src/action_graph_builder.rs:211— // TODO switch to map_owned — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/action-pipeline/src/action_pipeline.rs:485— // TODO: Disabled for now as we've hit the posthog limit! — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/config/tests/task_config_test.rs:166— // TODO fix null handling in schematic — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/task-builder/tests/tasks_builder_test.rs:909— // TODO: temp disabled in the typescript plugin — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/token/src/funcs.rs:8— // TODO? changed_files, affected_files — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/workspace/src/tasks_builder.rs:34— // TODO deprecated — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/workspace/src/projects_builder.rs:73— // TODO deprecated — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/workspace/src/tasks_builder.rs:129— // TODO switch to filter_map_owned — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment crates/workspace/src/projects_builder.rs:396— // TODO switch to filter_map_owned — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (14 lines × 2) crates/app/src/commands/docker/file.rs:164— crates/app/src/commands/docker/file.rs:164-177 | crates/app/src/commands/docker/file.rs:217-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.
Duplicated block (14 lines × 2) crates/app/src/commands/extension/info.rs:119— crates/app/src/commands/extension/info.rs:119-132 | crates/app/src/commands/toolchain/info.rs:262-275 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) crates/config-loader/src/config_loader.rs:157— crates/config-loader/src/config_loader.rs:157-170 | crates/config-loader/src/config_loader.rs:270-283 — 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 (14 lines × 2) crates/project-graph/src/project_graph.rs:372— crates/project-graph/src/project_graph.rs:372-385 | crates/task-graph/src/task_graph.rs:120-133 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) crates/workspace/src/projects_builder.rs:546— crates/workspace/src/projects_builder.rs:546-559 | crates/workspace/src/workspace_builder.rs:739-752 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (14 lines × 2) crates/workspace/src/projects_builder.rs:568— crates/workspace/src/projects_builder.rs:568-581 | crates/workspace/src/workspace_builder.rs:762-775 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (14 lines × 2) crates/app/src/commands/extension/download.rs:16— crates/app/src/commands/extension/download.rs:16-29 | crates/app/src/commands/toolchain/download.rs:16-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) crates/cache-remote/src/grpc_remote_storage.rs:465— crates/cache-remote/src/grpc_remote_storage.rs:465-478 | crates/cache-remote/src/grpc_remote_storage.rs:558-571 — 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 (14 lines × 2) crates/cache-storage/src/storage_backend.rs:396— crates/cache-storage/src/storage_backend.rs:396-409 | crates/cache-storage/src/storage_backend.rs:442-455 — 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.
FileTooLong: src/action_graph_builder.rs crates/action-graph/src/action_graph_builder.rs— FileTooLong — 1028 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 91% of them inside a single declaration: ActionGraphBuilder (3 blocks, 127-1712). The bar is 500 significant lines; this is 528 over it, 2.06× 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: src/tasks_builder.rs crates/task-builder/src/tasks_builder.rs— FileTooLong — 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 90% of them inside a single declaration: TasksBuilder (2 blocks, 97-1281). The bar is 500 significant lines; this is 310 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: src/workspace_builder.rs crates/workspace/src/workspace_builder.rs— FileTooLong — 709 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 91% of them inside a single declaration: WorkspaceBuilder (2 blocks, 78-1192). The bar is 500 significant lines; this is 209 over it, 1.42× 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: src/token_expander.rs crates/task-expander/src/token_expander.rs— FileTooLong — 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 92% of them inside a single declaration: TokenExpander (2 blocks, 57-908). The bar is 500 significant lines; this is 120 over it, 1.24× 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: src/task_runner.rs crates/task-runner/src/task_runner.rs— FileTooLong — 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 95% of them inside a single declaration: TaskRunner (2 blocks, 32-1001). The bar is 500 significant lines; this is 105 over it, 1.21× 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: src/projects_builder.rs crates/workspace/src/projects_builder.rs— FileTooLong — 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 74% of them inside a single declaration: WorkspaceProjectsBuilder (3 blocks, 213-931). The bar is 500 significant lines; this is 70 over it, 1.14× 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: src/grpc_remote_storage.rs crates/cache-remote/src/grpc_remote_storage.rs— FileTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 77% of them inside a single declaration: GrpcRemoteStorage (5 blocks, 49-763). The bar is 500 significant lines; this is 61 over it, 1.12× 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: commands/generate.rs crates/app/src/commands/generate.rs— FileTooLong — 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 36 over it, 1.07× 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.
Duplicated block (11 lines × 2) crates/app-macros/src/lib.rs:111— crates/app-macros/src/lib.rs:111-121 | crates/app-macros/src/lib.rs:273-283 — 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 (11 lines × 2) crates/process/src/exec_command.rs:640— crates/process/src/exec_command.rs:640-650 | crates/process/src/exec_command.rs:771-781 — 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 (11 lines × 2) crates/process-augment/src/augmented_command.rs:255— crates/process-augment/src/augmented_command.rs:255-265 | crates/process-augment/src/augmented_command.rs:290-300 — 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 (11 lines × 2) crates/task-builder/src/tasks_builder.rs:741— crates/task-builder/src/tasks_builder.rs:741-751 | crates/task-builder/src/tasks_builder.rs:779-789 — 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 (11 lines × 2) crates/extension-plugin/src/extension_plugin.rs:89— crates/extension-plugin/src/extension_plugin.rs:89-99 | crates/toolchain-plugin/src/toolchain_plugin.rs:380-390 — before extracting anything, compare `crates/extension-plugin/src/extension_plugin.rs` and `crates/toolchain-plugin/src/toolchain_plugin.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (11 lines × 2) crates/extension-plugin/src/extension_plugin.rs:105— crates/extension-plugin/src/extension_plugin.rs:105-115 | crates/toolchain-plugin/src/toolchain_plugin.rs:396-406 — before extracting anything, compare `crates/extension-plugin/src/extension_plugin.rs` and `crates/toolchain-plugin/src/toolchain_plugin.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (11 lines × 2) crates/extension-plugin/src/extension_plugin.rs:162— crates/extension-plugin/src/extension_plugin.rs:162-172 | crates/toolchain-plugin/src/toolchain_plugin.rs:702-712 — before extracting anything, compare `crates/extension-plugin/src/extension_plugin.rs` and `crates/toolchain-plugin/src/toolchain_plugin.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (11 lines × 2) crates/extension-plugin/src/extension_plugin.rs:175— crates/extension-plugin/src/extension_plugin.rs:175-185 | crates/toolchain-plugin/src/toolchain_plugin.rs:715-725 — before extracting anything, compare `crates/extension-plugin/src/extension_plugin.rs` and `crates/toolchain-plugin/src/toolchain_plugin.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
moon_app::commands::generate::parse_args_into_variables (cyclomatic 31) crates/app/src/commands/generate.rs:326— moon_app::commands::generate::parse_args_into_variables has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
moon_app::commands::generate::gather_variables (cyclomatic 31) crates/app/src/commands/generate.rs:528— moon_app::commands::generate::gather_variables has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
moon_app::queries::projects::load_with_regex (cyclomatic 19) crates/app/src/queries/projects.rs:38— moon_app::queries::projects::load_with_regex 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.
moon_app::commands::generate::generate (cyclomatic 17) crates/app/src/commands/generate.rs:53— moon_app::commands::generate::generate 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.
moon_app::queries::tasks::load_with_regex (cyclomatic 16) crates/app/src/queries/tasks.rs:40— moon_app::queries::tasks::load_with_regex has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
moon_app::commands::docker::file::file (cyclomatic 16) crates/app/src/commands/docker/file.rs:54— moon_app::commands::docker::file::file 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.
moon_app::commands::upgrade::upgrade (cyclomatic 16) crates/app/src/commands/upgrade.rs:59— moon_app::commands::upgrade::upgrade has cyclomatic complexity 16 (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.
Duplicated block (9 lines × 2) crates/affected/src/affected_tracker.rs:248— crates/affected/src/affected_tracker.rs:248-256 | crates/affected/src/project_tracker.rs:65-73 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/project_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 82 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) crates/app/src/commands/extension/add.rs:43— crates/app/src/commands/extension/add.rs:43-51 | crates/app/src/commands/toolchain/add.rs:43-51 — 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) crates/app/src/commands/query/projects.rs:87— crates/app/src/commands/query/projects.rs:87-95 | crates/app/src/commands/query/tasks.rs:84-92 — 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 (9 lines × 2) crates/cache-remote/src/grpc_remote_storage.rs:451— crates/cache-remote/src/grpc_remote_storage.rs:451-459 | crates/cache-remote/src/grpc_remote_storage.rs:544-552 — 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 (9 lines × 2) crates/pdk/src/extension.rs:17— crates/pdk/src/extension.rs:17-25 | crates/pdk/src/toolchain.rs:19-27 — 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 (9 lines × 2) crates/project-graph/src/project_graph.rs:143— crates/project-graph/src/project_graph.rs:143-151 | crates/task-graph/src/task_graph.rs:75-83 — 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) crates/config/src/shapes/input.rs:109— crates/config/src/shapes/input.rs:109-117 | crates/config/src/shapes/input.rs:193-201 — 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.
ActionGraphBuilder::run_tasks (cognitive 37) crates/action-graph/src/action_graph_builder.rs:600— ActionGraphBuilder::run_tasks has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionGraphBuilder::internal_resolve_tasks_from_target_locator (cognitive 31) crates/action-graph/src/action_graph_builder.rs:930— ActionGraphBuilder::internal_resolve_tasks_from_target_locator has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). 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.
ActionGraphBuilder::internal_run_task (cognitive 27) crates/action-graph/src/action_graph_builder.rs:1037— ActionGraphBuilder::internal_run_task has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ActionGraphBuilder::internal_resolve_tasks_from_target (cognitive 26) crates/action-graph/src/action_graph_builder.rs:834— ActionGraphBuilder::internal_resolve_tasks_from_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionGraphBuilder::internal_setup_toolchain (cognitive 23) crates/action-graph/src/action_graph_builder.rs:1327— ActionGraphBuilder::internal_setup_toolchain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 1 (2 pts), match/switch 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.
ActionGraphBuilder::internal_setup_environment (cognitive 21) crates/action-graph/src/action_graph_builder.rs:1186— ActionGraphBuilder::internal_setup_environment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (2 pts), match/switch 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.
Duplicated block (12 lines × 2) crates/app/src/queries/projects.rs:130— crates/app/src/queries/projects.rs:130-141 | crates/app/src/queries/tasks.rs:110-121 — 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 (12 lines × 2) crates/cas/src/gc.rs:61— crates/cas/src/gc.rs:61-72 | crates/cas/src/gc.rs:169-180 — 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 (12 lines × 2) crates/task-hasher/src/task_hashing.rs:284— crates/task-hasher/src/task_hashing.rs:284-295 | crates/task-hasher/src/task_hashing.rs:302-313 — 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 (12 lines × 2) crates/task-runner/src/check_executor.rs:75— crates/task-runner/src/check_executor.rs:75-86 | crates/task-runner/src/task_executor.rs:159-170 — 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 (12 lines × 2) crates/config/src/shapes/output.rs:36— crates/config/src/shapes/output.rs:36-47 | crates/config/src/shapes/output.rs:74-85 — 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 (12 lines × 2) crates/pdk-test-utils/src/sandbox.rs:75— crates/pdk-test-utils/src/sandbox.rs:75-86 | crates/pdk-test-utils/src/sandbox.rs:116-127 — 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.
TasksBuilder::build_task (cognitive 78) crates/task-builder/src/tasks_builder.rs:284— TasksBuilder::build_task has cognitive complexity 78 (threshold 15). Drivers by points: if/else 46 (68 pts), boolean chains 6, loops 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TasksBuilder::parse_command_line (cognitive 77) crates/task-builder/src/tasks_builder.rs:1002— TasksBuilder::parse_command_line has cognitive complexity 77 (threshold 15). Drivers by points: if/else 16 (45 pts), loops 4 (18 pts), match/switch 4 (11 pts), boolean chains 3 (nesting depth added 50). 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.
TasksBuilder::build_task_options (cognitive 48) crates/task-builder/src/tasks_builder.rs:615— TasksBuilder::build_task_options has cognitive complexity 48 (threshold 15). Drivers by points: if/else 34 (44 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). 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.
TasksBuilder::inherit_global_tasks (cognitive 26) crates/task-builder/src/tasks_builder.rs:144— TasksBuilder::inherit_global_tasks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TasksBuilder::resolve_task_inputs (cognitive 23) crates/task-builder/src/tasks_builder.rs:841— TasksBuilder::resolve_task_inputs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×5
Duplicated block (15 lines × 2) crates/cache-remote/src/grpc_remote_storage.rs:225— crates/cache-remote/src/grpc_remote_storage.rs:225-239 | crates/cache-remote/src/http_remote_storage.rs:112-126 — 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 (15 lines × 2) wasm/ext-task/src/lib.rs:34— wasm/ext-task/src/lib.rs:34-48 | wasm/tc-tier2/src/lib.rs:110-124 — before extracting anything, compare `wasm/ext-task/src/lib.rs` and `wasm/tc-tier2/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (15 lines × 2) crates/task-runner/src/check_executor.rs:138— crates/task-runner/src/check_executor.rs:138-152 | crates/task-runner/src/task_executor.rs:275-289 — 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 (15 lines × 2) crates/app/src/commands/extension/add.rs:53— crates/app/src/commands/extension/add.rs:53-67 | crates/app/src/commands/toolchain/add.rs:53-67 — 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 (15 lines × 2) crates/pdk-test-utils/src/toolchain_wrapper.rs:76— crates/pdk-test-utils/src/toolchain_wrapper.rs:76-90 | crates/pdk-test-utils/src/toolchain_wrapper.rs:100-114 — 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.
TaskRunner::hydrate (cognitive 24) crates/task-runner/src/task_runner.rs:800— TaskRunner::hydrate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskRunner::hash_checks (cognitive 23) crates/task-runner/src/task_runner.rs:441— TaskRunner::hash_checks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskRunner::is_cached (cognitive 19) crates/task-runner/src/task_runner.rs:206— TaskRunner::is_cached has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
TaskRunner::execute_checks (cognitive 16) crates/task-runner/src/task_runner.rs:617— TaskRunner::execute_checks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MethodTooLong: TasksBuilder.build_task crates/task-builder/src/tasks_builder.rs:284— MethodTooLong — build_task runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99× 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.
MethodTooLong: TokenExpander.replace_function crates/task-expander/src/token_expander.rs:407— MethodTooLong — replace_function runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TaskExecutor.execute crates/task-runner/src/task_executor.rs:69— MethodTooLong — execute runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TasksBuilder.build_task_options crates/task-builder/src/tasks_builder.rs:615— MethodTooLong — build_task_options runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.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.
TooManyMethods: Command crates/process/src/command.rs:139— TooManyMethods — 53 methods, declared across 2 files: src/command.rs (40), src/exec_command.rs (13). The bar is 30 methods; this is 23 over it, 1.77× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: ActionGraphBuilder crates/action-graph/src/action_graph_builder.rs:127— TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× 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: Operation crates/action/src/operation.rs:14— TooManyMethods — 37 methods, declared across 2 files: src/operation.rs (32), src/context.rs (5). The bar is 30 methods; this is 7 over it, 1.23× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: ToolchainPlugin crates/toolchain-plugin/src/toolchain_plugin.rs:33— 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.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×4
Duplicated block (8 lines × 2) crates/affected/src/affected_tracker.rs:565— crates/affected/src/affected_tracker.rs:565-572 | crates/affected/src/task_tracker.rs:111-118 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/task_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 126 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) crates/plugin/src/host.rs:149— crates/plugin/src/host.rs:149-156 | crates/plugin/src/host.rs:236-243 — 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) crates/config-schema/src/typescript_types.rs:173— crates/config-schema/src/typescript_types.rs:173-180 | crates/config-schema/src/typescript_types.rs:190-197 — 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) crates/action/src/action.rs:105— crates/action/src/action.rs:105-112 | crates/action/src/operation.rs:127-134 — 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 (7 lines × 2) crates/actions/src/utils.rs:59— crates/actions/src/utils.rs:59-65 | crates/actions/src/utils.rs:82-88 — 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) crates/workspace/src/projects_builder.rs:677— crates/workspace/src/projects_builder.rs:677-683 | crates/workspace/src/workspace_builder.rs:890-896 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (7 lines × 2) crates/config/src/project/overrides_config.rs:59— crates/config/src/project/overrides_config.rs:59-65 | crates/config/src/toolchains_config.rs:116-122 — 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) crates/config-schema/src/json_schemas.rs:39— crates/config-schema/src/json_schemas.rs:39-45 | crates/config-schema/src/json_schemas.rs:98-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Low cohesion: ToolchainRegistry (LCOM4 17) crates/toolchain-plugin/src/toolchain_registry.rs:70— ToolchainRegistry's methods fall into 17 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 17 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: ExtensionRegistry (LCOM4 6) crates/extension-plugin/src/extension_registry.rs:64— ExtensionRegistry's methods fall into 6 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 6 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: MoonSession (LCOM4 5) crates/app/src/session.rs:45— MoonSession'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: MoonSandbox (LCOM4 4) crates/test-utils/src/sandbox.rs:15— MoonSandbox'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.
TasksBuilder::build_task (cyclomatic 51) crates/task-builder/src/tasks_builder.rs:284— TasksBuilder::build_task has cyclomatic complexity 51 (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.
TasksBuilder::build_task_options (cyclomatic 37) crates/task-builder/src/tasks_builder.rs:615— TasksBuilder::build_task_options has cyclomatic complexity 37 (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.
TasksBuilder::parse_command_line (cyclomatic 28) crates/task-builder/src/tasks_builder.rs:1002— TasksBuilder::parse_command_line has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MoonReporter::print_operation_output (cognitive 20) crates/console/src/reporter.rs:300— MoonReporter::print_operation_output has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 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.
MoonReporter::print_pipeline_stats (cognitive 20) crates/console/src/reporter.rs:404— MoonReporter::print_pipeline_stats has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
MoonReporter::print_task_checkpoint (cognitive 17) crates/console/src/reporter.rs:238— MoonReporter::print_task_checkpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×3
Duplicated block (6 lines × 2) crates/workspace/src/tasks_builder.rs:144— crates/workspace/src/tasks_builder.rs:144-149 | crates/workspace/src/workspace_builder.rs:342-347 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) crates/project-graph/src/project_graph.rs:523— crates/project-graph/src/project_graph.rs:523-528 | crates/task-graph/src/task_graph.rs:193-198 — 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 (6 lines × 2) crates/pdk-test-utils/src/extension_wrapper.rs:13— crates/pdk-test-utils/src/extension_wrapper.rs:13-18 | crates/pdk-test-utils/src/toolchain_wrapper.rs:17-22 — before extracting anything, compare `crates/pdk-test-utils/src/extension_wrapper.rs` and `crates/pdk-test-utils/src/toolchain_wrapper.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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.
Outbound HTTP without resilience crates/api/src/launchpad.rs:214— `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. 3 of the 3 files that make outbound calls are unbounded; the first 3 are listed.
Outbound HTTP without resilience crates/cache-remote/src/http_remote_storage.rs:52— `Client::builder()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience crates/notifier/src/webhooks.rs:35— `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
WorkspaceGraph::does_project_match_criteria (cyclomatic 22) crates/workspace-graph/src/query_projects.rs:74— WorkspaceGraph::does_project_match_criteria 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.
WorkspaceGraph::does_task_match_criteria (cyclomatic 16) crates/workspace-graph/src/query_tasks.rs:84— WorkspaceGraph::does_task_match_criteria has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ActionGraphBuilder::internal_run_task (cyclomatic 20) crates/action-graph/src/action_graph_builder.rs:1037— ActionGraphBuilder::internal_run_task has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActionGraphBuilder::run_tasks (cyclomatic 19) crates/action-graph/src/action_graph_builder.rs:600— ActionGraphBuilder::run_tasks 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.
moon_actions::actions::install_dependencies::install_dependencies (cyclomatic 18) crates/actions/src/actions/install_dependencies.rs:38— moon_actions::actions::install_dependencies::install_dependencies has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
moon_actions::plugins::commands::gather_cache_inputs (cyclomatic 16) crates/actions/src/plugins/commands.rs:278— moon_actions::plugins::commands::gather_cache_inputs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Git::load (cognitive 34) crates/vcs/src/git/git_client.rs:75— Git::load has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Git::get_changed_files_between_revisions (cognitive 18) crates/vcs/src/git/git_client.rs:562— Git::get_changed_files_between_revisions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_daemon_server::daemon_watcher::start_file_watcher (cognitive 33) crates/daemon-server/src/daemon_watcher.rs:92— moon_daemon_server::daemon_watcher::start_file_watcher has cognitive complexity 33 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 4 (14 pts), match/switch 2 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_daemon_server::daemon_watcher::start_file_listener (cognitive 18) crates/daemon-server/src/daemon_watcher.rs:168— moon_daemon_server::daemon_watcher::start_file_listener has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_actions::plugins::commands::gather_cache_inputs (cognitive 31) crates/actions/src/plugins/commands.rs:278— moon_actions::plugins::commands::gather_cache_inputs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_actions::actions::install_dependencies::install_dependencies (cognitive 20) crates/actions/src/actions/install_dependencies.rs:38— moon_actions::actions::install_dependencies::install_dependencies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CommandBuilder::inherit_affected (cognitive 31) crates/task-runner/src/command_builder.rs:337— CommandBuilder::inherit_affected has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (30 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.
CommandBuilder::inject_env (cognitive 23) crates/task-runner/src/command_builder.rs:148— CommandBuilder::inject_env has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 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.
WorkspaceGraph::does_project_match_criteria (cognitive 29) crates/workspace-graph/src/query_projects.rs:74— WorkspaceGraph::does_project_match_criteria has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorkspaceGraph::does_task_match_criteria (cognitive 27) crates/workspace-graph/src/query_tasks.rs:84— WorkspaceGraph::does_task_match_criteria has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskHasher::aggregate_inputs (cognitive 25) crates/task-hasher/src/task_hasher.rs:93— TaskHasher::aggregate_inputs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskHasher::process_inputs (cognitive 24) crates/task-hasher/src/task_hasher.rs:203— TaskHasher::process_inputs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, match/switch 1 (4 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExecWorkflow::execute (cognitive 22) crates/app/src/commands/exec.rs:210— ExecWorkflow::execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExecWorkflow::load_changed_files (cognitive 19) crates/app/src/commands/exec.rs:328— ExecWorkflow::load_changed_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorkspaceBuilder::internal_load_project (cognitive 22) crates/workspace/src/workspace_builder.rs:411— WorkspaceBuilder::internal_load_project has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorkspaceBuilder::load_project_build_data (cognitive 16) crates/workspace/src/workspace_builder.rs:916— WorkspaceBuilder::load_project_build_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D22 · Internal API Consistency· Duplicate intent · ×2
Duplicate intent: Two methods appear to check for the same CI environment condition. 'is_ci' is likely the standard accessor, while 'is_ci_env' is redundant or a legacy alias. — Remove 'is_ci_env' and keep 'is_ci'. If 'is_ci_env' checks a specific environment variable while 'is_ci' checks a broader context, rename 'is_ci' to 'is_ci_context' or similar to clarify the distinction. (signatures: env.is_ci(): bool | env.is_ci_env(): bool)
Duplicate intent: Both methods take a path and return a String, implying they perform the same normalization of path separators. The names 'normalize' and 'standardize' are semantically identical in this context. — Keep one method (e.g., 'normalize_separators') and remove the other. If they differ in implementation (e.g., one handles OS-specific logic and the other doesn't), rename them to reflect that difference (e.g., 'normalize_separators' vs 'force_unix_separators'). (signatures: path.normalize_separators(path: T): String | path.standardize_separators(path: T): String)
D22 · Internal API Consistency· Inconsistent return types and error handling · ×2
Inconsistent return types and error handling: 'locate_root' returns a VirtualPath directly (implying it never fails or panics on failure), while 'locate_root_with_check' returns AnyResult. This inconsistency in error handling strategy for similar operations is confusing. — Align error handling. Either both should return Result<VirtualPath, Error> or both should return VirtualPath (with the 'with_check' version panicking on invalid check results). Prefer Result for explicit error handling. (signatures: toolchain.locate_root(starting_dir: VirtualPath, file_name: str): VirtualPath | toolchain.locate_root_with_check(starting_dir: VirtualPath, file_name: str, check: impl FnMut(&VirtualPath) -> AnyResult<bool>): AnyResult)
Inconsistent return types and error handling: Same issue as 'locate_root' vs 'locate_root_with_check'. 'locate_root_many' returns VirtualPath directly, while the 'with_check' variant returns AnyResult. — Align error handling strategy as above. Prefer Result for explicit error handling. (signatures: toolchain.locate_root_many(starting_dir: VirtualPath, file_names: &[T]): VirtualPath | toolchain.locate_root_many_with_check(starting_dir: VirtualPath, file_names: &[T], check: impl FnMut(&VirtualPath) -> AnyResult<bool>): AnyResult)
Change coupling: check.rs ↔ run.rs crates/app/src/commands/check.rs— `crates/app/src/commands/check.rs` and `crates/app/src/commands/run.rs` change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `7c9e3a8d` breaking: Revamp CLI output. Add levels to `--summary`. (#2252); `9d5c681c` new: add environment variables for a few run arguments (#1977); `7865ed27` new: Update `moon dep-graph` to support task by path. (#1084) (at that commit the files were still `crates/cli/src/commands/check.rs` and `crates/cli/src/commands/run.rs`) — run `git show` on any of them.
Change coupling: output_archiver.rs ↔ output_hydrater.rs crates/task-runner/src/output_archiver.rs— `crates/task-runner/src/output_archiver.rs` and `crates/task-runner/src/output_hydrater.rs` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `ab3dc070` security: Harden remote cache output hydration against undeclared pat…; `ab039daf` docs: Add v1.41 blog post. (#2142); `05dcdc91` docs: Add v1.35 blog post. (#1923) — run `git show` on any of them.
Duplicated block (24 lines × 2) crates/action-graph/src/action_graph_builder.rs:1195— crates/action-graph/src/action_graph_builder.rs:1195-1218 | crates/action-graph/src/action_graph_builder.rs:1335-1358 — 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 (24 lines × 2) crates/workspace/src/workspace_builder.rs:267— crates/workspace/src/workspace_builder.rs:267-290 | crates/workspace/src/workspace_builder_async.rs:205-228 — 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 (18 lines × 2) crates/config-loader/src/extensions_config_ext.rs:69— crates/config-loader/src/extensions_config_ext.rs:69-86 | crates/config-loader/src/toolchains_config_ext.rs:157-174 — 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 (18 lines × 2) crates/mcp/src/tools/action_tools.rs:69— crates/mcp/src/tools/action_tools.rs:69-86 | crates/mcp/src/tools/action_tools.rs:136-153 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) crates/daemon-server/src/daemon_server.rs:126— crates/daemon-server/src/daemon_server.rs:126-141 | crates/daemon-server/src/daemon_server.rs:173-188 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) crates/workspace/src/projects_builder.rs:799— crates/workspace/src/projects_builder.rs:799-814 | crates/workspace/src/workspace_builder.rs:1086-1101 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (11 lines × 3) crates/task-expander/src/token_expander.rs:133— crates/task-expander/src/token_expander.rs:133-143 | crates/task-expander/src/token_expander.rs:180-190 | crates/task-expander/src/token_expander.rs:228-238 — 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.
Duplicated block (11 lines × 3) crates/pdk-test-utils/src/extension_wrapper.rs:79— crates/pdk-test-utils/src/extension_wrapper.rs:79-89 | crates/pdk-test-utils/src/extension_wrapper.rs:99-109 | crates/pdk-test-utils/src/toolchain_wrapper.rs:124-134 — before extracting anything, compare `crates/pdk-test-utils/src/extension_wrapper.rs` and `crates/pdk-test-utils/src/toolchain_wrapper.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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 (10 lines × 2) crates/action-graph/src/action_graph_builder.rs:1221— crates/action-graph/src/action_graph_builder.rs:1221-1230 | crates/action-graph/src/action_graph_builder.rs:1361-1371 — 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) crates/workspace/src/projects_builder.rs:750— crates/workspace/src/projects_builder.rs:750-759 | crates/workspace/src/workspace_builder.rs:973-982 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (47 lines × 2) crates/affected/src/affected_tracker.rs:263— crates/affected/src/affected_tracker.rs:263-309 | crates/affected/src/project_tracker.rs:80-126 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/project_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 82 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 (47 lines × 2) crates/affected/src/affected_tracker.rs:587— crates/affected/src/affected_tracker.rs:587-633 | crates/affected/src/task_tracker.rs:133-179 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/task_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 126 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.
Sync-over-async blocking packages/vscode-extension/src/commands.ts:111— `appendSchemasConfig` is async and calls existsSync, readFileSync, mkdirSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking packages/vscode-extension/src/projectsView.ts:464— `viewProject` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Dead file (~23 LoC) scenarios/signals/ctrlc.mjs— no import path from any entry point (7 application, 8 tooling, 11 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~23 LoC) scenarios/signals/signals.mjs— no import path from any entry point (7 application, 8 tooling, 11 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
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 5 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.
moon_cli::shared::run_cli (cyclomatic 56) crates/cli/src/shared.rs:126— moon_cli::shared::run_cli has cyclomatic complexity 56 (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.
TaskDepsBuilder::build (cyclomatic 22) crates/task-builder/src/task_deps_builder.rs:33— TaskDepsBuilder::build has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
MoonReporter::print_pipeline_stats (cyclomatic 19) crates/console/src/reporter.rs:404— MoonReporter::print_pipeline_stats has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TokenExpander::replace_function (cyclomatic 19) crates/task-expander/src/token_expander.rs:407— TokenExpander::replace_function has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: TokenExpander::replace_variable (cyclomatic 33) 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 function is counted neither in this dimension's figures nor in its score.
moon_query::builder::build_criteria (cyclomatic 18) crates/query/src/builder.rs:121— moon_query::builder::build_criteria has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
GitTree::exec_status (cyclomatic 18) crates/vcs/src/git/tree.rs:419— GitTree::exec_status has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ActionPipeline::internal_run (cyclomatic 17) crates/action-pipeline/src/action_pipeline.rs:134— ActionPipeline::internal_run 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.
TaskRunner::is_cached (cyclomatic 17) crates/task-runner/src/task_runner.rs:206— TaskRunner::is_cached has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ExecWorkflow::load_changed_files (cyclomatic 16) crates/app/src/commands/exec.rs:328— ExecWorkflow::load_changed_files has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
moon_workspace::projects_locator::locate_projects_with_globs (cyclomatic 16) crates/workspace/src/projects_locator.rs:43— moon_workspace::projects_locator::locate_projects_with_globs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ProjectCategoryItem.constructor (cyclomatic 16) packages/vscode-extension/src/projectsView.ts:178— ProjectCategoryItem.constructor has cyclomatic complexity 16 (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.
TaskDepsBuilder::build (cognitive 30) crates/task-builder/src/task_deps_builder.rs:33— TaskDepsBuilder::build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (8 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_workspace::projects_locator::locate_projects_with_globs (cognitive 26) crates/workspace/src/projects_locator.rs:43— moon_workspace::projects_locator::locate_projects_with_globs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Workspace.findRoot (cognitive 26) packages/vscode-extension/src/workspace.ts:98— Workspace.findRoot has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionPipeline::internal_run (cognitive 24) crates/action-pipeline/src/action_pipeline.rs:134— ActionPipeline::internal_run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AffectedTracker::is_task_affected (cognitive 24) crates/affected/src/affected_tracker.rs:467— AffectedTracker::is_task_affected has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), loops 2 (3 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.
TaskTracker::is_task_affected (cognitive 23) crates/affected/src/task_tracker.rs:34— TaskTracker::is_task_affected has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts), loops 2 (3 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.
OutputHydrater::hydrate (cognitive 23) crates/task-runner/src/output_hydrater.rs:63— OutputHydrater::hydrate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
CodeownersGenerator::add_project_entry (cognitive 22) crates/codeowners/src/codeowners_generator.rs:40— CodeownersGenerator::add_project_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileGroup::walk_absolute (cognitive 22) crates/file-group/src/file_group.rs:169— FileGroup::walk_absolute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (3 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.
moon_cli::shared::run_cli (cognitive 22) crates/cli/src/shared.rs:126— moon_cli::shared::run_cli has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 4, boolean chains 1 (nesting depth added 8). 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.
Command::create_sync_command (cognitive 21) crates/process/src/exec_command.rs:435— Command::create_sync_command has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 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.
moon_cas::gc::gc (cognitive 20) crates/cas/src/gc.rs:14— moon_cas::gc::gc has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TemplateLocator::from_str (cognitive 20) crates/config/src/template/template_locator.rs:66— TemplateLocator::from_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorkspaceTasksQuerent::query_tasks (cognitive 20) crates/workspace/src/tasks_querent.rs:89— WorkspaceTasksQuerent::query_tasks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_async_utils::run_pooled_tasks (cognitive 20) crates/async-utils/src/lib.rs:5— moon_async_utils::run_pooled_tasks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
JobDispatcher::next (cognitive 19) crates/action-pipeline/src/job_dispatcher.rs:81— JobDispatcher::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Estimate::calculate (cognitive 19) crates/action-pipeline/src/reports/estimate.rs:45— Estimate::calculate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MoonSession::get_cache_engine (cognitive 19) crates/app/src/session.rs:198— MoonSession::get_cache_engine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
moon_cache_local::local_storage::evict_manifests (cognitive 19) crates/cache-local/src/local_storage.rs:237— moon_cache_local::local_storage::evict_manifests has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HttpRemoteStorage::retrieve_blobs (cognitive 19) crates/cache-remote/src/http_remote_storage.rs:244— HttpRemoteStorage::retrieve_blobs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
moon_config::shapes::portable_path::is_glob_like (cognitive 19) crates/config/src/shapes/portable_path.rs:11— moon_config::shapes::portable_path::is_glob_like has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GenerateTool::call_tool (cognitive 19) crates/mcp/src/tools/codegen_tools.rs:87— GenerateTool::call_tool has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProjectGraph::internal_search (cognitive 19) crates/project-graph/src/project_graph.rs:458— ProjectGraph::internal_search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
AugmentedCommand::inherit_from_toolchains (cognitive 18) crates/process-augment/src/augmented_command.rs:323— AugmentedCommand::inherit_from_toolchains has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskExecutor::execute (cognitive 18) crates/task-runner/src/task_executor.rs:69— TaskExecutor::execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 8). Of this number, 16 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.
PruneWorkflow::gather_workspaces (cognitive 17) crates/app/src/commands/docker/prune.rs:46— PruneWorkflow::gather_workspaces has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CodeGenerator::resolve_template_locations (cognitive 17) crates/codegen/src/codegen.rs:198— CodeGenerator::resolve_template_locations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), match/switch 1 (2 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.
moon_graph_utils::graph_traits::traverse_deep (cognitive 17) crates/graph-utils/src/graph_traits.rs:14— moon_graph_utils::graph_traits::traverse_deep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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.
GrpcRemoteStorage::store_blobs (cognitive 16) crates/cache-remote/src/grpc_remote_storage.rs:492— GrpcRemoteStorage::store_blobs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, match/switch 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.
moon_process::exec_command::spawn_stream_capture_bytes (cognitive 16) crates/process/src/exec_command.rs:664— moon_process::exec_command::spawn_stream_capture_bytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 2 (5 pts), match/switch 2 (5 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.
TokenExpander::expand_inputs (cognitive 16) crates/task-expander/src/token_expander.rs:256— TokenExpander::expand_inputs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), match/switch 1 (2 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.
D22 · Internal API Consistency· Confusing naming convention · ×1
Confusing naming convention: 'new' and 'new_full' suggest a constructor pattern, but 'new_full' implies 'new' is incomplete or defaulting. In Rust, 'new' is the standard constructor. Using 'new_full' for a second constructor is non-idiomatic and confusing. — Rename 'new_full' to a descriptive name like 'new_with_defaults' or 'new_complete', or ensure 'new' is the primary constructor and 'new_full' is removed if it offers no distinct value. (signatures: SettingPrompt.new(setting: impl AsRef<str>, question: impl AsRef<str>, ty: PromptType): Self | SettingPrompt.new_full(setting: impl AsRef<str>, question: impl AsRef<str>, ty: PromptType): Self)
TooManyFields: TaskOptions crates/task/src/task_options.rs:19— TooManyFields — 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) wasm/ext-task/src/lib.rs:18— wasm/ext-task/src/lib.rs:18-60 | wasm/ext-task/src/lib.rs:65-87 | wasm/tc-tier2/src/lib.rs:94-132 | wasm/tc-tier2/src/lib.rs:137-159 — 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.
Duplicated block (58 lines × 2) crates/affected/src/affected_tracker.rs:473— crates/affected/src/affected_tracker.rs:473-530 | crates/affected/src/task_tracker.rs:36-93 — before extracting anything, compare `crates/affected/src/affected_tracker.rs` and `crates/affected/src/task_tracker.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 126 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 (44 lines × 2) crates/workspace/src/projects_builder.rs:628— crates/workspace/src/projects_builder.rs:628-671 | crates/workspace/src/workspace_builder.rs:841-884 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (32–37 lines × 2) crates/process/src/exec_command.rs:246— crates/process/src/exec_command.rs:246-282 | crates/process/src/exec_command.rs:359-390 — 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 (29–32 lines × 2) crates/cache-storage/src/storage_backend.rs:202— crates/cache-storage/src/storage_backend.rs:202-230 | crates/cache-storage/src/storage_backend.rs:291-322 — 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 (27 lines × 2) crates/process/src/exec_command.rs:291— crates/process/src/exec_command.rs:291-317 | crates/process/src/exec_command.rs:399-425 — 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 (26–27 lines × 2) crates/workspace/src/projects_builder.rs:394— crates/workspace/src/projects_builder.rs:394-420 | crates/workspace/src/workspace_builder.rs:296-321 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (25 lines × 2) crates/app-macros/src/lib.rs:166— crates/app-macros/src/lib.rs:166-190 | crates/app-macros/src/lib.rs:223-247 — 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 (23 lines × 2) crates/app/src/commands/docker/file.rs:179— crates/app/src/commands/docker/file.rs:179-201 | crates/app/src/commands/docker/file.rs:232-254 — 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 (22 lines × 2) wasm/ext-task/src/lib.rs:66— wasm/ext-task/src/lib.rs:66-87 | wasm/tc-tier2/src/lib.rs:138-159 — before extracting anything, compare `wasm/ext-task/src/lib.rs` and `wasm/tc-tier2/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (18–21 lines × 2) crates/app/src/commands/project_graph.rs:44— crates/app/src/commands/project_graph.rs:44-64 | crates/app/src/commands/task_graph.rs:44-61 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (20 lines × 2) crates/workspace/src/projects_builder.rs:603— crates/workspace/src/projects_builder.rs:603-622 | crates/workspace/src/workspace_builder.rs:797-816 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 (16–19 lines × 2) crates/vcs/src/git/tree.rs:157— crates/vcs/src/git/tree.rs:157-172 | crates/vcs/src/git/tree.rs:433-451 — 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 (17 lines × 2) crates/workspace/src/workspace_builder.rs:176— crates/workspace/src/workspace_builder.rs:176-192 | crates/workspace/src/workspace_builder_async.rs:55-71 — 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 (13–14 lines × 3) crates/task-builder/src/tasks_builder.rs:678— crates/task-builder/src/tasks_builder.rs:678-690 | crates/task-builder/src/tasks_builder.rs:698-711 | crates/task-builder/src/tasks_builder.rs:745-757 — 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.
Duplicated block (13–14 lines × 2) crates/app/src/commands/generate.rs:89— crates/app/src/commands/generate.rs:89-102 | crates/app/src/commands/template.rs:31-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 (13 lines × 3) crates/app/src/commands/action_graph.rs:71— crates/app/src/commands/action_graph.rs:71-86 | crates/app/src/commands/project_graph.rs:51-66 | crates/app/src/commands/task_graph.rs:51-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (11 lines × 4) wasm/ext-task/src/lib.rs:37— wasm/ext-task/src/lib.rs:37-47 | wasm/ext-task/src/lib.rs:69-79 | wasm/tc-tier2/src/lib.rs:113-123 | wasm/tc-tier2/src/lib.rs:141-151 — before extracting anything, compare `wasm/ext-task/src/lib.rs` and `wasm/tc-tier2/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (10 lines × 4) crates/workspace/src/projects_builder.rs:398— crates/workspace/src/projects_builder.rs:398-407 | crates/workspace/src/tasks_builder.rs:131-140 | crates/workspace/src/workspace_builder.rs:299-308 | crates/workspace/src/workspace_builder.rs:329-338 — before extracting anything, compare `crates/workspace/src/projects_builder.rs` and `crates/workspace/src/workspace_builder.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 162 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 × 3) crates/app/src/commands/generate.rs:552— crates/app/src/commands/generate.rs:552-560 | crates/app/src/commands/generate.rs:656-664 | crates/app/src/commands/generate.rs:704-712 — 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.
Duplicated block (5 lines × 2) crates/app/src/session.rs:201— crates/app/src/session.rs:201-205 | crates/test-utils/src/workspace_mocker.rs:361-365 — 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· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) crates/pdk-test-utils/src/extension_wrapper.rs:78— crates/pdk-test-utils/src/extension_wrapper.rs:78-93 | crates/pdk-test-utils/src/extension_wrapper.rs:98-113 | crates/pdk-test-utils/src/toolchain_wrapper.rs:75-94 | crates/pdk-test-utils/src/toolchain_wrapper.rs:99-118 | crates/pdk-test-utils/src/toolchain_wrapper.rs:123-138 — These 5 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 5 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 5 times.
Unstable project tc_tier3 — tc_tier3 has instability 0.86 with 1 dependents.
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
Duplicated block (14 lines × 2 locations) packages/vscode-extension/src/projectsView.ts:166— packages/vscode-extension/src/projectsView.ts:166 · packages/vscode-extension/src/projectsView.ts:249 — all 2 copies are in the same file, and each CITED SPAN is a SPECIALISATION DECLARATION — a type whose `extends` clause names a base and whose body hands that base its own values through `super(…)`. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the `super(…)` call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row — there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base — a type argument, a service, an alias, a cache — the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2 locations) packages/vscode-extension/src/commands.ts:28— packages/vscode-extension/src/commands.ts:28 · packages/vscode-extension/src/commands.ts:61 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (9 lines × 2 locations) packages/vscode-extension/src/lastRunView.ts:21— packages/vscode-extension/src/lastRunView.ts:21 · packages/vscode-extension/src/projectsView.ts:312 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (8 lines × 2 locations) packages/vscode-extension/src/commands.ts:96— packages/vscode-extension/src/commands.ts:96 · packages/vscode-extension/src/commands.ts:108 — 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.
Complex function constructor (cyclomatic 16, cognitive 12) packages/vscode-extension/src/projectsView.ts:178— constructor has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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.
Complex function getActionType (cyclomatic 14, cognitive 13) packages/visualizer/src/helpers/render.ts:42— getActionType has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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.
Complex function findRoot (cyclomatic 13, cognitive 26) packages/vscode-extension/src/workspace.ts:98— findRoot has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function findMoonBin (cyclomatic 13, cognitive 13) packages/vscode-extension/src/workspace.ts:193— findMoonBin has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function getActionLabel (cyclomatic 13, cognitive 11) packages/visualizer/src/helpers/render.ts:11— getActionLabel has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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.
Complex function canShowTask (cyclomatic 12, cognitive 14) packages/vscode-extension/src/projectsView.ts:61— canShowTask has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R4 · Test Coverage· No test rig can mount a component in this workspace · ×1
No test rig can mount a component in this workspace vite.config.ts— vite.config.ts declares environment "node", and no package here declares a DOM implementation (jsdom / happy-dom), a component testing library or a browser runner — so none of the 2 unreached component module(s) can be tested as written, however the suite is authored: packages/visualizer/src/app.tsx, packages/visualizer/src/components/Graph.tsx. Add a DOM environment and a component testing library (for example jsdom + @testing-library, or the runner's browser mode), then test the components. Reported once because these files share one cause, not one omission each.
Dead file (~20 LoC) scenarios/deno-signals/main.ts— no import path from any entry point (7 application, 8 tooling, 11 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~10 LoC) scenarios/interactive/input.mjs— no import path from any entry point (7 application, 8 tooling, 11 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~6 LoC) scenarios/signals/exitCode.mjs— no import path from any entry point (7 application, 8 tooling, 11 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
SC1 · Supply-chain hygiene· Go module dependencies are not locked · ×1
Go module dependencies are not locked — There is a go.mod but no go.sum — module versions aren't pinned to a verified hash, so builds aren't reproducible (SSDF PW.4.4). Run `go mod tidy` and commit go.sum; keep `GOFLAGS=-mod=readonly` in CI so a build fails rather than silently resolving a new version. Advisory — never scored.
Documentation: contradicts the code docs/CHANGELOG_V0.md— The changelog v0 entry for 0.26.6 fixes a custom-project-language breakage, which the current root README does not address and cannot be verified against. Verify that the documented fix is still present in the codebase.
Documentation: contradicts the code docs/CHANGELOG_V1.md— The changelog v1 entry for 1.41.8 adds moonx as a binary, which the root README does not mention and cannot be verified against. Confirm that this change is reflected in the repository's documentation.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 83 project(s) overshoot their size bounds, lowering Project Cohesion to 9.8/10. The most over is `crates/app` (9896 LoC, 136 public types across 15 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.
D9 · Test Distribution· Inverted test pyramid · ×1
Inverted test pyramid — Only 6 % of tests are unit tests (160 unit vs 2694 integration, 0 BDD); a broader unit base gives faster, more localised feedback.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 40/43 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/config-schema`, `packages/cli`.
Silent fallback default on Err crates/time/src/lib.rs:17— `to_millis` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default in catch packages/vscode-extension/src/workspace.ts:261— `getMoonVersion` swallows every exception into `return '0.0.0'` — 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.
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.
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 1 file(s) — `website/docusaurus.config.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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.
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.
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.
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.
Run 01a0f33e-8e48-762c-9d42-fd339536e132 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 127 · Warnings: 416 · Recommendations: 19 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 30-09-2026 @ 16:55 UTC.
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.