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

facebook/relay

Measured 26 October 2026, 06:11 UTC, at code version e043fc8

Regression: 1 dimension fell since the last survey Code coverage: not measured

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

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

CAI score 51out of 100 At risk Down 2 since the last survey

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

Event Sourcing 100 Exemplary Architecture 89 Strong Performance 85 Strong Maturity 70 Strong Security and Compliance 64 Adequate Code Health 49 Weak Production Readiness 39 Weak

A large codebase: 140,482 lines of product code in 7 projects, tests not counted · Estimated rebuild effort: about 1.0 person-years · Weakest lens: Production Readiness, 39

Findings by how serious they are

100 critical 1097 serious 148 minor

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

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
26 October 2026, 06:11 UTC

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

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

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

75of 75 dimensions measured by tools.
1324of 1345 findings point to an exact file and line, so you can open each one in the code. The other 21 concern the repository as a whole, such as missing documentation.
75dimensions across 7 lenses, read from 140,482 lines of product code in 7 projects.
Chapters

Executive summary

facebook/relay is rated At risk because critical security findings are open, most of them in the build pipeline. Its score is held back in part because it has uses of packages that aren't listed. It scores 51 out of 100, which the At risk rating leaves unchanged.

Production Readiness, at 39, is the weakest lens and counts most in the score. The best first step for the work it takes is making the three tests that check nothing check their results, worth about 5 points. Tidying the declared packages would lift Production Readiness itself, worth about 6 points. Raising Production Readiness to 70 would lift the score to about 61.

Forty-four pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Thirty-seven known security holes in the packages the code depends on can be used by attackers, and five parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, updating the vulnerable packages and having someone learn the forgotten files would close these risks. Limiting each secret to its own step would fix the two secrets exposed to more of the pipeline than needed, and the pipeline step that runs a download without checking it needs each download checked against a known checksum first. The eight uses of packages that aren't listed need adding to the project's list of dependencies.

The product code is 140,482 lines, about €150,000 to rebuild.

Code Health 49 Weak, capped by Type Safety Architecture 89 Strong Maturity 70 Strong Production Readiness 39 Weak, capped by Dependency Hygiene, Security & performance tooling and Outbound HTTP resilience Security and Compliance 64 Adequate, capped by Static Analysis (SAST) and Dependency Vulnerabilities Event Sourcing 100 ★ Exemplary Performance 85 Strong

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

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

If Production Readiness rose from 39 to 70, the lowest score rated Strong, the score would rise from 51 to about 61.

Code composition: what the lines of code are
Product code 92%Tests 8%
New since the last survey: 107 findings

These 107 critical or serious findings weren't in the previous survey, on 12 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.

  • Cyclomatic Complexity · (anonymous) (cyclomatic 48) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js
  • Cyclomatic Complexity · ExecTimeS2CDataChecker.toChecks (cyclomatic 34) packages/relay-runtime/store/ExecTimeS2CDataChecker.js
  • Cyclomatic Complexity · RscResolverFieldTransform::open_rsc_field (cyclomatic 19) compiler/crates/relay-transforms/src/rsc_resolver_fields.rs
  • Cyclomatic Complexity · ArtifactGeneratedTypes::from_operation (cyclomatic 18) compiler/crates/relay-compiler/src/build_project/artifact_generated_types.rs
  • Cognitive Complexity · relay_transforms::server_documents::validate_server_documents (cognitive 27) compiler/crates/relay-transforms/src/server_documents.rs
  • Cognitive Complexity · ExecTimeS2CDataChecker.toChecks (cognitive 26) packages/relay-runtime/store/ExecTimeS2CDataChecker.js
  • Cognitive Complexity · dependency_analyzer::ir::get_reachable_ir (cognitive 25) compiler/crates/dependency-analyzer/src/ir.rs
  • Cognitive Complexity · GraphModeHandler._populateRecord (cognitive 19) packages/relay-runtime/store/RelayExperimentalGraphResponseHandler.js
  • Cognitive Complexity · RscResolverFieldTransform::open_rsc_field (cognitive 18) compiler/crates/relay-transforms/src/rsc_resolver_fields.rs
  • Cognitive Complexity · ClientProjection::project_selection_set (cognitive 17) compiler/crates/relay-transforms/src/client_normalization.rs
  • Cognitive Complexity · relay_typegen::visit::group_refs (cognitive 17) compiler/crates/relay-typegen/src/visit.rs
  • Cognitive Complexity · relay_docblock::docblock_ir::validate_fragment_arguments (cognitive 16) compiler/crates/relay-docblock/src/docblock_ir.rs
  • God Classes · MethodTooLong: RscResolverFieldTransform.open_rsc_field compiler/crates/relay-transforms/src/rsc_resolver_fields.rs
  • God Classes · FunctionTooLong: relay_typegen::write::write_rsc_resolver_signature_type_assertion compiler/crates/relay-typegen/src/write.rs
  • God Classes · FunctionTooLong: relay_transforms::apply_transforms::apply_common_transforms compiler/crates/relay-transforms/src/apply_transforms.rs
  • God Classes · ClassTooLong: ApplyFragmentArgumentsTransform compiler/crates/relay-transforms/src/apply_fragment_arguments.rs
  • God Classes · MethodTooLong: CodegenBuilder.build_fragment_metadata compiler/crates/relay-codegen/src/build_ast.rs
  • God Classes · FileTooLong: src/lib.rs compiler/crates/schema-validate/src/lib.rs
  • God Classes · FileTooLong: src/rsc_resolver_fields.rs compiler/crates/relay-transforms/src/rsc_resolver_fields.rs
  • God Classes · ClassTooLong: ValidationContext compiler/crates/schema-validate/src/lib.rs
  • God Classes · ClassTooLong: LSPState compiler/crates/relay-lsp/src/server/lsp_state.rs
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) compiler/crates/relay-compiler/src/artifact_content/content.rs
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) compiler/crates/relay-codegen/src/printer.rs
  • Code Duplication · Duplicated block (24–36 lines × 2) compiler/crates/relay-typegen/src/write.rs
  • Code Duplication · Duplicated block (23 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs
  • Code Duplication · Duplicated block (18 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs
  • Code Duplication · Duplicated block (17–18 lines × 2) compiler/crates/schema/src/in_memory.rs
  • Code Duplication · Duplicated block (15 lines × 2) compiler/crates/schema/src/in_memory.rs
  • Code Duplication · Duplicated block (12 lines × 2) compiler/crates/relay-transforms/src/server_documents.rs
  • Code Duplication · Duplicated block (10–12 lines × 2) compiler/crates/schema-diff/src/lib.rs
  • Code Duplication · Duplicated block (11 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs
  • Code Duplication · Duplicated block (9 lines × 2) compiler/crates/relay-transforms/src/inline_fragments.rs
  • Code Duplication · Duplicated block (7 lines × 2) compiler/crates/schema-set/src/set_merges.rs
  • Code Duplication · Duplicated block (5 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs
  • Code Duplication · Duplicated block (5 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs
  • Test Quality · Skipped test: suspends then updates when the query and component load packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js
  • Test Quality · Skipped test: warns if the entryPointReference has already been disposed packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js
  • Test Quality · Skipped test: suspends while the query and component are pending packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js
  • Test Quality · Skipped test: suspends while the component is loading packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js
  • Test Quality · Skipped test: suspends then updates when the query and component load packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js
  • Test Quality · Skipped test: re-renders and reloads when prefetch params change packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js
  • Test Quality · Skipped test: does not suspend if pagination update is interruped before it commits (unsuspends) packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-test.js
  • Test Quality · Skipped test: loads more items correctly after refetching packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-with-suspense-transition-test.js
  • Test Quality · Skipped test: should handle errors packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js
  • Test Quality · Skipped test: simple fetch packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js
  • Test Quality · Skipped test: log when switching queries packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js
  • Test Quality · Skipped test: releases and cancels all queries if a the callback is called, the component suspends, another query is called and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-live-query-test.js
  • Test Quality · Skipped test: releases and cancels all queries if the component suspends, another query is loaded and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-live-query-test.js
  • Test Quality · Skipped test: releases all queries if a the callback is called, the component suspends, another query is called and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-test.js
  • Test Quality · Skipped test: releases all queries if the component suspends, another query is loaded and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-test.js
  • Test Quality · Skipped test: renders with the results of the new variables on success packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js
  • Test Quality · Skipped test: paginates with the results of new refetch/overridden variables packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js
  • Test Quality · No assertions: loads where WeakMap is missing packages/relay-runtime/store/__tests__/DataChecker-ExecTimeS2C-test.js
  • Churn × Complexity Hotspots · Hotspot: compiler/crates/relay-codegen/src/build_ast.rs compiler/crates/relay-codegen/src/build_ast.rs
  • Churn × Complexity Hotspots · Hotspot: compiler/crates/relay-compiler/src/build_project.rs compiler/crates/relay-compiler/src/build_project.rs
  • Churn × Complexity Hotspots · Hotspot: compiler/crates/relay-schema-generation/src/lib.rs compiler/crates/relay-schema-generation/src/lib.rs
  • Dependency Vulnerabilities · REDACTED
  • Dependency Vulnerabilities · REDACTED
  • Knowledge Freshness · Orphaned knowledge compiler/crates/graphql-ir-diff/src/lib.rs
  • Knowledge Freshness · Orphaned knowledge compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs
  • Supply-chain Provenance & Signing · REDACTED
  • Platform End-of-Life · End-of-life runtime: Node.js 18 packages/eslint-plugin-relay-internal/package.json
  • Code Duplication · Wholesale file copy (266 identical lines × 2 files) REDACTED
  • Code Duplication · Wholesale file copy (221 identical lines × 2 files) REDACTED
  • Code Duplication · Duplicated block with local edits (60 matched lines × 2 locations) packages/relay-runtime/store/DataChecker.js
  • Import Boundaries · Boundary violation [package:relative-cross-package] REDACTED
  • Import Boundaries · Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js
  • Import Boundaries · Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/loadQuery.js
  • Import Boundaries · Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js
  • Import Boundaries · Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js
  • Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 34, cognitive 26) packages/relay-runtime/store/ExecTimeS2CDataChecker.js
  • Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 28, cognitive 28) packages/relay-runtime/store/DataChecker.js
  • Large Files · packages/relay-runtime/store/RelayStoreTypes.js: 1515 lines of code packages/relay-runtime/store/RelayStoreTypes.js
  • Large Files · flow-typed/npm/jest_v29.x.x.js: 1235 lines of code flow-typed/npm/jest_v29.x.x.js
  • Large Files · REDACTED: 1113 lines of code REDACTED
  • Large Files · packages/relay-runtime/store/live-resolvers/LiveResolverCache.js: 1012 lines of code packages/relay-runtime/store/live-resolvers/LiveResolverCache.js
  • Large Files · REDACTED: 876 lines of code REDACTED
  • Large Files · packages/relay-runtime/store/DataChecker.js: 645 lines of code packages/relay-runtime/store/DataChecker.js
  • Large Files · REDACTED: 579 lines of code REDACTED
  • Large Files · REDACTED: 454 lines of code REDACTED
  • Large Files · REDACTED: 453 lines of code REDACTED
  • Large Files · packages/relay-runtime/store/RelayModernFragmentSpecResolver.js: 442 lines of code packages/relay-runtime/store/RelayModernFragmentSpecResolver.js
  • Large Files · packages/relay-runtime/index.js: 441 lines of code packages/relay-runtime/index.js
  • Test Coverage · No test reaches this file flow-typed/npm/invariant_v2.x.x.js
  • Dead Code · Dead file (~1278 LoC) flow-typed/npm/jest_v29.x.x.js
  • Dead Code · Dead file (~488 LoC) REDACTED
  • Dead Code · Dead file (~23 LoC) flow-typed/npm/invariant_v2.x.x.js
  • Web-Security Posture · Weak hash algorithm compiler/crates/common/src/rollout.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/docblock-shared/src/resolver_source_hash.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-codegen/src/build_ast.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/build_project/artifact_writer.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/build_project/artifact_writer.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/build_project/artifact_writer.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/build_project/build_ir.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/build_project/persist_operations.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/config.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/config.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/config.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/operation_persister/local_persister.rs
  • Web-Security Posture · Weak hash algorithm compiler/crates/relay-compiler/src/operation_persister/local_persister.rs

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

Fixed since the last survey: 75 findings

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

  • Cyclomatic Complexity · (anonymous) (cyclomatic 46) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js
  • Cognitive Complexity · _populateRecord (cognitive 25) packages/relay-runtime/store/RelayExperimentalGraphResponseHandler.js
  • Code Duplication · Near-duplicate member pair (47 shared lines) compiler/crates/relay-transforms/src/apply_transforms.rs
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) compiler/crates/relay-compiler/src/artifact_content/content.rs
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) compiler/crates/relay-codegen/src/printer.rs
  • Code Duplication · Duplicated block (23 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs
  • Code Duplication · Duplicated block (19–20 lines × 2) compiler/crates/schema-diff/src/lib.rs
  • Code Duplication · Duplicated block (16–17 lines × 2) compiler/crates/schema/src/in_memory.rs
  • Code Duplication · Duplicated block (15 lines × 2) compiler/crates/schema/src/in_memory.rs
  • Code Duplication · Duplicated block (10–11 lines × 2) compiler/crates/schema-diff/src/lib.rs
  • Code Duplication · Duplicated block (9–11 lines × 2) compiler/crates/schema-validate/src/lib.rs
  • Code Duplication · Duplicated block (7 lines × 2) compiler/crates/schema-set/src/set_merges.rs
  • Code Duplication · Duplicated block (18 lines × 2) compiler/crates/relay-transforms/src/apply_transforms.rs
  • Code Duplication · Duplicated block (10 lines × 2) compiler/crates/graphql-syntax/src/node/type_system.rs
  • Static Analysis (SAST) · Medium: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · Medium CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · Medium vulnerability: [GHSA redacted] REDACTED
  • Supply-chain Provenance & Signing REDACTED
  • Code Duplication · Wholesale file copy (267 identical lines × 2 files) REDACTED
  • Code Duplication · Wholesale file copy (222 identical lines × 2 files) REDACTED
  • Code Duplication · Duplicated block with local edits (57 matched lines × 2 locations) packages/relay-runtime/store/DataChecker.js
  • Code Duplication · Duplicated block (17 lines × 2 locations) packages/relay-runtime/store/RelayModernFragmentSpecResolver.js
  • Code Duplication · Duplicated block with local edits (16 matched lines × 2 locations) packages/babel-plugin-relay/compileGraphQLTag.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block with local edits (16 matched lines × 2 locations) packages/react-relay/ReactRelayRefetchContainer.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) packages/relay-runtime/mutations/RelayRecordSourceMutator.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) packages/relay-runtime/query/GraphQLTag.js
  • Code Duplication · Duplicated block (16 lines × 3 locations) packages/relay-runtime/store/DataChecker.js
  • Code Duplication · Duplicated block with local edits (16 matched lines × 2 locations) packages/relay-runtime/store/DataChecker.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) packages/relay-runtime/store/hasOverlappingIDs.js
  • Code Duplication · Duplicated block (15 lines × 3 locations) packages/react-relay/relay-hooks/readFragmentInternal.js
  • Code Duplication · Duplicated block with local edits (15 matched lines × 2 locations) packages/relay-runtime/multi-actor-environment/ActorSpecificEnvironment.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) packages/relay-runtime/query/fetchQueryInternal.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) packages/relay-runtime/store/RelayModernRecord.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) packages/relay-runtime/mutations/RelayRecordSourceMutator.js
  • Code Duplication · Duplicated block with local edits (13 matched lines × 2 locations) packages/relay-runtime/mutations/RelayRecordSourceProxy.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) gulpfile.js
  • Code Duplication · Duplicated block (12 lines × 3 locations) packages/react-relay/relay-hooks/readFragmentInternal.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (12 lines × 2 locations) packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (11 lines × 3 locations) packages/react-relay/relay-hooks/legacy/FragmentResource.js
  • Code Duplication · Duplicated block with local edits (11 matched lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (10 lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (10 lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (10 lines × 2 locations) packages/relay-runtime/mutations/RelayRecordProxy.js
  • Code Duplication · Duplicated block with local edits (10 matched lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (9 lines × 2 locations) packages/relay-runtime/handlers/connection/ConnectionHandler.js
  • Code Duplication · Duplicated block (9 lines × 2 locations) packages/relay-runtime/handlers/connection/MutationHandlers.js
  • Code Duplication · Duplicated block (9 lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (9 lines × 2 locations) scripts/rewrite-modules.js
  • Code Duplication · Duplicated block (7 lines × 3 locations) REDACTED
  • Code Duplication · Duplicated block with local edits (6 matched lines × 2 locations) packages/relay-runtime/store/RelayRecordSource.js
  • Code Duplication · Duplicated block (5 lines × 2 locations) packages/relay-runtime/mutations/RelayRecordSourceMutator.js
  • Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 28, cognitive 25) packages/relay-runtime/store/DataChecker.js
  • Cyclomatic Complexity · Complex function update (cyclomatic 20, cognitive 31) packages/relay-runtime/store/RelayModernRecord.js
  • Large Files · packages/relay-runtime/store/RelayStoreTypes.js: 1510 lines of code packages/relay-runtime/store/RelayStoreTypes.js
  • Large Files · flow-typed/npm/jest_v29.x.x.js: 1239 lines of code flow-typed/npm/jest_v29.x.x.js
  • Large Files · REDACTED: 1104 lines of code REDACTED
  • Large Files · packages/relay-runtime/store/live-resolvers/LiveResolverCache.js: 1005 lines of code packages/relay-runtime/store/live-resolvers/LiveResolverCache.js
  • Large Files · REDACTED: 903 lines of code REDACTED
  • Large Files · packages/relay-runtime/store/DataChecker.js: 623 lines of code packages/relay-runtime/store/DataChecker.js
  • Large Files · REDACTED: 577 lines of code REDACTED
  • Large Files · REDACTED: 457 lines of code REDACTED
  • Large Files · REDACTED: 456 lines of code REDACTED
  • Large Files · packages/relay-runtime/store/RelayModernFragmentSpecResolver.js: 449 lines of code packages/relay-runtime/store/RelayModernFragmentSpecResolver.js
  • Large Files · packages/relay-runtime/index.js: 436 lines of code packages/relay-runtime/index.js
  • Test Coverage · No test reaches this file packages/react-relay/__flowtests__/RelayModernFlowtest_user.graphql.js
  • Test Coverage · No test reaches this file packages/react-relay/__flowtests__/RelayModernFlowtest_users.graphql.js
  • Test Coverage · No test reaches this file packages/relay-runtime/util/JSResourceTypes.flow.js
  • Test Coverage · No test reaches this file flow-typed/dev.js
  • Test Coverage · No test reaches this file packages/react-relay/multi-actor/index.js
  • Dead Code · Dead file (~1282 LoC) flow-typed/npm/jest_v29.x.x.js
  • Dead Code · Dead file (~491 LoC) REDACTED
Rebuild cost: about €150,000 · Estimate
Cost to rebuild€48,000 to €240,000, for 807 to 2,560 hours of work, about 1.0 person-years for 1 to 2 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 51. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 140,482 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 3 No assertions (empty test) finding(s) in Test Quality — start with LiveResolverSuspenseDisplayName-test.js, useBlockingPaginationFragment-with-suspense-transition-test.js, useRefetchableFragmentNode-with-suspense-transition-test.js.
Raises the score by about 5 points · Low effort · Test Quality
2
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
Raises the score by about 6 points · Medium effort · Dependency Hygiene
3
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Raises the score by about 4 points · Medium effort · Type Safety

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €150,000 to build again, about 1.0 person-years of work. Its weakest lens is Production Readiness, at 39 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 3 No assertions (empty test) finding(s) in Test Quality. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for low effort, because it clears the 3 Test Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture: which parts of the code depend on which

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

510 modules, with 1741 dependencies between them. 4 loops run through 88 of the modules, marked above the diagonal.

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 common.span2 graphql_ir.associated_data3 packages.relay-runtime.util.RelayRuntimeTypes4 common.feature_flags5 common.location6 graphql_ir.transform7 graphql_syntax.node.type_annotation8 packages.relay-runtime.store.RelayStoreTypes9 relay_config.project_name10 schema.definitions11 relay_transforms.match_.match_transform12 js_config_loader13 resolution_path14 graphql_syntax.node.constant_value15 graphql_syntax.node.document16 graphql_syntax.node.executable17 schema_set.schema_set18 graphql_syntax.node.constant_directive19 graphql_syntax.node.type_system20 schema.in_memory21 schema.schema22 graphql_ir.program23 relay_transforms.required_directive24 intern.string_key25 graphql_syntax.node.primitive26 common.named_item27 relay_config.project_config28 relay_compiler.compiler_state29 relay_docblock.ir30 relay_transforms.client_edges31 relay_compiler.build_project32 relay_transforms.relay_resolvers33 graphql_ir.ir34 common.diagnostic35 graphql_ir.validator36 graphql_ir.visitor37 relay_codegen.build_ast38 relay_compiler.config39 relay_schema_generation40 relay_lsp.server.lsp_state
1 common.span
2 graphql_ir.associated_data
3 packages.relay-runtime.util.RelayRuntimeTypes
4 common.feature_flags1
5 common.location2
6 graphql_ir.transform214
7 graphql_syntax.node.type_annotation483
8 packages.relay-runtime.store.RelayStoreTypes4
9 relay_config.project_name1
10 schema.definitions1011113204
11 relay_transforms.match_.match_transform13631262151
12 js_config_loader1
13 resolution_path1111
14 graphql_syntax.node.constant_value31615912
15 graphql_syntax.node.document22411
16 graphql_syntax.node.executable11312041207
17 schema_set.schema_set2201121919124
18 graphql_syntax.node.constant_directive11211311
19 graphql_syntax.node.type_system2182421218193331
20 schema.in_memory2117723121
21 schema.schema11551112
22 graphql_ir.program16
23 relay_transforms.required_directive1233341111
24 intern.string_key113
25 graphql_syntax.node.primitive3241
26 common.named_item81
27 relay_config.project_config1211321
28 relay_compiler.compiler_state21211
29 relay_docblock.ir13211473155369284
30 relay_transforms.client_edges244713232242
31 relay_compiler.build_project111112
32 relay_transforms.relay_resolvers31311113317
33 graphql_ir.ir17711417923
34 common.diagnostic31
35 graphql_ir.validator114
36 graphql_ir.visitor115
37 relay_codegen.build_ast4221223318
38 relay_compiler.config4241163
39 relay_schema_generation1191241
40 relay_lsp.server.lsp_state211222
Uses a module listed above itPart of a loopThe module itself
1 common.span2 graphql_ir.associated_data3 packages.relay-runtime.util.RelayRuntimeTypes4 common.feature_flags5 common.location6 graphql_ir.transform7 graphql_syntax.node.type_annotation8 packages.relay-runtime.store.RelayStoreTypes9 relay_config.project_name10 schema.definitions11 relay_transforms.match_.match_transform12 js_config_loader13 resolution_path14 graphql_syntax.node.constant_value15 graphql_syntax.node.document16 graphql_syntax.node.executable17 schema_set.schema_set18 graphql_syntax.node.constant_directive19 graphql_syntax.node.type_system20 schema.in_memory21 schema.schema22 graphql_ir.program23 relay_transforms.required_directive24 intern.string_key25 graphql_syntax.node.primitive26 common.named_item27 relay_config.project_config28 relay_compiler.compiler_state29 relay_docblock.ir30 relay_transforms.client_edges31 relay_compiler.build_project32 relay_transforms.relay_resolvers33 graphql_ir.ir34 common.diagnostic35 graphql_ir.validator36 graphql_ir.visitor37 relay_codegen.build_ast38 relay_compiler.config39 relay_schema_generation40 relay_lsp.server.lsp_statecommon.span1graphql_ir.associated_data2packages.relay-runtime.util.RelayRuntimeTypes3common.feature_flags4common.location5graphql_ir.transform6graphql_syntax.node.type_annotation7packages.relay-runtime.store.RelayStoreTypes8relay_config.project_name9schema.definitions10relay_transforms.match_.match_transform11js_config_loader12resolution_path13graphql_syntax.node.constant_value14graphql_syntax.node.document15graphql_syntax.node.executable16schema_set.schema_set17graphql_syntax.node.constant_directive18graphql_syntax.node.type_system19schema.in_memory20schema.schema21graphql_ir.program22relay_transforms.required_directive23intern.string_key24graphql_syntax.node.primitive25common.named_item26relay_config.project_config27relay_compiler.compiler_state28relay_docblock.ir29relay_transforms.client_edges30relay_compiler.build_project31relay_transforms.relay_resolvers32graphql_ir.ir33common.diagnostic34graphql_ir.validator35graphql_ir.visitor36relay_codegen.build_ast37relay_compiler.config38relay_schema_generation39relay_lsp.server.lsp_state40122144834110111132041363126215111111316159122241111312041207220112191912411211311218242121819333121177231211155111216123334111111332418112113212121113211473155369284244713232242111112313111133171771141792331114115422122331842411631191241211222+470 more modules (most-connected shown)

At a glance — Code Health · 49% · Weak · gated by R1 ·

The Good
D4 · Rust Code Duplication 9.2 D17 · Rust Explicit Debt 9.9 R10 · React / TS Code Duplication 9.3 R2 · React / TS Cyclomatic Complexity 8.0 R7 · React / TS Dead Code 9.2 X1 · Repo Async correctness 10.0 X12 · Repo Unreachable branch 10.0 X13 · Repo Undrained process stream 10.0 X16 · Repo Unfloored truncation loop 10.0 X18 · Repo Disposal-pattern correctness 10.0 X19 · Repo Unrestored process-global state 10.0 X21 · Repo Side-effecting pattern guard 10.0 X22 · Repo Contradicted release guard 10.0 X23 · Repo Unguarded diagnostic materialisation 10.0 X25 · Repo Inert configuration knob 10.0 X26 · Repo Unsynchronised callback handoff 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0 X29 · Repo Per-element action decided by a fixed element 10.0 X30 · Repo Support guard that admits what it rejects 10.0
The Bad
D1 · Rust Cyclomatic Complexity 6.4 D2 · Rust Cognitive Complexity 5.3 D3 · Rust God Classes 7.0 R3 · React / TS Large Files 5.1 X3 · Repo Exception handling 5.1
The Ugly
R1 · React / TS Type Safety 0.0

At a glance — Architecture · 89% · Strong ·

The Good
D6 · Rust Cohesion (LCOM4) 9.9 D35 · Rust Change Coupling 9.9 AX10 · Repo Code composition 9.9 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX8 · Repo Test isolation 10.0 AX9 · Repo CQS / query purity 10.0 R11 · React / TS Import Boundaries 8.2 R9 · React / TS Circular Imports 10.0
The Bad
D7 · Rust Architectural Integrity 6.0
The Ugly
D26 · Rust Project Cohesion 4.3

At a glance — Maturity · 70% · Strong ·

The Good
D15 · Rust Churn × Complexity Hotspots 9.8 D16 · Rust Bus Factor 9.2 D19 · Rust Documentation Quality 10.0 D20 · Rust ADR Quality 10.0 D34 · Rust Knowledge Freshness 7.7 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0
The Bad
M1 · Repo Documentation (README) 6.7
The Ugly
M2 · Repo Architecture documentation 4.0

At a glance — Readiness · 39% · Weak · gated by R8, P3, P7 ·

The Good
D9 · Rust Test Distribution 10.0 D10 · Rust Test Quality 9.7 D12 · Rust Dependency Hygiene 9.6 D13 · Rust Secret Scanning 10.0 D14 · Rust License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P10 · Repo Library API & versioning 10.0 P4 · Repo Deployment & Rollback 7.0 R4 · React / TS Test Coverage 8.1 R6 · React / TS Tooling 10.0
The Bad
P2 · Repo Observability 5.6 P6 · Repo Release Hygiene 5.0
The Ugly
P3 · Repo Security & performance tooling 3.0 P7 · Repo Outbound HTTP resilience 3.0 R8 · React / TS Dependency Hygiene 0.0

At a glance — Security · 64% · Adequate · gated by D29, D30 ·

The Good
D28 · Rust Secrets (history) 10.0 D43 · Rust Malicious Dependencies 10.0 S1 · Repo Web-Security Posture 8.0 X14 · Repo Bypassable address classification 10.0 X24 · Repo Document value interpolated into markup unescaped 10.0
The Bad
D36 · Rust Supply-chain Provenance & Signing 5.0 D44 · Rust Platform End-of-Life 6.0
The Ugly
D29 · Rust Static Analysis (SAST) 0.1 D30 · Rust Dependency Vulnerabilities 0.0 X15 · Repo Unvalidated length from an untrusted reader 3.5 X17 · Repo Uncapped recursion over a caller-supplied document 3.5

At a glance — Event Sourcing · 100% · Exemplary ·

The Good
ES1 · Repo Fold determinism 10.0 ES2 · Repo Immutable events 10.0

At a glance — Performance · 85% · Strong ·

The Good
PF3 · Repo Async & latency hygiene 8.5

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection122High / Critical
A03:2025 — Software Supply Chain Failures70High / Critical

Roadmap

First, clean up the dependency tree by removing unused packages and explicitly declaring imports to ensure a lean and accurate build. Second, fix the three empty test files to ensure test coverage is meaningful, and integrate static analysis tools into the CI pipeline to automatically block regressions on push. Third, begin adopting TypeScript by adding a type-checking step to the build process, prioritizing the highest-traffic modules. Finally, enforce HTTP resilience by adding request timeouts and retry logic to all outbound client calls to prevent hanging connections.

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

Do thisHelpsEffortDimension
Resolve the 3 No assertions (empty test) finding(s) in Test Quality — start with LiveResolverSuspenseDisplayName-test.js, useBlockingPaginationFragment-with-suspense-transition-test.js, useRefetchableFragmentNode-with-suspense-transition-test.js.+4.6 ptsLowTest Quality
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.+5.6 ptsMediumDependency Hygiene
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.+4.3 ptsMediumType Safety
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.+2.8 ptsMediumSecurity & performance tooling
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.+2.8 ptsMediumOutbound HTTP resilience
Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with package.json.+0.9 ptsLowPlatform End-of-Life
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.+1.5 ptsMediumRelease Hygiene
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.+1.4 ptsMediumLarge Files

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.3SlopDependency Vulnerabilities: High CVE: REDACTED
REDACTED1.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.6SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopDependency Vulnerabilities: High CVE: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.1MixedDependency Vulnerabilities: Critical vulnerability: REDACTED
REDACTED4.2MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
compiler/crates/relay-typegen/src/flow.rs5.5MixedCognitive Complexity: FlowPrinter::write_object (cognitive 19)
compiler/crates/schema-set/src/schema_set.rs5.6MixedCyclomatic Complexity: SchemaSet::fix_all_types_impl (cyclomatic 19)
REDACTED5.7MixedStatic Analysis (SAST): Medium: REDACTED

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 100

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

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

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

Could not be resolved — 11

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. 75 of 75 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. 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 — 75 dimensions across the health lenses
D1D2D3D4D6D7D9D10D12D13D14D15D16D17D19D20D26D28D29D30D34D35D36D43D44AX10AX3AX4AX8AX9ES1ES2M1M2M3M4P1P10P2P3P4P6P7PF3R1R10R11R2R3R4R6R7R8R9S1X1X12X13X14X15X16X17X18X19X21X22X23X24X25X26X27X28X29X3X30

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

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

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

Tools & methods

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

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement—◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a176d6-4bb0-7485-ac4b-f2e528b074e8.

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

Run transparency — what happened this run

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

  • D5 Coupling — 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's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • 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 3,057 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 126 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 reliability not scored — the JavaScript/TypeScript suite (jest via `yarn install --frozen-lockfile --ignore-scripts` in the repository root (0 tests); jest via `yarn install --frozen-lockfile --ignore-scripts` in compiler/crates/relay-compiler-playground/ (0 tests); jest via `yarn install --frozen-lockfile --ignore-scripts` in packages/relay-e2e-test/) ran but surfaced no test cases to the runner, so flakiness couldn't be exercised.
  • D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability for the jest suite in packages/relay-e2e-test/ was NOT MEASURED: the install for packages/relay-e2e-test/ left no `jest` binary under node_modules, so the suite could not be launched. This is OUR limitation, not a defect in the repository, and the suite is excluded from the measurement rather than counted against it.
  • D14 License Compliance — 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. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D19 Documentation 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. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — not measured this run — 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. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D24 Comment Value — 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's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `flow-typed/npm/chalk_v4.x.x.js`, `flow-typed/npm/invariant_v2.x.x.js`, `flow-typed/npm/jest_v29.x.x.js`, `packages/babel-plugin-relay/BabelPluginRelay.js`, `packages/babel-plugin-relay/compileGraphQLTag.js`, … (+110 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • AXR1 Runtime accessibility — 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. Render strategy: boot via DevServer (start). the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence.
  • 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 reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python, Rust is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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 reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python, Rust is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • 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.
  • R10 Code Duplication — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 32 further occurrence(s) are not listed individually; the score already reflects all 72.
  • R4 Test Coverage — 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. 5 further occurrence(s) are not listed individually; the score already reflects all 45.
  • 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 reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations: 20 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.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality 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.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • 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.

Dimensions

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

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

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

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

108 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was createContainerWithFragments at 68. A further 25 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 relay_lsp::hover::with_resolution_path::get_hover_behavior_from_resolution_path at 90 — they are counted neither in the figure above nor in this dimension's score. 15 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: compiler/crates/relay-lsp/src/hover/with_resolution_path.rs (relay_lsp::hover::with_resolution_path::get_hover_behavior_from_resolution_path at 90), compiler/crates/schema-extractor/src/lib.rs (schema_extractor::type_annotation_name at 38), compiler/crates/graphql-syntax/src/lexer.rs (TokenKind::fmt at 29), compiler/crates/relay-typegen/src/flow.rs (FlowPrinter::write at 25), compiler/crates/relay-typegen/src/typescript.rs (TypeScriptPrinter::write at 25), and 10 more not listed here. 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.

relay_compiler::artifact_content::content::generate_operation (cyclomatic 25) · ×7compiler/crates/relay-compiler/src/artifact_content/content.rs:282
relay_typegen::visit::raw_response_selections_to_babel (cyclomatic 21) · ×3compiler/crates/relay-typegen/src/visit.rs:1760
relay_lsp::docblock_resolution_info::create_docblock_resolution_info (cyclomatic 19) · ×3compiler/crates/relay-lsp/src/docblock_resolution_info.rs:23
schema_diff::detect_changes_from_schemas (cyclomatic 43) · ×2compiler/crates/schema-diff/src/lib.rs:827
InMemorySchema::add_definition (cyclomatic 37) · ×2compiler/crates/schema/src/in_memory.rs:1445

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

What to do

  1. Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with createContainerWithFragments (cyclomatic 68). — Refactoring it lifts Cyclomatic Complexity from 6.4 to about 6.5/10.
  2. 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.

D2 · Cognitive Complexity5.3 / 10Adequate✓ Tool-verified

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

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

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

231 method(s) exceeded the cognitive complexity threshold of 15; the worst was _readClientEdge at 96.

relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions (cognitive 60) · ×12compiler/crates/relay-compiler/src/graphql_asts.rs:300
relay_typegen::visit::make_prop (cognitive 48) · ×9compiler/crates/relay-typegen/src/visit.rs:2076
CodegenBuilder::build_inline_fragment (cognitive 49) · ×7compiler/crates/relay-codegen/src/build_ast.rs:2697
relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects (cognitive 38) · ×5compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:465
relay_lsp::docblock_resolution_info::create_docblock_resolution_info (cognitive 30) · ×5compiler/crates/relay-lsp/src/docblock_resolution_info.rs:23

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

What to do

  1. Bring the 9 bodies over 60 down to 60 or less in Cognitive Complexity — start with _readClientEdge (cognitive 96), RelayReader._readClientEdge (cognitive 88), schema_diff::diff (cognitive 83). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 9 together lifts Cognitive Complexity from 5.3 to about 6.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. 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.

D3 · God Classes7.0 / 10Adequate✓ Tool-verified

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

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

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

148 god class(es) detected.

FileTooLong: src/visit.rs · ×51compiler/crates/relay-typegen/src/visit.rs
MethodTooLong: ShardedSet.with_hasher · ×34compiler/crates/intern/src/sharded_set.rs:39
FunctionTooLong: relay_lsp::hover::with_resolution_path::get_hover_behavior_from_resolution_path · ×32compiler/crates/relay-lsp/src/hover/with_resolution_path.rs:138
ClassTooLong: CodegenBuilder · ×18compiler/crates/relay-codegen/src/build_ast.rs:368
TooManyMethods: Parser · ×10compiler/crates/graphql-syntax/src/parser.rs:53

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

What to do

  1. Resolve the 51 FileTooLong finding(s) in God Classes — start with lib.rs (5), visit.rs, build_ast.rs. — One of this dimension's main actionable groups (51 warning-level).
  2. Resolve the 34 MethodTooLong finding(s) in God Classes — start with build_ast.rs (4), REDACTED (2), match_transform.rs (2). — One of this dimension's main actionable groups (34 warning-level).
  3. Resolve the 32 FunctionTooLong finding(s) in God Classes — start with visit.rs (5), lib.rs (3), write.rs (3). — One of this dimension's main actionable groups (32 warning-level).
  4. 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.

D4 · Code Duplication9.2 / 10Stronggated by 223 serious findings✓ Tool-verified

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

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

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

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

Duplicated block (8 lines × 2) · ×16compiler/crates/graphql-ir/src/program.rs:45
Duplicated block (5 lines × 2) · ×16compiler/crates/graphql-ir/src/visitor.rs:69
Duplicated block (7 lines × 2) · ×15compiler/crates/graphql-ir/src/node_identifier.rs:79
Duplicated block (6 lines × 2) · ×15compiler/crates/graphql-ir/src/transform.rs:453
Duplicated block (12 lines × 2) · ×14compiler/crates/relay-bin/src/main.rs:712

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

What to do

  1. Resolve the 16 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with wrapper.rs (2), program.rs, build_ast.rs. — One of this dimension's main actionable groups (16 warning-level).
  2. Resolve the 16 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with flow.rs (7), client_component_boundaries.rs (2), visitor.rs. — One of this dimension's main actionable groups (16 warning-level).
  3. Resolve the 15 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with compiler_state.rs (2), wrapper.rs (2), set_type_reference.rs (2). — One of this dimension's main actionable groups (15 warning-level).
  4. 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.

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

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

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

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

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

2 of 295 classes have LCOM4 above 3.

Low cohesion: SchemaSet (LCOM4 5) · ×2compiler/crates/schema-set/src/schema_set.rs:76

What to do

  1. Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with schema_set.rs, validate_client_schema_extensions_use_catch.rs. — One of this dimension's main actionable groups (2 warning-level).
  2. 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.

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

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

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

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

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

Classify ADR enforcement: H1 2016meta/roadmaps/2016-H1.md

What to do

  1. Resolve the 1 Classify ADR enforcement finding(s) in Architectural Integrity — start with 2016-H1.md. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Enforce Architectural Integrity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

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

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

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

6388 test methods: 4057 unit, 2330 integration, 0 BDD, 1 e2e. The JavaScript/TypeScript suite contributes 3057 `it`/`test` case(s) across 242 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 3331 `#[test]` function(s) across 217 file(s) declaring at least one; its unit/integration split is Cargo's own — 123 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.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D10 · Test Quality9.7 / 10Adequategated by 3 critical findings✓ Tool-verified

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

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

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

17 skipped, 27 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 3057 tests. Measured on the JavaScript/TypeScript suite only — at least 126 test source file(s) (.rs) went unread, so its test quality is unmeasured and is not in these counts.

No assertions (empty test): still subscribes for resolution when it supplies a name · ×3packages/relay-runtime/store/__tests__/LiveResolverSuspenseDisplayName-test.js:91
No assertions: does not throw when expected warning is fired · ×24packages/relay-test-utils-internal/__tests__/warnings-test.js:42
Skipped test: suspends then updates when the query and component load · ×17packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js:217
Mock-dominated test: applies payload on @defer fragments in a query with modules · ×29packages/relay-runtime/store/__tests__/RelayModernEnvironment-CommitPayload-test.js:295

What to do

  1. Resolve the 3 No assertions (empty test) finding(s) in Test Quality — start with LiveResolverSuspenseDisplayName-test.js, useBlockingPaginationFragment-with-suspense-transition-test.js, useRefetchableFragmentNode-with-suspense-transition-test.js. — One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 24 No assertions finding(s) in Test Quality — start with RelayResponseNormalizer-test.js (11), warnings-test.js (4), useFragmentNode-test.js (3). — One of this dimension's main actionable groups (24 warning-level).
  3. Resolve the 17 Skipped test finding(s) in Test Quality — start with LazyLoadEntryPointContainer_DEEPRECATED-test.js (4), useLazyLoadQueryNode-test.js (3), EntryPointContainer-test.js (2). — One of this dimension's main actionable groups (17 warning-level).
  4. Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D12 · Dependency Hygiene9.8 9.6 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

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

4 outdated, 0 yanked direct Cargo dependencies. 64 of 65 direct crates were graded against crates.io (0 not published there, 1 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.

Outdated: schemars · ×4

✓ On the Gold path — maintain.

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 282 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

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

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

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

Top hotspots: compiler/crates/relay-compiler/src/artifact_content/content.rs (9×25=225); compiler/crates/relay-codegen/src/build_ast.rs (12×15=180); packages/react-relay/relay-hooks/loadQuery.js (5×27=135)

Hotspot: compiler/crates/relay-compiler/src/artifact_content/content.rs · ×8compiler/crates/relay-compiler/src/artifact_content/content.rs:282

What to do

  1. Resolve the 8 Hotspot finding(s) in Churn × Complexity Hotspots — start with content.rs, build_ast.rs, loadQuery.js. — One of this dimension's main actionable groups (8 warning-level).

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

D16 · Bus Factor9.2 / 10Exemplary✓ Tool-verified

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

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

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

27 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is compiler/crates/schema-set/src/build_schema_document.rs. Counted over 334 of the 438 production source files in this repository: 102 are under the ~2,400-byte size floor this dimension measures over, and the remaining 2 have no attributable history left to measure.

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

✓ On the Gold path — maintain.

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

D17 · Explicit Debt9.9 / 10Stronggated by 77 serious findings✓ Tool-verified

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

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

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

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

TodoComment · ×74compiler/crates/schema-validate/src/lib.rs:511
FixmeComment · ×2compiler/crates/relay-compiler/src/build_project/build_resolvers_schema/ir_to_schema.rs:21
HackCommentcompiler/crates/extract-graphql/src/lib.rs:226

What to do

  1. Resolve the 74 TodoComment finding(s) in Explicit Debt — start with lib.rs (5), visit.rs (4), transform_connections.rs (4). — One of this dimension's main actionable groups (74 warning-level).
  2. Resolve the 2 FixmeComment finding(s) in Explicit Debt — start with ir_to_schema.rs (2). — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 HackComment finding(s) in Explicit Debt — start with lib.rs. — One of this dimension's main actionable groups (1 warning-level).
  4. 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.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d20_recommendation.md.

D26 · Project Cohesion4.3 / 10Weak✓ Tool-verified

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

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

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

2 of 7 build units (Cargo, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

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

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

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

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

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

122 finding(s): 0 critical, 47 high, 75 medium, 0 low. 44 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 173 file(s) — `compiler/crates/relay-config/src/project_config.rs` (line 344, line 345), `flow-typed/npm/chalk_v4.x.x.js` (line 22), `flow-typed/npm/invariant_v2.x.x.js` (line 16), `flow-typed/npm/jest_v29.x.x.js` (line 50, line 52, line 125, …), `packages/babel-plugin-relay/BabelPluginRelay.js` (line 54, line 60, line 74), … (+168 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D30 · Dependency Vulnerabilities0.0 / 10Critical✓ Tool-verified

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

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

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

64 finding(s): 2 critical, 35 high, 22 medium, 5 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 35 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (35). — One of this dimension's main actionable groups (35 issue-level).
  2. Resolve the 1 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 1 Critical CVE 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.

D34 · Knowledge Freshness7.7 / 10Adequategated by 5 critical findings✓ Tool-verified

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

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

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

77 of 336 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is compiler/crates/resolution-path/src/test.rs. Counted over 336 of the 438 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledge · ×5compiler/crates/resolution-path/src/test.rs:1
Orphaned file · ×72compiler/crates/common/src/diagnostic.rs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 72 Orphaned file finding(s) in Knowledge Freshness — start with validation_message.rs (2), lib.rs (2), diagnostic.rs. — One of this dimension's main actionable groups (72 recommendation-level).
  2. Resolve the 5 Orphaned knowledge finding(s) in Knowledge Freshness — start with test.rs, lib.rs, validate_connections.rs. — One of this dimension's main actionable groups (5 issue-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

D35 · Change Coupling9.9 / 10Stronggated by 7 serious findings✓ Tool-verified

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

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

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

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

Strongest change-coupling: useEntryPointLoader.js↔useQueryLoader.js 82%; flow.rs↔typescript.rs 71%; docblocks.rs↔lsp_state.rs 70%

Change coupling: useEntryPointLoader.js ↔ useQueryLoader.js · ×7packages/react-relay/relay-hooks/useEntryPointLoader.js:1

What to do

  1. Resolve the 7 Change coupling finding(s) in Change Coupling — start with docblocks.rs (2), useEntryPointLoader.js, flow.rs. — One of this dimension's main actionable groups (7 warning-level).

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

D36 · Supply-chain Provenance & Signing5.0 / 10Adequate✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. 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).

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

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. 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.

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

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life6.0 / 10Adequate✓ Tool-verified

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

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

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

1 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 59 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.

End-of-life runtime: Node.js 18packages/eslint-plugin-relay-internal/package.json:23

What to do

  1. Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with package.json. — One of this dimension's main actionable groups (1 warning-level).

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

Frontend & cross-cutting dimensions

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

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

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

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

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

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.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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.

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

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.

ES1 · Fold determinism10.0 / 10Exemplary✓ Tool-verified

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.

ES2 · Immutable events10.0 / 10Exemplary✓ Tool-verified

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.

M1 · Documentation (README)6.7 / 10Adequate✓ Tool-verified

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

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
  • Add a README to the 39 of 58 project(s) that lack one — worth up to 1.3 pts.
M2 · Architecture documentation4.0 / 10Weak✓ Tool-verified

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

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

What to do

  • Grow the ADR log (currently 1) — reach 8 to raise the maturity tier; document significant decisions as they're made.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

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

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

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

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.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

P2 · Observability5.6 / 10Adequate✓ Tool-verified

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

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

  • Only 6/11 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `compiler/crates/fixture-tests`, `compiler/crates/persist-query`, `compiler/crates/prettier-format`, `compiler/crates/schema-validate`, `packages/relay-compiler`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
  • Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix router) for operability.
P3 · Security & performance tooling3.0 / 10Weak✓ Tool-verified

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

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

What to do

  • Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

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

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

P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

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

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

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
P7 · Outbound HTTP resilience3.0 / 10Weak✓ Tool-verified

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.

  • `Client::builder(TokioExecutor` 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. — compiler/crates/persist-query/src/lib.rs:112

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.
PF3 · Async & latency hygiene8.5 / 10Strong✓ Tool-verified

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

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

  • `fs.readFileSync` in `anonymous function` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/relay-test-utils-internal/generateTestsFromFixtures.js:60

What to do

  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety0.0 / 10Critical✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

  • 0 typed · 642 plain JS — the untyped files are flow-typed/dev.js, flow-typed/npm/chalk_v4.x.x.js, flow-typed/npm/invariant_v2.x.x.js, flow-typed/npm/jest_v29.x.x.js, packages/babel-plugin-relay/BabelPluginRelay.js, packages/babel-plugin-relay/BabelPluginRelay.macro.js (+636 more).

What to do

  • Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
R10 · Code Duplication9.3 / 10Exemplary✓ Tool-verified

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

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

  • REDACTED:53 · REDACTED:65 — the two spans are one implementation copied and then locally edited — 2399 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:53
  • REDACTED:16 · REDACTED:15 — these 2 files are line-for-line copies of one another — 266 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — REDACTED:16
  • REDACTED:14 · REDACTED:14 — these 2 files are line-for-line copies of one another — 221 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — REDACTED:14
  • packages/react-relay/relay-hooks/useLoadMoreFunction.js:44 · packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js:42 — the two spans are one implementation copied and then locally edited — 571 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/react-relay/relay-hooks/useLoadMoreFunction.js:44
  • REDACTED:278 · REDACTED:231 — the two spans are one implementation copied and then locally edited — 491 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:278
  • packages/react-relay/ReactRelayFragmentContainer.js:80 · packages/react-relay/ReactRelayRefetchContainer.js:136 — the two spans are one implementation copied and then locally edited — 397 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/react-relay/ReactRelayFragmentContainer.js:80
  • flow-typed/npm/chalk_v4.x.x.js:39 · flow-typed/npm/chalk_v4.x.x.js:107 — all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — flow-typed/npm/chalk_v4.x.x.js:39
  • packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js:32 · packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js:32 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js:32
  • packages/relay-runtime/store/DataChecker.js:456 · packages/relay-runtime/store/RelayReferenceMarker.js:177 — the two spans are one implementation copied and then locally edited — 281 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/relay-runtime/store/DataChecker.js:456
  • REDACTED:406 · REDACTED:1535 — the two spans are one implementation copied and then locally edited — 317 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:406
  • packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:82 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99
  • packages/react-relay/relay-hooks/useQueryLoader.js:49 · packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js:38 — the two spans are one implementation copied and then locally edited — 268 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/react-relay/relay-hooks/useQueryLoader.js:49
  • packages/react-relay/relay-hooks/useEntryPointLoader.js:112 · packages/react-relay/relay-hooks/useQueryLoader.js:179 — the two spans are one implementation copied and then locally edited — 269 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/react-relay/relay-hooks/useEntryPointLoader.js:112
  • packages/react-relay/relay-hooks/usePaginationFragment.js:34 · packages/react-relay/relay-hooks/useRefetchableFragment.js:27 — the two spans are one implementation copied and then locally edited — 259 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/react-relay/relay-hooks/usePaginationFragment.js:34
  • packages/react-relay/relay-hooks/legacy/FragmentResource.js:637 · packages/react-relay/relay-hooks/legacy/FragmentResource.js:767 — the two spans are one implementation copied and then locally edited — 177 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/react-relay/relay-hooks/legacy/FragmentResource.js:637
  • packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:77 · packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:82 — the 3 copies are spread across 3 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/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:77
  • packages/relay-runtime/handlers/connection/MutationHandlers.js:107 · packages/relay-runtime/handlers/connection/MutationHandlers.js:185 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — packages/relay-runtime/handlers/connection/MutationHandlers.js:107
  • REDACTED:303 · REDACTED:815 — the two spans are one implementation copied and then locally edited — 129 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:303
  • packages/relay-runtime/util/getPaginationVariables.js:34 · packages/relay-runtime/util/getPaginationVariables.js:71 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — packages/relay-runtime/util/getPaginationVariables.js:34
  • packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:89 · packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:49 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:89
  • packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:64 · packages/react-relay/relay-hooks/loadEntryPoint.js:25 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:64
  • packages/relay-runtime/store/RelayModernRecord.js:336 · packages/relay-runtime/store/RelayModernRecord.js:408 — 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/relay-runtime/store/RelayModernRecord.js:336
  • packages/relay-runtime/mutations/RelayRecordSourceProxy.js:176 · packages/relay-runtime/mutations/RelayRecordSourceSelectorProxy.js:132 — 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/relay-runtime/mutations/RelayRecordSourceProxy.js:176
  • packages/react-relay/ReactRelayFragmentContainer.js:168 · REDACTED:464 — 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/react-relay/ReactRelayFragmentContainer.js:168
  • packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:25 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:24 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:25
  • packages/react-relay/relay-hooks/readFragmentInternal.js:183 · REDACTED:385 — 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/react-relay/relay-hooks/readFragmentInternal.js:183
  • REDACTED:152 · REDACTED:290 · REDACTED:802 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:152
  • packages/relay-runtime/store/cloneRelayHandleSourceField.js:33 · packages/relay-runtime/store/cloneRelayScalarHandleSourceField.js:32 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/relay-runtime/store/cloneRelayHandleSourceField.js:33
  • packages/react-relay/relay-hooks/readFragmentInternal.js:265 · REDACTED:672 · REDACTED:786 — the 3 copies are spread across 3 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/react-relay/relay-hooks/readFragmentInternal.js:265
  • REDACTED:1384 · REDACTED:1411 — 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. — REDACTED:1384
  • packages/react-relay/index.js:101 · packages/react-relay/legacy.js:62 — the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour — the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator's options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents. — packages/react-relay/index.js:101
  • packages/relay-runtime/handlers/connection/ConnectionHandler.js:330 · packages/relay-runtime/handlers/connection/ConnectionHandler.js:434 — 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/relay-runtime/handlers/connection/ConnectionHandler.js:330
  • packages/react-relay/relay-hooks/readFragmentInternal.js:60 · REDACTED:68 · REDACTED:89 · REDACTED:80 · +1 more site(s) not listed — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/react-relay/relay-hooks/readFragmentInternal.js:60
  • packages/relay-runtime/store/RelayModernSelector.js:264 · packages/relay-runtime/store/RelayModernSelector.js:367 — 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/relay-runtime/store/RelayModernSelector.js:264
  • packages/relay-runtime/store/RelayStoreSubscriptions.js:147 · packages/relay-runtime/store/RelayStoreSubscriptions.js:168 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — packages/relay-runtime/store/RelayStoreSubscriptions.js:147
  • packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:47 · packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:32 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:31 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:47
  • packages/react-relay/relay-hooks/EntryPointContainer.react.js:55 · packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:219 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/react-relay/relay-hooks/EntryPointContainer.react.js:55
  • REDACTED:300 · REDACTED:351 — 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. — REDACTED:300
  • REDACTED:1321 · REDACTED:1494 — 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. — REDACTED:1321
  • REDACTED:182 · REDACTED:834 — 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. — REDACTED:182

What to do

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

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

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

  • REDACTED:14 reaches into another package with a relative path (../relay-runtime/network/RelayObservable) — import the package by name instead. — REDACTED:14
  • packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:13 reaches into another package with a relative path (../../relay-runtime/util/RelayRuntimeTypes) — import the package by name instead. — packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:13
  • packages/react-relay/relay-hooks/loadQuery.js:14 reaches into another package with a relative path (../../relay-runtime/network/RelayNetworkTypes) — import the package by name instead. — packages/react-relay/relay-hooks/loadQuery.js:14
  • packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:14 reaches into another package with a relative path (../../relay-runtime/network/RelayNetworkTypes) — import the package by name instead. — packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:14
  • packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:13 reaches into another package with a relative path (../../relay-runtime/util/RelayRuntimeTypes) — import the package by name instead. — packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:13
  • packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:17 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/preloadQuery_DEPRECATED) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:17
  • packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:18 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/RelayEnvironmentProvider) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:18
  • packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:19 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/useFragment) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:19
  • packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:20 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/useLazyLoadQuery) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:20
  • packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:21 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/usePreloadedQuery) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:21
  • packages/relay-test-utils/__tests__/RelayResolverTestUtils-test.js:18 reaches past another workspace package's public entry into its internals with a relative path (../../relay-runtime/store/ResolverFragments) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/relay-test-utils/__tests__/RelayResolverTestUtils-test.js:18

What to do

  • Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
R2 · Cyclomatic Complexity8.0 / 10Strong✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • createContainerWithFragments has cyclomatic complexity 57 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:319
  • (anonymous) has cyclomatic complexity 56 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:268
  • update has cyclomatic complexity 41 and cognitive complexity 71; 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/relay-runtime/handlers/connection/ConnectionHandler.js:50
  • readWithIdentifier has cyclomatic complexity 36 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/react-relay/relay-hooks/legacy/FragmentResource.js:238
  • _traverseSelections has cyclomatic complexity 36 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:567
  • (anonymous) has cyclomatic complexity 34 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 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/relay-runtime/store/ExecTimeS2CDataChecker.js:222
  • _readClientEdge has cyclomatic complexity 30 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1039
  • readFragmentInternal has cyclomatic complexity 29 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/react-relay/relay-hooks/readFragmentInternal.js:152
  • createContainerWithFragments has cyclomatic complexity 28 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/react-relay/ReactRelayRefetchContainer.js:70
  • (anonymous) has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/relay-runtime/store/DataChecker.js:362
  • _traverseSelections has cyclomatic complexity 27 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:243
  • updateProxyFromSelections has cyclomatic complexity 27 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:55
  • _handleNext has cyclomatic complexity 26 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:587
  • (anonymous) has cyclomatic complexity 25 and cognitive complexity 17; 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/relay-runtime/store/RelayReferenceMarker.js:132
  • notify has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:471
  • readFromCacheOrEvaluate has cyclomatic complexity 23 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:111
  • _traverseSelections has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:257
  • recycleNodesIntoImpl has cyclomatic complexity 23 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/relay-runtime/util/recycleNodesInto.js:22
  • _normalizeField has cyclomatic complexity 22 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:609
  • _collect has cyclomatic complexity 21 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:891

What to do

  • Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
R3 · Large Files5.1 / 10Adequate✓ Tool-verified

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

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

  • REDACTED has 1885 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 1763 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/relay-runtime/store/RelayStoreTypes.js has 1515 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/RelayStoreTypes.js:1
  • flow-typed/npm/jest_v29.x.x.js has 1235 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — flow-typed/npm/jest_v29.x.x.js:1
  • REDACTED has 1113 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/relay-runtime/store/live-resolvers/LiveResolverCache.js has 1012 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:1
  • REDACTED has 1003 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 983 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 876 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/react-relay/relay-hooks/legacy/FragmentResource.js has 846 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/react-relay/relay-hooks/legacy/FragmentResource.js:1
  • REDACTED has 808 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 789 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/relay-runtime/store/RelayModernRecord.js has 709 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/RelayModernRecord.js:1
  • REDACTED has 672 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/relay-runtime/store/DataChecker.js has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/DataChecker.js:1
  • packages/relay-runtime/network/RelayObservable.js has 606 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/network/RelayObservable.js:1
  • packages/relay-runtime/handlers/connection/ConnectionHandler.js has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/handlers/connection/ConnectionHandler.js:1
  • REDACTED has 579 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/react-relay/relay-hooks/QueryResource.js has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/react-relay/relay-hooks/QueryResource.js:1
  • packages/relay-test-utils/RelayModernMockEnvironment.js has 561 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-test-utils/RelayModernMockEnvironment.js:1
  • REDACTED has 529 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 528 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/relay-runtime/store/RelayModernSelector.js has 518 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/RelayModernSelector.js:1
  • REDACTED has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/react-relay/ReactRelayRefetchContainer.js has 464 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/react-relay/ReactRelayRefetchContainer.js:1
  • REDACTED has 454 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:1
  • packages/react-relay/relay-hooks/loadQuery.js has 447 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/react-relay/relay-hooks/loadQuery.js:1
  • packages/relay-runtime/store/RelayModernFragmentSpecResolver.js has 442 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/store/RelayModernFragmentSpecResolver.js:1
  • packages/relay-runtime/index.js has 441 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/relay-runtime/index.js:1
  • packages/react-relay/ReactRelayQueryRenderer.js has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/react-relay/ReactRelayQueryRenderer.js:1
  • REDACTED has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1

What to do

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

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

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

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×40) — packages/relay-runtime/store/RelayStoreTypes.js:1, flow-typed/npm/jest_v29.x.x.js:1, REDACTED:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

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

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

R7 · Dead Code9.2 / 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.

  • 12 file(s) (~908 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — packages/babel-plugin-relay
  • Unreachable from the 38 application, 104 tooling and 396 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 (38 application, 104 tooling, 396 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 (×23) — flow-typed/npm/jest_v29.x.x.js, REDACTED, packages/react-relay/__flowtests__/RelayModern-flowtest.js, …
  • no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 6 in-repo import(s) from 3 other file(s) do name it (packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js, packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js, packages/react-relay/relay-hooks/__flowtests__/useRefetchableFragment-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/react-relay/relay-hooks/__flowtests__/utils.js
  • no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/multi-actor/index.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/react-relay/multi-actor/ActorChange.js
  • no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/multi-actor/ActorChange.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/react-relay/multi-actor/useRelayActorEnvironment.js
  • no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/NestedEntrypoints-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/react-relay/relay-hooks/NestedRelayEntryPointBuilderUtils.js
  • no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it (×3) — packages/react-relay/__flowtests__/RelayModernFlowtest_badref.graphql.js, packages/react-relay/__flowtests__/RelayModernFlowtest_notref.graphql.js, packages/react-relay/__flowtests__/RelayModernFlowtest_users.graphql.js
  • no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 3 in-repo import(s) from 3 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js, packages/react-relay/__flowtests__/RelayModernFlowtest_badref.graphql.js, packages/react-relay/__flowtests__/RelayModernFlowtest_notref.graphql.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/react-relay/__flowtests__/RelayModernFlowtest_user.graphql.js

What to do

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

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

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

  • Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json. (×2) — packages/react-relay/relay-hooks/EntryPointTypes.flow.js:16, packages/relay-runtime/util/NormalizationNode.js:16
  • Imported but not declared in any reachable package.json — installs work only by hoisting accident. (×8) — packages/react-relay/ReactRelayFragmentContainer.js:24, packages/react-relay/__tests__/ReactRelayFragmentContainer-test.js:716, REDACTED:58, …
  • Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2)
  • Only test files import it (first: packages/react-relay/relay-hooks/__tests__/loadQuery-test.js:41) — move it to devDependencies. — package.json:78

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports10.0 / 10Exemplary✓ Tool-verified

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

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

S1 · Web-Security Posture8.0 / 10Strong✓ Tool-verified

Other · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.

  • MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×15) — compiler/crates/common/src/rollout.rs:58, compiler/crates/common/src/rollout.rs:80, compiler/crates/docblock-shared/src/resolver_source_hash.rs:44, …

What to do

  • Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 15 sites, not one: `compiler/crates/common/src/rollout.rs:58` (`Md5::digest`), `compiler/crates/common/src/rollout.rs:80` (`Md5::digest`), `compiler/crates/docblock-shared/src/resolver_source_hash.rs:44` (`Md5::new`), `compiler/crates/relay-codegen/src/build_ast.rs:3571` (`Md5::new`), `compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:167` (`Sha1::new_with_prefix`), `compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:314` (`Sha1::digest`), `compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:361` (`Sha1::digest`), `compiler/crates/relay-compiler/src/build_project/build_ir.rs:170` (`Md5::new`), and 7 further site(s). Each is a separate decision — fixing only the line this row cites leaves the others in place.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

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

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

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

  • `count` is read from the bytes being parsed at line 834 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 836 — and nowhere in its scope is `count` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `count` against the bytes actually remaining and a maximum the format allows before allocating. — compiler/crates/schema/src/compact.rs:836

What to do

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

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

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

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

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

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

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

What to do

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

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

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

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

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

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

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

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

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

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

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

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

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

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

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

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

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.

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

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

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

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

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

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

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

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

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

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

  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×6) — packages/relay-runtime/util/RelayError.js:45, packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:346, packages/relay-runtime/handlers/connection/MutationHandlers.js:110, …

What to do

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

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

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

Reference — by lens

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

LensScoreRatingImpact
Code Health49%Weak — gated by R1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture89%StrongSolid.
Maturity70%StrongSolid.
Readiness39%Weak — gated by R8, P3, P7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security64%Adequate — gated by D29, D30Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Event Sourcing100%ExemplaryStrongest area.
Performance85%StrongSolid.
Unscored — 2 check(s) recorded observations but carry no score

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

  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

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

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 55 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
  • 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).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — no exported interface declares behaviour
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence 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 — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — No tests discovered
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Rust, TypeScript not measured.
  • D22 Internal API Consistency — API consistency is measured on C# only; the exposed JavaScript, Rust, TypeScript surface was not measured.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. 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 — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — None of 0 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 115 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.
  • D5 Coupling — D5 reads a .NET project-reference graph only — this repository's production source is .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the jest suite in the repository root ran and not one test passed (FAIL packages/react-relay/relay-hooks/__tests__/usePaginationFragment-test.js), so the coverage would describe the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 53 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 — no mutating command handlers or message consumers detected — idempotency check not applicable
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • 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
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a package.json, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb. TypeScript/JavaScript runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
  • R5 Dependency Freshness — uses a yarn lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X2 Cancellation propagation — no C# was loaded; this repository's Python and Rust were read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • 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 — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
  • 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.

Critical — 100 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 19 more in this group — see findings.md.
D30 · Dependency Vulnerabilities · High CVE · ×35
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 10 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned knowledge · ×5
  • Orphaned knowledge compiler/crates/resolution-path/src/test.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
  • Orphaned knowledge compiler/crates/graphql-ir-diff/src/lib.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge compiler/crates/relay-transforms/src/validations/validate_connections.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge compiler/crates/relay-lsp/src/rename.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
D10 · Test Quality · No assertions (empty test) · ×3
  • No assertions (empty test): still subscribes for resolution when it supplies a name packages/relay-runtime/store/__tests__/LiveResolverSuspenseDisplayName-test.js:91 — Test method has an empty body — it asserts nothing and exercises no code.
  • No assertions (empty test): empty test to prevent Jest from failing packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-with-suspense-transition-test.js:41 — Test method has an empty body — it asserts nothing and exercises no code.
  • No assertions (empty test): empty test to prevent Jest from failing packages/react-relay/relay-hooks/__tests__/useRefetchableFragmentNode-with-suspense-transition-test.js:41 — Test method has an empty body — it asserts nothing and exercises no code.
R8 · Dependency Hygiene · Unlisted import 'areEqual' · ×3
  • Unlisted import 'areEqual' packages/react-relay/ReactRelayFragmentContainer.js:24 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
  • Unlisted import 'areEqual' packages/relay-runtime/store/RelayModernFragmentSpecResolver.js:41 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
  • Unlisted import 'areEqual' packages/relay-test-utils/RelayModernMockEnvironment.js:29 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'warning' · ×3
  • Unlisted import 'warning' REDACTED:58 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
  • Unlisted import 'warning' packages/relay-runtime/handlers/connection/ConnectionHandler.js:27 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
  • Unlisted import 'warning' packages/relay-test-utils-internal/Matchers.js:59 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Critical vulnerability · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×1
  • REDACTED
R8 · Dependency Hygiene · Unlisted import 'scheduler' · ×1
  • Unlisted import 'scheduler' packages/react-relay/__tests__/ReactRelayFragmentContainer-test.js:716 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import '@babel/plugin-transform-react-jsx' · ×1
  • Unlisted import '@babel/plugin-transform-react-jsx' packages/relay-e2e-test/jest-transform.js:73 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Serious — 1097 finding(s)
D17 · Explicit Debt · TodoComment · ×74
  • TodoComment compiler/crates/schema-validate/src/lib.rs:511 — // TODO: change to contravariant? — 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 compiler/crates/schema-validate/src/lib.rs:531 — // TODO: validate default values? — 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 compiler/crates/schema-set/src/schema_set_collector.rs:492 — // TODO: handle legacy style @connection fields with client-defined schema extensions. — 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 compiler/crates/schema/src/errors.rs:46 — // TODO: These should be replaced with error codes or by unifying the parsers. — 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 compiler/crates/schema/src/in_memory.rs:217 — /// TODO: we probably want to replace this with a proper `Unknown` type. — 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 compiler/crates/schema/src/schema.rs:224 — /// TODO: we probably want to replace this with a proper `Unknown` type. — 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 compiler/crates/schema/src/in_memory.rs:1470 — // TODO(T63941319) @skip and @include directives are duplicated in our schema — 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 compiler/crates/schema/src/flatbuffer/wrapper.rs:939 — // TODO(inanc): Also check if the parent type is fetchable? — 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 compiler/crates/relay-typegen/tests/generate_flow.rs:123 — // TODO: T195687167 This is currently duplicated in flow and TS - export this to a common place — 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 compiler/crates/relay-typegen/tests/generate_typescript.rs:90 — // TODO: T195687167 This is currently duplicated in flow and TS - export this to a common place — 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 compiler/crates/relay-typegen/src/visit.rs:2099 — // TODO check whether the field is `node` or `nodes` on `Query`. If so, it should not be — 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 compiler/crates/relay-typegen/src/visit.rs:2513 — // TODO: We could implement custom variables that are provided via the — 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 compiler/crates/relay-typegen/src/visit.rs:3056 — // TODO: T85950736 Fix these clippy errors — 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 compiler/crates/relay-typegen/src/visit.rs:3230 — // TODO consider reading the id field from the config. This must be done — 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 compiler/crates/relay-transforms/src/apply_fragment_arguments.rs:717 — // TODO update globals — 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 compiler/crates/relay-transforms/src/client_extensions.rs:301 — // TODO(T63388023): Returns a typed directive — 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 compiler/crates/relay-transforms/src/client_extensions_abstract_types.rs:85 — // TODO: We should also record type information about — 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 compiler/crates/relay-transforms/src/client_extensions_abstract_types.rs:95 — // TODO: We should also record type information about — 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 compiler/crates/relay-transforms/src/refetchable_fragment.rs:363 — // TODO: path or connection field locations in the error messages — 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 compiler/crates/relay-transforms/src/relay_resolvers.rs:117 — // TODO: Add Support for FullData — 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 compiler/crates/relay-transforms/src/required_directive.rs:146 — // TODO(T70172661): Also reference the location of the inline fragment, once they have a location. — 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 compiler/crates/relay-transforms/src/transform_connections.rs:487 — // TODO(T63388023): Use typed directives/metadata instead — 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 compiler/crates/relay-transforms/src/transform_connections.rs:550 — // TODO(T63626938): This assumes that each document is processed serially (not in parallel or concurrently) — 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 compiler/crates/relay-transforms/src/transform_connections.rs:577 — // TODO(T63626938): This assumes that each document is processed serially (not in parallel or concurrently) — 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 compiler/crates/relay-transforms/src/validations/validate_relay_directives.rs:46 — // TODO(T63626938): This assumes that each document is processed serially (not in parallel or concurrently) — 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.
  • + 49 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 40 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×51
  • FileTooLong: src/visit.rs compiler/crates/relay-typegen/src/visit.rs — FileTooLong — 2513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 63 free functions. The bar is 500 significant lines; this is 2013 over it, 5.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/build_ast.rs compiler/crates/relay-codegen/src/build_ast.rs — FileTooLong — 2494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 84% of them inside a single declaration: CodegenBuilder (2 blocks, 368-3400). The bar is 500 significant lines; this is 1994 over it, 4.99× 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/parser.rs compiler/crates/graphql-syntax/src/parser.rs — FileTooLong — 1994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 97% of them inside a single declaration: Parser (2 blocks, 53-3150). The bar is 500 significant lines; this is 1494 over it, 3.99× 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/in_memory.rs compiler/crates/schema/src/in_memory.rs — FileTooLong — 1654 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 1154 over it, 3.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/lib.rs compiler/crates/resolution-path/src/lib.rs — FileTooLong — 1278 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 778 over it, 2.56× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1266 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 88% of them inside a single declaration: RelayReader (101-1890). The bar is 500 significant lines; this is 766 over it, 2.53× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1263 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 89% of them inside a single declaration: Executor (131-1790). The bar is 500 significant lines; this is 763 over it, 2.53× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/client_edges.rs compiler/crates/relay-transforms/src/client_edges.rs — FileTooLong — 1199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 61% of them inside a single declaration: ClientEdgesTransform (4 blocks, 370-1777). The bar is 500 significant lines; this is 699 over it, 2.40× 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/lib.rs compiler/crates/relay-schema-generation/src/lib.rs — FileTooLong — 1117 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 617 over it, 2.23× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/write.rs compiler/crates/relay-typegen/src/write.rs — FileTooLong — 1111 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 611 over it, 2.22× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/completion.rs compiler/crates/relay-lsp/src/completion.rs — FileTooLong — 1076 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 576 over it, 2.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/ir.rs compiler/crates/relay-docblock/src/ir.rs — FileTooLong — 999 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 499 over it, 2.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/config.rs compiler/crates/relay-compiler/src/config.rs — FileTooLong — 998 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 498 over it, 2.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: hover/with_resolution_path.rs compiler/crates/relay-lsp/src/hover/with_resolution_path.rs — FileTooLong — 953 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 453 over it, 1.91× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: artifact_content/content.rs compiler/crates/relay-compiler/src/artifact_content/content.rs — FileTooLong — 868 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 368 over it, 1.74× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: match_/match_transform.rs compiler/crates/relay-transforms/src/match_/match_transform.rs — FileTooLong — 824 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: MatchTransform (3 blocks, 117-1024). The bar is 500 significant lines; this is 324 over it, 1.65× 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/compact.rs compiler/crates/schema/src/compact.rs — FileTooLong — 820 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 320 over it, 1.64× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: flatbuffer/wrapper.rs compiler/crates/schema/src/flatbuffer/wrapper.rs — FileTooLong — 807 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 307 over it, 1.61× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/compiler_state.rs compiler/crates/relay-compiler/src/compiler_state.rs — FileTooLong — 790 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 290 over it, 1.58× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: store/RelayStoreTypes.js packages/relay-runtime/store/RelayStoreTypes.js — FileTooLong — 763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 263 over it, 1.53× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/schema_set.rs compiler/crates/schema-set/src/schema_set.rs — FileTooLong — 759 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 259 over it, 1.52× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 754 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: RelayResponseNormalizer (116-1037). The bar is 500 significant lines; this is 254 over it, 1.51× 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/schema_set_collector.rs compiler/crates/schema-set/src/schema_set_collector.rs — FileTooLong — 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 76% of them inside a single declaration: SchemaSet (57-872). The bar is 500 significant lines; this is 250 over it, 1.50× 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/lib.rs compiler/crates/schema-diff/src/lib.rs — FileTooLong — 749 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 249 over it, 1.50× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: node/type_system.rs compiler/crates/graphql-syntax/src/node/type_system.rs — FileTooLong — 743 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 243 over it, 1.49× 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.
  • + 26 more in this group — see findings.md.
R4 · Test Coverage · No test reaches this file · ×40
  • No test reaches this file packages/relay-runtime/store/RelayStoreTypes.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file flow-typed/npm/jest_v29.x.x.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/relay-runtime/util/ReaderNode.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/relay-runtime/util/NormalizationNode.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/EntryPointTypes.flow.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/relay-runtime/multi-actor-environment/MultiActorEnvironmentTypes.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/__flowtests__/RelayModern-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts/release-notes/App.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/relay-runtime/util/RelayRuntimeTypes.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file flow-typed/npm/chalk_v4.x.x.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/ReactRelayTypes.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/relay-runtime/network/RelayNetworkTypes.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts/rewrite-modules.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts/release-notes.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts/testDependencies.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/__flowtests__/useRefetchableFragment-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/NestedEntrypoints-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/__flowtests__/utils.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/react-relay/relay-hooks/__flowtests__/useFragment-flowtest.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • + 15 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×34
  • MethodTooLong: ShardedSet.with_hasher compiler/crates/intern/src/sharded_set.rs:39 — MethodTooLong — with_hasher runs 260 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 160 over it, 2.60× 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: ConnectionTransform.transform_connection_selections compiler/crates/relay-transforms/src/transform_connections.rs:132 — MethodTooLong — transform_connection_selections runs 235 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 135 over it, 2.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.
  • MethodTooLong: FragmentResourceImpl.readWithIdentifier packages/react-relay/relay-hooks/legacy/FragmentResource.js:238 — MethodTooLong — readWithIdentifier runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87× 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: RelayReader._readClientEdge REDACTED:1039 — MethodTooLong — _readClientEdge runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83× 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: RscResolverFieldTransform.open_rsc_field compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:315 — MethodTooLong — open_rsc_field runs 179 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 79 over it, 1.79× 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: Config.from_struct compiler/crates/relay-compiler/src/config.rs:643 — MethodTooLong — from_struct runs 177 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 77 over it, 1.77× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: MatchTransform.validate_transform_fragment_spread compiler/crates/relay-transforms/src/match_/match_transform.rs:332 — MethodTooLong — validate_transform_fragment_spread runs 164 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 64 over it, 1.64× 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: RelayResolverExtractor.parse_document compiler/crates/relay-schema-generation/src/lib.rs:246 — MethodTooLong — parse_document runs 157 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 57 over it, 1.57× 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: DeclarativeConnectionMutationTransform.transform_linked_field compiler/crates/relay-transforms/src/declarative_connection.rs:181 — MethodTooLong — transform_linked_field runs 148 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 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: TypeSystemDefinition.fmt compiler/crates/graphql-syntax/src/node/type_system.rs:104 — MethodTooLong — fmt runs 145 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 45 over it, 1.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: QueryResourceImpl._fetchAndSaveQuery packages/react-relay/relay-hooks/QueryResource.js:397 — MethodTooLong — _fetchAndSaveQuery runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38× 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: MatchTransform.validate_transform_linked_field_with_match_directive compiler/crates/relay-transforms/src/match_/match_transform.rs:659 — MethodTooLong — validate_transform_linked_field_with_match_directive 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.
  • MethodTooLong: RelayReader._traverseSelections REDACTED:567 — MethodTooLong — _traverseSelections runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: LiveResolverCache.readFromCacheOrEvaluate packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:111 — MethodTooLong — readFromCacheOrEvaluate runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32× 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: Zero.new compiler/crates/intern/src/atomic_arena.rs:481 — MethodTooLong — new runs 131 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 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.
  • MethodTooLong: RelayResolverSpreadTransform.rebind_selection compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs:458 — MethodTooLong — rebind_selection runs 131 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 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.
  • MethodTooLong: LSPStateResources.build_programs compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:425 — MethodTooLong — build_programs runs 128 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 28 over it, 1.28× 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: CodegenBuilder.build_operation compiler/crates/relay-codegen/src/build_ast.rs:450 — MethodTooLong — build_operation runs 123 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 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.
  • MethodTooLong: RelayResolverExtractor.resolve compiler/crates/relay-schema-generation/src/lib.rs:468 — MethodTooLong — resolve runs 123 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 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.
  • MethodTooLong: RelayResolverFieldTransform.extract_resolver_field_directives compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:145 — MethodTooLong — extract_resolver_field_directives runs 122 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 22 over it, 1.22× 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: Compiler.watch compiler/crates/relay-compiler/src/compiler.rs:174 — MethodTooLong — watch 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.
  • MethodTooLong: DataChecker._traverseSelections packages/relay-runtime/store/DataChecker.js:358 — MethodTooLong — _traverseSelections runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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.
  • MethodTooLong: CodegenBuilder.build_reader_relay_resolver compiler/crates/relay-codegen/src/build_ast.rs:2091 — MethodTooLong — build_reader_relay_resolver runs 118 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 18 over it, 1.18× 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: Parser.parse_optional_arguments compiler/crates/graphql-syntax/src/parser.rs:2211 — MethodTooLong — parse_optional_arguments runs 116 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 16 over it, 1.16× 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: RelayResponseNormalizer._traverseSelections REDACTED:243 — MethodTooLong — _traverseSelections runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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.
  • + 9 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×32
  • FunctionTooLong: relay_lsp::hover::with_resolution_path::get_hover_behavior_from_resolution_path compiler/crates/relay-lsp/src/hover/with_resolution_path.rs:138 — FunctionTooLong — relay_lsp::hover::with_resolution_path::get_hover_behavior_from_resolution_path runs 363 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 263 over it, 3.63× 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: loadQuery.loadQuery packages/react-relay/relay-hooks/loadQuery.js:90 — FunctionTooLong — loadQuery runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14× 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: schema_set::build_in_memory_schema::build_in_memory_schema compiler/crates/schema-set/src/build_in_memory_schema.rs:86 — FunctionTooLong — schema_set::build_in_memory_schema::build_in_memory_schema runs 194 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 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: relay_compiler::artifact_content::content::generate_operation compiler/crates/relay-compiler/src/artifact_content/content.rs:282 — FunctionTooLong — relay_compiler::artifact_content::content::generate_operation runs 187 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 87 over it, 1.87× 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: schema_diff::diff compiler/crates/schema-diff/src/lib.rs:407 — FunctionTooLong — schema_diff::diff runs 186 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 86 over it, 1.86× 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: schema_diff::detect_changes_from_schemas compiler/crates/schema-diff/src/lib.rs:827 — FunctionTooLong — schema_diff::detect_changes_from_schemas runs 173 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 73 over it, 1.73× 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: relay_compiler::build_project::commit_project compiler/crates/relay-compiler/src/build_project.rs:588 — FunctionTooLong — relay_compiler::build_project::commit_project 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: relay_typegen::write::write_fragment_type_exports_section compiler/crates/relay-typegen/src/write.rs:714 — FunctionTooLong — relay_typegen::write::write_fragment_type_exports_section 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: relay_lsp::completion::completion_items_for_request compiler/crates/relay-lsp/src/completion.rs:669 — FunctionTooLong — relay_lsp::completion::completion_items_for_request runs 159 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 59 over it, 1.59× 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: relay_typegen::write::write_operation_type_exports_section compiler/crates/relay-typegen/src/write.rs:353 — FunctionTooLong — relay_typegen::write::write_operation_type_exports_section runs 158 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 58 over it, 1.58× 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: relay_typegen::visit::raw_response_selections_to_babel compiler/crates/relay-typegen/src/visit.rs:1760 — FunctionTooLong — relay_typegen::visit::raw_response_selections_to_babel 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: relay_typegen::visit::make_prop compiler/crates/relay-typegen/src/visit.rs:2076 — FunctionTooLong — relay_typegen::visit::make_prop runs 153 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 53 over it, 1.53× 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: relay_schema_generation::return_type_to_type_annotation compiler/crates/relay-schema-generation/src/lib.rs:1120 — FunctionTooLong — relay_schema_generation::return_type_to_type_annotation runs 147 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 47 over it, 1.47× 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: graphql_ir::signatures::build_fragment_variable_definitions compiler/crates/graphql-ir/src/signatures.rs:265 — FunctionTooLong — graphql_ir::signatures::build_fragment_variable_definitions runs 142 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 42 over it, 1.42× 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: relay_compiler::compiler::build_projects compiler/crates/relay-compiler/src/compiler.rs:644 — FunctionTooLong — relay_compiler::compiler::build_projects runs 134 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 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: relay_typegen::write::write_rsc_resolver_signature_type_assertion compiler/crates/relay-typegen/src/write.rs:98 — FunctionTooLong — relay_typegen::write::write_rsc_resolver_signature_type_assertion runs 134 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 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: ConnectionHandler.update packages/relay-runtime/handlers/connection/ConnectionHandler.js:50 — FunctionTooLong — update runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× 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: relay_compiler::build_project::generate_artifacts::generate_artifacts compiler/crates/relay-compiler/src/build_project/generate_artifacts.rs:51 — FunctionTooLong — relay_compiler::build_project::generate_artifacts::generate_artifacts runs 122 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 22 over it, 1.22× 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: relay_typegen::visit::raw_response_visit_selections compiler/crates/relay-typegen/src/visit.rs:2561 — FunctionTooLong — relay_typegen::visit::raw_response_visit_selections 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: relay_lsp::rename::create_rename_request compiler/crates/relay-lsp/src/rename.rs:129 — FunctionTooLong — relay_lsp::rename::create_rename_request runs 119 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 19 over it, 1.19× 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: relay_typegen::visit::visit_selections compiler/crates/relay-typegen/src/visit.rs:163 — FunctionTooLong — relay_typegen::visit::visit_selections runs 119 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 19 over it, 1.19× 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: relay_compiler::build_project::build_programs compiler/crates/relay-compiler/src/build_project.rs:318 — FunctionTooLong — relay_compiler::build_project::build_programs runs 114 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 14 over it, 1.14× 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: createUpdatableProxy.updateProxyFromSelections REDACTED:55 — FunctionTooLong — updateProxyFromSelections runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) 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.
  • FunctionTooLong: relay_transforms::apply_transforms::apply_common_transforms compiler/crates/relay-transforms/src/apply_transforms.rs:148 — FunctionTooLong — relay_transforms::apply_transforms::apply_common_transforms 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: relay_transforms::apply_transforms::apply_typegen_transforms compiler/crates/relay-transforms/src/apply_transforms.rs:715 — FunctionTooLong — relay_transforms::apply_transforms::apply_typegen_transforms 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.
  • + 7 more in this group — see findings.md.
D10 · Test Quality · No assertions · ×24
  • No assertions: does not throw when expected warning is fired packages/relay-test-utils-internal/__tests__/warnings-test.js:42 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: matches contextual warning packages/relay-test-utils-internal/__tests__/warnings-test.js:47 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: matches contextual warning first packages/relay-test-utils-internal/__tests__/warnings-test.js:51 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: matches multiple contextual warnings first packages/relay-test-utils-internal/__tests__/warnings-test.js:71 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: loads where WeakMap is missing packages/relay-runtime/store/__tests__/DataChecker-ExecTimeS2C-test.js:486 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not error on non-cyclic structure packages/relay-runtime/store/__tests__/RelayModernOperationDescriptor-test.js:56 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not error on cyclic structures that are not part of the query's used variables packages/relay-runtime/store/__tests__/RelayModernOperationDescriptor-test.js:59 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should warn if run() is called during a run() packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2364 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns in __DEV__ if payload data is missing an expected field packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2640 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not warn in __DEV__ if payload data is missing for an abstract field packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2684 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns in __DEV__ if a single response contains conflicting fields with the same id packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2712 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not warn if a single response contains the same fields with the same id packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2776 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not warn if a single response contains the same scalar array value packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2832 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns in __DEV__ if a single response contains conflicting fields with multiple same ids packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2888 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns in __DEV__ if a single response contains conflicting linked fields packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:2968 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns in __DEV__ if a single response contains conflicting linked fields with null values packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:3066 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns in __DEV__ if payload contains inconsistent types for a record packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:3162 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not warn in __DEV__ on inconsistent types for a client record packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:3249 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: does not warn if a single response contains the same fields with the same id packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js:3497 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should warn if fragment reference is non-null but read-out data is null packages/react-relay/relay-hooks/__tests__/useFragmentNode-test.js:1530 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should NOT warn if plural fragment reference is non-null and empty packages/react-relay/relay-hooks/__tests__/useFragmentNode-test.js:1542 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should warn if plural fragment reference is non-null but read-out data is null packages/react-relay/relay-hooks/__tests__/useFragmentNode-test.js:1554 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: warns when variable provider is an impure function packages/react-relay/relay-hooks/__tests__/usePreloadedQuery-provided-variables-test.js:246 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: should compile a query with complex object type packages/react-relay/__tests__/ExampleWithOutputType-test.js:16 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
D3 · God Classes · ClassTooLong · ×18
  • ClassTooLong: CodegenBuilder compiler/crates/relay-codegen/src/build_ast.rs:368 — ClassTooLong — 2093 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 72 methods, 2 blocks, lines 368-3400. The bar is 400 significant lines; this is 1693 over it, 5.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: Parser compiler/crates/graphql-syntax/src/parser.rs:53 — ClassTooLong — 1931 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 150 methods, 2 blocks, lines 53-3150. The bar is 400 significant lines; this is 1531 over it, 4.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: Executor REDACTED:131 — ClassTooLong — 1124 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 724 over it, 2.81× 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: ClientEdgesTransform compiler/crates/relay-transforms/src/client_edges.rs:370 — ClassTooLong — 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 21 methods, 4 blocks, lines 370-1777. The bar is 400 significant lines; this is 335 over it, 1.84× 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: RelayResolverExtractor compiler/crates/relay-schema-generation/src/lib.rs:137 — ClassTooLong — 655 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, 3 blocks, lines 137-1075. The bar is 400 significant lines; this is 255 over it, 1.64× 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: MatchTransform compiler/crates/relay-transforms/src/match_/match_transform.rs:117 — ClassTooLong — 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 8 methods, 3 blocks, lines 117-1024. The bar is 400 significant lines; this is 210 over it, 1.53× 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: Config compiler/crates/relay-compiler/src/config.rs:313 — ClassTooLong — 464 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 4 blocks, lines 313-1597. The bar is 400 significant lines; this is 64 over it, 1.16× 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: FragmentResourceImpl packages/react-relay/relay-hooks/legacy/FragmentResource.js:200 — ClassTooLong — 458 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 58 over it, 1.15× 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: Serializer compiler/crates/schema/src/flatbuffer/serialize.rs:46 — ClassTooLong — 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 2 blocks, lines 46-631. The bar is 400 significant lines; this is 54 over it, 1.14× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ValidateSelectionConflict compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs:79 — ClassTooLong — 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 2 blocks, lines 79-707. The bar is 400 significant lines; this is 45 over it, 1.11× 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: ConnectionValidation compiler/crates/relay-transforms/src/validations/validate_connections.rs:46 — ClassTooLong — 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 13 methods, 3 blocks, lines 46-645. The bar is 400 significant lines; this is 21 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: LSPStateResources compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:56 — ClassTooLong — 420 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 11 methods, 2 blocks, lines 56-667. The bar is 400 significant lines; this is 20 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: CompilerState compiler/crates/relay-compiler/src/compiler_state.rs:331 — ClassTooLong — 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 2 blocks, lines 331-990. The bar is 400 significant lines; this is 14 over it, 1.04× 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: ApplyFragmentArgumentsTransform compiler/crates/relay-transforms/src/apply_fragment_arguments.rs:159 — ClassTooLong — 413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 5 methods, 3 blocks, lines 159-789. The bar is 400 significant lines; this is 13 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: RelayResolverSpreadTransform compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs:101 — ClassTooLong — 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 8 methods, 3 blocks, lines 101-910. The bar is 400 significant lines; this is 9 over it, 1.02× 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: Printer compiler/crates/graphql-text-printer/src/print_to_text.rs:197 — ClassTooLong — 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 31 methods, 2 blocks, lines 197-750. The bar is 400 significant lines; this is 6 over it, 1.02× 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: ValidationContext compiler/crates/schema-validate/src/lib.rs:87 — ClassTooLong — 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 22 methods, 2 blocks, lines 87-727. The bar is 400 significant lines; this is 4 over it, 1.01× 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: LSPState compiler/crates/relay-lsp/src/server/lsp_state.rs:175 — ClassTooLong — 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 13 methods, 3 blocks, lines 175-759. The bar is 400 significant lines; this is 2 over it, 1.01× 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.
D10 · Test Quality · Skipped test · ×17
  • Skipped test: suspends then updates when the query and component load packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js:217 — Skipped — switched off by it.skip
  • Skipped test: warns if the entryPointReference has already been disposed packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js:364 — Skipped — switched off by it.skip
  • Skipped test: suspends while the query and component are pending packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js:157 — Skipped — switched off by it.skip
  • Skipped test: suspends while the component is loading packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js:179 — Skipped — switched off by it.skip
  • Skipped test: suspends then updates when the query and component load packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js:232 — Skipped — switched off by it.skip
  • Skipped test: re-renders and reloads when prefetch params change packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js:365 — Skipped — switched off by it.skip
  • Skipped test: does not suspend if pagination update is interruped before it commits (unsuspends) packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-test.js:1546 — Skipped — switched off by it.skip
  • Skipped test: loads more items correctly after refetching packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-with-suspense-transition-test.js:1091 — Skipped — switched off by xit
  • Skipped test: should handle errors packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js:765 — Skipped — switched off by it.skip
  • Skipped test: simple fetch packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js:923 — Skipped — switched off by test.skip
  • Skipped test: log when switching queries packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js:1000 — Skipped — switched off by test.skip
  • Skipped test: releases and cancels all queries if a the callback is called, the component suspends, another query is called and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-live-query-test.js:647 — Skipped — switched off by it.skip
  • Skipped test: releases and cancels all queries if the component suspends, another query is loaded and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-live-query-test.js:705 — Skipped — switched off by it.skip
  • Skipped test: releases all queries if a the callback is called, the component suspends, another query is called and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-test.js:710 — Skipped — switched off by it.skip
  • Skipped test: releases all queries if the component suspends, another query is loaded and then the component unmounts packages/react-relay/relay-hooks/__tests__/useQueryLoader-test.js:770 — Skipped — switched off by it.skip
  • Skipped test: renders with the results of the new variables on success packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js:585 — Skipped — switched off by it.skip
  • Skipped test: paginates with the results of new refetch/overridden variables packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js:847 — Skipped — switched off by it.skip
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×16
  • Duplicated block (8 lines × 2) compiler/crates/graphql-ir/src/program.rs:45 — compiler/crates/graphql-ir/src/program.rs:45-52 | compiler/crates/program-with-dependencies/src/program_with_dependencies.rs:115-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 (8 lines × 2) compiler/crates/relay-codegen/src/build_ast.rs:2462 — compiler/crates/relay-codegen/src/build_ast.rs:2462-2472 | compiler/crates/relay-codegen/src/build_ast.rs:2617-2624 — 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) compiler/crates/relay-compiler/src/build_project.rs:145 — compiler/crates/relay-compiler/src/build_project.rs:145-152 | compiler/crates/relay-compiler/src/build_project.rs:173-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 (8 lines × 2) compiler/crates/relay-schema-generation/src/lib.rs:717 — compiler/crates/relay-schema-generation/src/lib.rs:717-724 | compiler/crates/relay-schema-generation/src/lib.rs:1021-1028 — 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) compiler/crates/relay-transforms/src/generate_id_field.rs:70 — compiler/crates/relay-transforms/src/generate_id_field.rs:70-77 | compiler/crates/relay-transforms/src/generate_id_field.rs:82-89 — 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) compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:274 — compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:274-281 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:312-323 — 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) compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:68 — compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:68-75 | compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:97-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.
  • Duplicated block (8 lines × 2) compiler/crates/relay-typegen/src/flow.rs:248 — compiler/crates/relay-typegen/src/flow.rs:248-255 | compiler/crates/relay-typegen/src/typescript.rs:266-273 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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) compiler/crates/relay-typegen/src/visit.rs:3425 — compiler/crates/relay-typegen/src/visit.rs:3425-3432 | compiler/crates/relay-typegen/src/visit.rs:3449-3456 — 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) compiler/crates/schema-set/src/build_schema_document.rs:320 — compiler/crates/schema-set/src/build_schema_document.rs:320-327 | compiler/crates/schema-set/src/build_schema_document.rs:350-357 — 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) compiler/crates/schema-set/src/find_subset_violations.rs:400 — compiler/crates/schema-set/src/find_subset_violations.rs:400-407 | compiler/crates/schema-set/src/find_subset_violations.rs:468-475 — 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) compiler/crates/schema-set/src/set_merges.rs:240 — compiler/crates/schema-set/src/set_merges.rs:240-247 | compiler/crates/schema-set/src/set_merges.rs:274-281 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:547 — compiler/crates/schema/src/flatbuffer/wrapper.rs:547-554 | compiler/crates/schema/src/flatbuffer/wrapper.rs:581-588 — 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) compiler/crates/relay-transforms/src/defer_stream/directives.rs:26 — compiler/crates/relay-transforms/src/defer_stream/directives.rs:26-33 | compiler/crates/relay-transforms/src/defer_stream/directives.rs:61-69 — 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) compiler/crates/relay-transforms/src/match_/match_transform.rs:638 — compiler/crates/relay-transforms/src/match_/match_transform.rs:638-645 | compiler/crates/relay-transforms/src/match_/match_transform.rs:648-655 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:202 — compiler/crates/schema/src/flatbuffer/wrapper.rs:202-209 | compiler/crates/schema/src/flatbuffer/wrapper.rs:238-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×16
  • Duplicated block (5 lines × 2) compiler/crates/graphql-ir/src/visitor.rs:69 — compiler/crates/graphql-ir/src/visitor.rs:69-73 | compiler/crates/graphql-syntax/src/visitor.rs:109-113 — 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 (5 lines × 2) compiler/crates/relay-lsp/src/find_field_usages.rs:204 — compiler/crates/relay-lsp/src/find_field_usages.rs:204-208 | compiler/crates/relay-lsp/src/find_field_usages.rs:219-224 — 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 (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:292 — compiler/crates/relay-typegen/src/flow.rs:292-296 | compiler/crates/relay-typegen/src/typescript.rs:335-339 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/schema-set/src/find_subset_violations.rs:423 — compiler/crates/schema-set/src/find_subset_violations.rs:423-427 | compiler/crates/schema-set/src/find_subset_violations.rs:487-493 — 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 (5 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs:237 — compiler/crates/relay-transforms/src/client_component_boundaries.rs:237-241 | compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:617-621 — before extracting anything, compare `compiler/crates/relay-transforms/src/client_component_boundaries.rs` and `compiler/crates/relay-transforms/src/rsc_resolver_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs:246 — compiler/crates/relay-transforms/src/client_component_boundaries.rs:246-250 | compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:626-630 — before extracting anything, compare `compiler/crates/relay-transforms/src/client_component_boundaries.rs` and `compiler/crates/relay-transforms/src/rsc_resolver_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:89 — compiler/crates/relay-typegen/src/flow.rs:89-93 | compiler/crates/relay-typegen/src/typescript.rs:98-102 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:95 — compiler/crates/relay-typegen/src/flow.rs:95-99 | compiler/crates/relay-typegen/src/typescript.rs:104-108 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:101 — compiler/crates/relay-typegen/src/flow.rs:101-105 | compiler/crates/relay-typegen/src/typescript.rs:110-114 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:207 — compiler/crates/relay-typegen/src/flow.rs:207-211 | compiler/crates/relay-typegen/src/typescript.rs:212-216 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:213 — compiler/crates/relay-typegen/src/flow.rs:213-217 | compiler/crates/relay-typegen/src/typescript.rs:218-222 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/relay-typegen/src/flow.rs:326 — compiler/crates/relay-typegen/src/flow.rs:326-330 | compiler/crates/relay-typegen/src/typescript.rs:380-384 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) compiler/crates/schema-print/src/printer.rs:274 — compiler/crates/schema-print/src/printer.rs:274-278 | compiler/crates/schema-print/src/printer.rs:305-309 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) compiler/crates/graphql-ir/src/ir.rs:427 — compiler/crates/graphql-ir/src/ir.rs:427-431 | compiler/crates/graphql-syntax/src/node/executable.rs:216-220 — 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 (5 lines × 2) compiler/crates/schema/src/flatbuffer/serialize.rs:282 — compiler/crates/schema/src/flatbuffer/serialize.rs:282-286 | compiler/crates/schema/src/flatbuffer/serialize.rs:329-333 — 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 (5 lines × 2) compiler/crates/project-fixture/src/lib.rs:141 — compiler/crates/project-fixture/src/lib.rs:141-145 | compiler/crates/project-fixture/src/lib.rs:171-175 — 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.
D30 · Dependency Vulnerabilities · Medium CVE · ×15
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×15
  • Duplicated block (7 lines × 2) compiler/crates/graphql-ir/src/node_identifier.rs:79 — compiler/crates/graphql-ir/src/node_identifier.rs:79-85 | compiler/crates/graphql-ir/src/node_identifier.rs:125-131 — 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) compiler/crates/graphql-ir/src/transform.rs:144 — compiler/crates/graphql-ir/src/transform.rs:144-150 | compiler/crates/graphql-ir/src/transform.rs:185-191 — 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) compiler/crates/graphql-syntax/src/parser.rs:1060 — compiler/crates/graphql-syntax/src/parser.rs:1060-1066 | compiler/crates/graphql-syntax/src/parser.rs:1106-1112 — 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) compiler/crates/relay-compiler/src/compiler_state.rs:479 — compiler/crates/relay-compiler/src/compiler_state.rs:479-485 | compiler/crates/relay-compiler/src/compiler_state.rs:767-773 — 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) compiler/crates/relay-compiler/src/compiler_state.rs:488 — compiler/crates/relay-compiler/src/compiler_state.rs:488-494 | compiler/crates/relay-compiler/src/compiler_state.rs:777-783 — 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) compiler/crates/relay-transforms/src/defer_stream/directives.rs:23 — compiler/crates/relay-transforms/src/defer_stream/directives.rs:23-29 | compiler/crates/relay-transforms/src/defer_stream/directives.rs:53-59 — 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) compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:432 — compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:432-438 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:441-447 — 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) compiler/crates/relay-typegen/src/writer.rs:154 — compiler/crates/relay-typegen/src/writer.rs:154-160 | compiler/crates/relay-typegen/src/writer.rs:212-218 — 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) compiler/crates/schema-set/src/set_exclude.rs:254 — compiler/crates/schema-set/src/set_exclude.rs:254-260 | compiler/crates/schema-set/src/set_exclude.rs:397-403 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) compiler/crates/schema-set/src/set_merges.rs:354 — compiler/crates/schema-set/src/set_merges.rs:354-360 | compiler/crates/schema-set/src/set_merges.rs:428-434 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:374 — compiler/crates/schema/src/flatbuffer/wrapper.rs:374-380 | compiler/crates/schema/src/in_memory.rs:2218-2224 — before extracting anything, compare `compiler/crates/schema/src/flatbuffer/wrapper.rs` and `compiler/crates/schema/src/in_memory.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 (7 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:403 — compiler/crates/schema/src/flatbuffer/wrapper.rs:403-409 | compiler/crates/schema/src/in_memory.rs:2195-2201 — before extracting anything, compare `compiler/crates/schema/src/flatbuffer/wrapper.rs` and `compiler/crates/schema/src/in_memory.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 (7 lines × 2) compiler/crates/schema-set/src/set_type_reference.rs:38 — compiler/crates/schema-set/src/set_type_reference.rs:38-44 | compiler/crates/schema/src/definitions.rs:242-248 — 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) compiler/crates/schema-set/src/set_type_reference.rs:113 — compiler/crates/schema-set/src/set_type_reference.rs:113-119 | compiler/crates/schema/src/definitions.rs:308-314 — 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) compiler/crates/relay-typegen/src/flow.rs:276 — compiler/crates/relay-typegen/src/flow.rs:276-282 | compiler/crates/relay-typegen/src/typescript.rs:318-324 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×15
  • Duplicated block (6 lines × 2) compiler/crates/graphql-ir/src/transform.rs:453 — compiler/crates/graphql-ir/src/transform.rs:453-458 | compiler/crates/relay-transforms/src/apply_fragment_arguments.rs:469-474 — 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) compiler/crates/graphql-syntax/src/parser.rs:751 — compiler/crates/graphql-syntax/src/parser.rs:751-756 | compiler/crates/graphql-syntax/src/parser.rs:786-791 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:183 — compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:183-188 | compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:199-204 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/intern/src/atomic_arena.rs:233 — compiler/crates/intern/src/atomic_arena.rs:233-238 | compiler/crates/intern/src/atomic_arena.rs:631-636 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/schema-print/src/printer.rs:163 — compiler/crates/schema-print/src/printer.rs:163-168 | compiler/crates/schema-print/src/printer.rs:173-178 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/schema-print/src/printer.rs:260 — compiler/crates/schema-print/src/printer.rs:260-265 | compiler/crates/schema-print/src/printer.rs:331-336 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:284 — compiler/crates/schema/src/flatbuffer/wrapper.rs:284-289 | compiler/crates/schema/src/flatbuffer/wrapper.rs:332-337 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:649 — compiler/crates/schema/src/flatbuffer/wrapper.rs:649-654 | compiler/crates/schema/src/flatbuffer/wrapper.rs:732-737 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/schema/src/in_memory.rs:1013 — compiler/crates/schema/src/in_memory.rs:1013-1018 | compiler/crates/schema/src/in_memory.rs:1035-1040 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/graphql-ir/src/visitor.rs:29 — compiler/crates/graphql-ir/src/visitor.rs:29-34 | compiler/crates/graphql-syntax/src/visitor.rs:57-62 — 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) compiler/crates/relay-typegen/src/flow.rs:311 — compiler/crates/relay-typegen/src/flow.rs:311-316 | compiler/crates/relay-typegen/src/typescript.rs:350-355 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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 (6 lines × 2) compiler/crates/schema/src/definitions.rs:444 — compiler/crates/schema/src/definitions.rs:444-449 | compiler/crates/schema/src/definitions/interface.rs:42-47 — 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) compiler/crates/relay-transforms/src/skip_client_extensions.rs:30 — compiler/crates/relay-transforms/src/skip_client_extensions.rs:30-35 | compiler/crates/relay-transforms/src/skip_updatable_queries.rs:15-20 — 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) compiler/crates/relay-compiler/src/compiler_state.rs:636 — compiler/crates/relay-compiler/src/compiler_state.rs:636-641 | compiler/crates/relay-compiler/src/compiler_state.rs:642-647 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) compiler/crates/schema-set/src/print_schema_set.rs:463 — compiler/crates/schema-set/src/print_schema_set.rs:463-468 | compiler/crates/schema-set/src/print_schema_set.rs:472-477 — 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.
S1 · Web-Security Posture · Weak hash algorithm · ×15
  • Weak hash algorithm compiler/crates/common/src/rollout.rs:58 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/common/src/rollout.rs:80 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/docblock-shared/src/resolver_source_hash.rs:44 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-codegen/src/build_ast.rs:3571 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:167 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:314 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:361 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/build_project/build_ir.rs:170 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/build_project/persist_operations.rs:181 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/config.rs:188 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/config.rs:268 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/config.rs:648 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/operation_persister/local_persister.rs:61 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/relay-compiler/src/operation_persister/local_persister.rs:66 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm compiler/crates/signedsource/src/lib.rs:22 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×14
  • Duplicated block (12 lines × 2) compiler/crates/relay-bin/src/main.rs:712 — compiler/crates/relay-bin/src/main.rs:712-723 | compiler/crates/relay-bin/src/main.rs:904-915 — 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) compiler/crates/relay-codegen/src/build_ast.rs:2754 — compiler/crates/relay-codegen/src/build_ast.rs:2754-2765 | compiler/crates/relay-codegen/src/build_ast.rs:2844-2855 — 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) compiler/crates/relay-docblock/src/ir.rs:457 — compiler/crates/relay-docblock/src/ir.rs:457-468 | compiler/crates/relay-docblock/src/ir.rs:511-522 — 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) compiler/crates/relay-transforms/src/declarative_connection.rs:213 — compiler/crates/relay-transforms/src/declarative_connection.rs:213-224 | compiler/crates/relay-transforms/src/declarative_connection.rs:278-289 — 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) compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:77 — compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:77-88 | compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:106-117 — 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) compiler/crates/relay-transforms/src/match_/match_transform.rs:268 — compiler/crates/relay-transforms/src/match_/match_transform.rs:268-279 | compiler/crates/relay-transforms/src/match_/match_transform.rs:282-297 — 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) compiler/crates/relay-transforms/src/server_documents.rs:162 — compiler/crates/relay-transforms/src/server_documents.rs:162-173 | compiler/crates/relay-transforms/src/server_documents.rs:209-220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:229 — compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:229-240 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:280-291 — 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) compiler/crates/relay-typegen/src/writer.rs:446 — compiler/crates/relay-typegen/src/writer.rs:446-457 | compiler/crates/relay-typegen/src/writer.rs:546-557 — 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) compiler/crates/schema-set/src/set_exclude.rs:329 — compiler/crates/schema-set/src/set_exclude.rs:329-340 | compiler/crates/schema-set/src/set_exclude.rs:354-365 — 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) compiler/crates/relay-transforms/src/client_extensions.rs:274 — compiler/crates/relay-transforms/src/client_extensions.rs:274-285 | compiler/crates/relay-transforms/src/skip_client_extensions.rs:128-139 — 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) compiler/crates/relay-typegen/src/flow.rs:181 — compiler/crates/relay-typegen/src/flow.rs:181-192 | compiler/crates/relay-typegen/src/typescript.rs:199-210 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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 (12 lines × 2) compiler/crates/schema-set/src/set_merges.rs:362 — compiler/crates/schema-set/src/set_merges.rs:362-373 | compiler/crates/schema-set/src/set_merges.rs:436-447 — 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) compiler/crates/relay-typegen/src/flow.rs:42 — compiler/crates/relay-typegen/src/flow.rs:42-53 | compiler/crates/relay-typegen/src/typescript.rs:57-68 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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.
D2 · Cognitive Complexity · relay_compiler · ×12
  • relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions (cognitive 60) compiler/crates/relay-compiler/src/graphql_asts.rs:300 — relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions has cognitive complexity 60 (threshold 15). Drivers by points: if/else 10 (35 pts), loops 5 (12 pts), match/switch 3 (12 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_compiler::subschema_extraction::hydrate_output_types (cognitive 59) compiler/crates/relay-compiler/src/subschema_extraction.rs:247 — relay_compiler::subschema_extraction::hydrate_output_types has cognitive complexity 59 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 8 (22 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_compiler::build_project::commit_project (cognitive 45) compiler/crates/relay-compiler/src/build_project.rs:588 — relay_compiler::build_project::commit_project has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 6 (14 pts), match/switch 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_compiler::artifact_content::content::generate_operation (cognitive 33) compiler/crates/relay-compiler/src/artifact_content/content.rs:282 — relay_compiler::artifact_content::content::generate_operation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (2 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.
  • relay_compiler::server_daemon::socket::start_server (cognitive 26) compiler/crates/relay-compiler/src/server_daemon/socket.rs:69 — relay_compiler::server_daemon::socket::start_server has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_compiler::build_project::build_programs (cognitive 24) compiler/crates/relay-compiler/src/build_project.rs:318 — relay_compiler::build_project::build_programs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (7 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.
  • relay_compiler::build_project::build_raw_program_chunks (cognitive 23) compiler/crates/relay-compiler/src/build_project.rs:165 — relay_compiler::build_project::build_raw_program_chunks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_compiler::build_project::generate_artifacts::generate_artifacts (cognitive 23) compiler/crates/relay-compiler/src/build_project/generate_artifacts.rs:51 — relay_compiler::build_project::generate_artifacts::generate_artifacts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 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.
  • relay_compiler::compiler::build_projects (cognitive 20) compiler/crates/relay-compiler/src/compiler.rs:644 — relay_compiler::compiler::build_projects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (7 pts), loops 3, boolean chains 1 (nesting depth added 5). 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.
  • relay_compiler::compiler::get_removed_docblock_artifact_source_keys (cognitive 18) compiler/crates/relay-compiler/src/compiler.rs:895 — relay_compiler::compiler::get_removed_docblock_artifact_source_keys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_compiler::build_project::persist_operations::persist_operations (cognitive 17) compiler/crates/relay-compiler/src/build_project/persist_operations.rs:42 — relay_compiler::build_project::persist_operations::persist_operations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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.
  • relay_compiler::build_project::project_asts::find_changed_names (cognitive 16) compiler/crates/relay-compiler/src/build_project/project_asts.rs:154 — relay_compiler::build_project::project_asts::find_changed_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×11
  • Duplicated block (11 lines × 2) compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:210 — compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:210-220 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:226-236 — 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) compiler/crates/relay-docblock/src/ir.rs:408 — compiler/crates/relay-docblock/src/ir.rs:408-418 | compiler/crates/relay-docblock/src/ir.rs:1208-1218 — 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) compiler/crates/relay-lsp/src/docblock_resolution_info.rs:78 — compiler/crates/relay-lsp/src/docblock_resolution_info.rs:78-88 | compiler/crates/relay-lsp/src/docblock_resolution_info.rs:90-101 — 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) compiler/crates/relay-transforms/src/apply_transforms.rs:211 — compiler/crates/relay-transforms/src/apply_transforms.rs:211-221 | compiler/crates/relay-transforms/src/apply_transforms.rs:756-766 — 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) compiler/crates/relay-transforms/src/client_component_boundaries.rs:177 — compiler/crates/relay-transforms/src/client_component_boundaries.rs:177-187 | compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:569-579 — before extracting anything, compare `compiler/crates/relay-transforms/src/client_component_boundaries.rs` and `compiler/crates/relay-transforms/src/rsc_resolver_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 × 2) compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:261 — compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:261-271 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:299-309 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:77 — compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:77-87 | compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:113-123 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:295 — compiler/crates/schema/src/flatbuffer/wrapper.rs:295-305 | compiler/crates/schema/src/flatbuffer/wrapper.rs:313-323 — 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) compiler/crates/relay-transforms/src/skip_unreachable_node.rs:117 — compiler/crates/relay-transforms/src/skip_unreachable_node.rs:117-127 | compiler/crates/relay-transforms/src/skip_unreachable_node.rs:152-162 — 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) compiler/crates/relay-lsp/src/goto_definition.rs:247 — compiler/crates/relay-lsp/src/goto_definition.rs:247-257 | compiler/crates/relay-lsp/src/goto_definition.rs:274-284 — 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) compiler/crates/relay-lsp/src/server/lsp_state.rs:251 — compiler/crates/relay-lsp/src/server/lsp_state.rs:251-261 | compiler/crates/relay-lsp/src/server/lsp_state.rs:355-365 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×11
  • Duplicated block (9 lines × 2) compiler/crates/graphql-ir/src/transform.rs:492 — compiler/crates/graphql-ir/src/transform.rs:492-500 | compiler/crates/graphql-ir/src/transform.rs:541-549 — 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) compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:191 — compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:191-199 | compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:207-215 — 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) compiler/crates/relay-codegen/src/build_ast.rs:1037 — compiler/crates/relay-codegen/src/build_ast.rs:1037-1045 | compiler/crates/relay-codegen/src/build_ast.rs:1616-1628 — 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) compiler/crates/relay-lsp/src/completion.rs:1038 — compiler/crates/relay-lsp/src/completion.rs:1038-1046 | compiler/crates/relay-lsp/src/completion.rs:1052-1060 — 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) compiler/crates/relay-transforms/src/generate_relay_resolvers_model_fragments.rs:81 — compiler/crates/relay-transforms/src/generate_relay_resolvers_model_fragments.rs:81-89 | compiler/crates/relay-transforms/src/generate_relay_resolvers_model_fragments.rs:113-121 — 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) compiler/crates/relay-transforms/src/inline_fragments.rs:343 — compiler/crates/relay-transforms/src/inline_fragments.rs:343-351 | compiler/crates/relay-transforms/src/inline_fragments.rs:411-419 — 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) compiler/crates/relay-typegen/src/flow.rs:373 — compiler/crates/relay-typegen/src/flow.rs:373-381 | compiler/crates/relay-typegen/src/typescript.rs:392-400 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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) compiler/crates/schema-print/src/printer.rs:225 — compiler/crates/schema-print/src/printer.rs:225-233 | compiler/crates/schema-print/src/printer.rs:246-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 (9 lines × 2) compiler/crates/relay-lsp/src/type_information.rs:118 — compiler/crates/relay-lsp/src/type_information.rs:118-126 | compiler/crates/relay-lsp/src/type_information.rs:128-136 — 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) compiler/crates/graphql-syntax/src/parser.rs:1184 — compiler/crates/graphql-syntax/src/parser.rs:1184-1192 | compiler/crates/graphql-syntax/src/parser.rs:1378-1386 — 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) compiler/crates/schema-set/src/find_subset_violations.rs:778 — compiler/crates/schema-set/src/find_subset_violations.rs:778-786 | compiler/crates/schema-set/src/set_merges.rs:752-760 — 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.
R11 · Import Boundaries · Boundary violation [package · ×11
  • Boundary violation [package:relative-cross-package] REDACTED:14 — REDACTED:14 reaches into another package with a relative path (../relay-runtime/network/RelayObservable) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:13 — packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:13 reaches into another package with a relative path (../../relay-runtime/util/RelayRuntimeTypes) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/loadQuery.js:14 — packages/react-relay/relay-hooks/loadQuery.js:14 reaches into another package with a relative path (../../relay-runtime/network/RelayNetworkTypes) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:14 — packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:14 reaches into another package with a relative path (../../relay-runtime/network/RelayNetworkTypes) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:13 — packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:13 reaches into another package with a relative path (../../relay-runtime/util/RelayRuntimeTypes) — import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:17 — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:17 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/preloadQuery_DEPRECATED) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:18 — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:18 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/RelayEnvironmentProvider) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:19 — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:19 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/useFragment) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:20 — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:20 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/useLazyLoadQuery) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:21 — packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:21 reaches past another workspace package's public entry into its internals with a relative path (../../react-relay/relay-hooks/usePreloadedQuery) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] packages/relay-test-utils/__tests__/RelayResolverTestUtils-test.js:18 — packages/relay-test-utils/__tests__/RelayResolverTestUtils-test.js:18 reaches past another workspace package's public entry into its internals with a relative path (../../relay-runtime/store/ResolverFragments) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
D3 · God Classes · TooManyMethods · ×10
  • TooManyMethods: Parser compiler/crates/graphql-syntax/src/parser.rs:53 — TooManyMethods — 150 methods. The bar is 30 methods; this is 120 over it, 5.00× 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: CodegenBuilder compiler/crates/relay-codegen/src/build_ast.rs:368 — TooManyMethods — 72 methods. The bar is 30 methods; this is 42 over it, 2.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: InMemorySchema compiler/crates/schema/src/in_memory.rs:46 — TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: SDLSchema compiler/crates/schema/src/schema.rs:61 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: SchemaSet compiler/crates/schema-set/src/schema_set.rs:76 — TooManyMethods — 41 methods, declared across 4 files: src/schema_set_collector.rs (19), src/schema_set.rs (18), src/print_schema_set.rs (3), src/set_remove_defined_references.rs (1). The bar is 30 methods; this is 11 over it, 1.37× 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: FlatBufferSchema compiler/crates/schema/src/flatbuffer.rs:50 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× 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: Executor REDACTED:131 — TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: RelayModernStore REDACTED:95 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Printer compiler/crates/schema-print/src/printer.rs:23 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Printer compiler/crates/graphql-text-printer/src/print_to_text.rs:197 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×10
  • Duplicated block (10 lines × 2) compiler/crates/graphql-syntax/src/node/type_system.rs:827 — compiler/crates/graphql-syntax/src/node/type_system.rs:827-836 | compiler/crates/graphql-syntax/src/node/type_system.rs:851-860 — 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) compiler/crates/relay-compiler/src/artifact_content/content.rs:170 — compiler/crates/relay-compiler/src/artifact_content/content.rs:170-179 | compiler/crates/relay-compiler/src/artifact_content/content.rs:311-320 — 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) compiler/crates/relay-compiler/src/artifact_content/content.rs:424 — compiler/crates/relay-compiler/src/artifact_content/content.rs:424-435 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1179-1188 — 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) compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:105 — compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:105-114 | compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:208-217 — 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) compiler/crates/relay-transforms/src/flatten.rs:341 — compiler/crates/relay-transforms/src/flatten.rs:341-350 | compiler/crates/relay-transforms/src/flatten.rs:512-521 — 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) compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:56 — compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:56-65 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:99-109 — 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) compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:335 — compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:335-344 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:359-368 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:596 — compiler/crates/schema/src/flatbuffer/wrapper.rs:596-605 | compiler/crates/schema/src/flatbuffer/wrapper.rs:689-698 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:607 — compiler/crates/schema/src/flatbuffer/wrapper.rs:607-618 | compiler/crates/schema/src/flatbuffer/wrapper.rs:700-709 — 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) compiler/crates/schema/src/flatbuffer/wrapper.rs:672 — compiler/crates/schema/src/flatbuffer/wrapper.rs:672-681 | compiler/crates/schema/src/flatbuffer/wrapper.rs:755-764 — 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.
D2 · Cognitive Complexity · relay_typegen · ×9
  • relay_typegen::visit::make_prop (cognitive 48) compiler/crates/relay-typegen/src/visit.rs:2076 — relay_typegen::visit::make_prop has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 5 (15 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_typegen::visit::raw_response_selections_to_babel (cognitive 42) compiler/crates/relay-typegen/src/visit.rs:1760 — relay_typegen::visit::raw_response_selections_to_babel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_typegen::write::write_fragment_type_exports_section (cognitive 38) compiler/crates/relay-typegen/src/write.rs:714 — relay_typegen::write::write_fragment_type_exports_section has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (26 pts), match/switch 3 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_typegen::visit::relay_resolver_field_type (cognitive 24) compiler/crates/relay-typegen/src/visit.rs:810 — relay_typegen::visit::relay_resolver_field_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_typegen::visit::visit_inline_fragment (cognitive 23) compiler/crates/relay-typegen/src/visit.rs:1017 — relay_typegen::visit::visit_inline_fragment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (4 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.
  • relay_typegen::visit::raw_response_visit_inline_fragment (cognitive 20) compiler/crates/relay-typegen/src/visit.rs:1150 — relay_typegen::visit::raw_response_visit_inline_fragment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (8 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.
  • relay_typegen::visit::group_refs (cognitive 17) compiler/crates/relay-typegen/src/visit.rs:3058 — relay_typegen::visit::group_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, 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.
  • relay_typegen::visit::raw_response_visit_selections (cognitive 16) compiler/crates/relay-typegen/src/visit.rs:2561 — relay_typegen::visit::raw_response_visit_selections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (4 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.
  • relay_typegen::visit::merge_selection (cognitive 16) compiler/crates/relay-typegen/src/visit.rs:3006 — relay_typegen::visit::merge_selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D15 · Churn × Complexity Hotspots · Hotspot · ×8
  • Hotspot: compiler/crates/relay-compiler/src/artifact_content/content.rs compiler/crates/relay-compiler/src/artifact_content/content.rs:282 — compiler/crates/relay-compiler/src/artifact_content/content.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in relay_compiler::artifact_content::content::generate_operation at line 282. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- compiler/crates/relay-compiler/src/artifact_content/content.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: compiler/crates/relay-codegen/src/build_ast.rs compiler/crates/relay-codegen/src/build_ast.rs:450 — compiler/crates/relay-codegen/src/build_ast.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in CodegenBuilder::build_operation at line 450. 1 of those changes was a fix/bug commit, and the other 11 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- compiler/crates/relay-codegen/src/build_ast.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: packages/react-relay/relay-hooks/loadQuery.js packages/react-relay/relay-hooks/loadQuery.js:90 — packages/react-relay/relay-hooks/loadQuery.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in loadQuery.loadQuery at line 90. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- packages/react-relay/relay-hooks/loadQuery.js`: 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: compiler/crates/relay-transforms/src/client_edges.rs compiler/crates/relay-transforms/src/client_edges.rs:1242 — compiler/crates/relay-transforms/src/client_edges.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ClientEdgesTransform::transform_linked_field_impl at line 1242. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- compiler/crates/relay-transforms/src/client_edges.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: REDACTED REDACTED:243 — REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RelayResponseNormalizer._traverseSelections at line 243. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- REDACTED`: 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: compiler/crates/schema/src/in_memory.rs compiler/crates/schema/src/in_memory.rs:784 — compiler/crates/schema/src/in_memory.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in InMemorySchema::build_impl at line 784. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- compiler/crates/schema/src/in_memory.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: compiler/crates/relay-compiler/src/build_project.rs compiler/crates/relay-compiler/src/build_project.rs:588 — compiler/crates/relay-compiler/src/build_project.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in relay_compiler::build_project::commit_project at line 588. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- compiler/crates/relay-compiler/src/build_project.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: compiler/crates/relay-schema-generation/src/lib.rs compiler/crates/relay-schema-generation/src/lib.rs:246 — compiler/crates/relay-schema-generation/src/lib.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RelayResolverExtractor::parse_document at line 246. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 18:13:49 -07:00' --until='2026-10-24 18:13:49 -07:00' --full-history --no-merges -- compiler/crates/relay-schema-generation/src/lib.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.
D1 · Cyclomatic Complexity · relay_compiler · ×7
  • relay_compiler::artifact_content::content::generate_operation (cyclomatic 25) compiler/crates/relay-compiler/src/artifact_content/content.rs:282 — relay_compiler::artifact_content::content::generate_operation has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_compiler::build_project::commit_project (cyclomatic 23) compiler/crates/relay-compiler/src/build_project.rs:588 — relay_compiler::build_project::commit_project has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_compiler::subschema_extraction::hydrate_output_types (cyclomatic 23) compiler/crates/relay-compiler/src/subschema_extraction.rs:247 — relay_compiler::subschema_extraction::hydrate_output_types has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_compiler::server_daemon::socket::start_server (cyclomatic 18) compiler/crates/relay-compiler/src/server_daemon/socket.rs:69 — relay_compiler::server_daemon::socket::start_server has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_compiler::build_project::build_programs (cyclomatic 17) compiler/crates/relay-compiler/src/build_project.rs:318 — relay_compiler::build_project::build_programs 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.
  • relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions (cyclomatic 17) compiler/crates/relay-compiler/src/graphql_asts.rs:300 — relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions 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.
  • relay_compiler::compiler::build_projects (cyclomatic 16) compiler/crates/relay-compiler/src/compiler.rs:644 — relay_compiler::compiler::build_projects 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.
D2 · Cognitive Complexity · CodegenBuilder · ×7
  • CodegenBuilder::build_inline_fragment (cognitive 49) compiler/crates/relay-codegen/src/build_ast.rs:2697 — CodegenBuilder::build_inline_fragment has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 26). 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.
  • CodegenBuilder::build_reader_client_edge (cognitive 34) compiler/crates/relay-codegen/src/build_ast.rs:2552 — CodegenBuilder::build_reader_client_edge has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • CodegenBuilder::build_operation (cognitive 28) compiler/crates/relay-codegen/src/build_ast.rs:450 — CodegenBuilder::build_operation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 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.
  • CodegenBuilder::build_reader_relay_resolver (cognitive 24) compiler/crates/relay-codegen/src/build_ast.rs:2091 — CodegenBuilder::build_reader_relay_resolver has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • CodegenBuilder::build_fragment_metadata (cognitive 19) compiler/crates/relay-codegen/src/build_ast.rs:702 — CodegenBuilder::build_fragment_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 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.
  • CodegenBuilder::build_selections_from_selection (cognitive 17) compiler/crates/relay-codegen/src/build_ast.rs:921 — CodegenBuilder::build_selections_from_selection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 5). 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.
  • CodegenBuilder::build_module_import_selections (cognitive 16) compiler/crates/relay-codegen/src/build_ast.rs:3144 — CodegenBuilder::build_module_import_selections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, match/switch 3 (5 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.
D35 · Change Coupling · Change coupling · ×7
  • Change coupling: useEntryPointLoader.js ↔ useQueryLoader.js packages/react-relay/relay-hooks/useEntryPointLoader.js:1 — `packages/react-relay/relay-hooks/useEntryPointLoader.js` and `packages/react-relay/relay-hooks/useQueryLoader.js` change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `8c30f80f` A couple grammar fixes (#5008); `1fb4eee8` Add type Annotations to the source of sync'ed relay code [4/n]; `bc2aa934` Revert D70524672 — run `git show` on any of them.
  • Change coupling: flow.rs ↔ typescript.rs compiler/crates/relay-typegen/src/flow.rs:1 — `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` change together 71% of the time (25 of the 35 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are `0b4433d0` Make GenericType accept more than one type argument; `00eeeb48` Resolvers that return @weak objects; `5892beae` Make everything sorted by default — run `git show` on any of them.
  • Change coupling: docblocks.rs ↔ lsp_state.rs compiler/crates/relay-compiler/src/docblocks.rs:1 — `compiler/crates/relay-compiler/src/docblocks.rs` and `compiler/crates/relay-lsp/src/server/lsp_state.rs` change together 70% of the time (16 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are `b645a05d` Small ownership change; `e8f5e8fe` remove project config legacy resolver syntax feature flag; `b26f3bef` Remove @outputType feature flag — run `git show` on any of them.
  • Change coupling: docblocks.rs ↔ utils.rs compiler/crates/relay-compiler/src/docblocks.rs:1 — `compiler/crates/relay-compiler/src/docblocks.rs` and `compiler/crates/relay-lsp/src/utils.rs` change together 70% of the time (16 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are `b645a05d` Small ownership change; `e8f5e8fe` remove project config legacy resolver syntax feature flag; `b26f3bef` Remove @outputType feature flag — run `git show` on any of them.
  • Change coupling: validateMutation.js ↔ REDACTED packages/relay-runtime/mutations/validateMutation.js:1 — `packages/relay-runtime/mutations/validateMutation.js` and `REDACTED` change together 50% of the time (17 of the 34 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are `2be1a5b7` Remove legacy ClientComponent runtime handling; `d8978e18` Replace `Function` and `Object` with just `any` in relay; `7e3de722` Turn on `experimental.new_this_typing` in xplat — run `git show` on any of them.
  • Change coupling: validate.rs ↔ validations.rs compiler/crates/relay-compiler/src/build_project/validate.rs:1 — `compiler/crates/relay-compiler/src/build_project/validate.rs` and `compiler/crates/relay-transforms/src/validations.rs` change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are `207b6d0f` Emit disallow_required_on_non_null_field as compiler warnings; `572a90f6` Validate that client schema extensions within @throwOnFieldError have…; `ad262841` Make required-on-non-null-within-throwOnFieldError an LSP warning — run `git show` on any of them.
  • Change coupling: build_schema.rs ↔ lib.rs compiler/crates/relay-compiler/src/build_project/build_schema.rs:1 — `compiler/crates/relay-compiler/src/build_project/build_schema.rs` and `compiler/crates/relay-test-schema/src/lib.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `30321ada` Rename build_schema_with_extensions to build_schema_with_extensions_p…; `d2718289` Transform semanticNonNull into regular non-nullable at schema build time; `d80203a8` Add locations to server sdls in build_schema_with_extensions (#3860) — run `git show` on any of them.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×7
  • Duplicated block (17 lines × 2) compiler/crates/docblock-shared/src/lib.rs:47 — compiler/crates/docblock-shared/src/lib.rs:47-63 | compiler/crates/extract-graphql/src/lib.rs:101-117 — 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 (17 lines × 2) compiler/crates/graphql-ir/src/transform.rs:353 — compiler/crates/graphql-ir/src/transform.rs:353-369 | compiler/crates/relay-transforms/src/fragment_alias_directive.rs:300-316 — 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 (17 lines × 2) compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:145 — compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:145-161 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:277-293 — 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) compiler/crates/relay-typegen/src/write.rs:1298 — compiler/crates/relay-typegen/src/write.rs:1298-1314 | compiler/crates/relay-typegen/src/write.rs:1397-1413 — 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) compiler/crates/relay-typegen/src/write.rs:1335 — compiler/crates/relay-typegen/src/write.rs:1335-1351 | compiler/crates/relay-typegen/src/write.rs:1435-1451 — 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) compiler/crates/schema-set/src/schema_set.rs:376 — compiler/crates/schema-set/src/schema_set.rs:376-392 | compiler/crates/schema-set/src/schema_set.rs:410-426 — 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) compiler/crates/relay-lsp/src/code_action.rs:202 — compiler/crates/relay-lsp/src/code_action.rs:202-220 | compiler/crates/relay-lsp/src/code_action.rs:245-261 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×7
  • Duplicated block (15 lines × 2) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:377 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:377-391 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:398-412 — 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 (15 lines × 2) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:454 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:454-468 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:475-489 — 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 (15 lines × 2) compiler/crates/relay-lsp/src/completion.rs:958 — compiler/crates/relay-lsp/src/completion.rs:958-972 | compiler/crates/relay-lsp/src/completion.rs:1009-1023 — 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 (15 lines × 2) compiler/crates/relay-typegen/src/flow.rs:260 — compiler/crates/relay-typegen/src/flow.rs:260-274 | compiler/crates/relay-typegen/src/typescript.rs:293-307 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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 (15 lines × 2) compiler/crates/relay-typegen/src/flow.rs:356 — compiler/crates/relay-typegen/src/flow.rs:356-370 | compiler/crates/relay-typegen/src/typescript.rs:420-434 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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 (15 lines × 2) compiler/crates/schema/src/in_memory.rs:1528 — compiler/crates/schema/src/in_memory.rs:1528-1542 | compiler/crates/schema/src/in_memory.rs:1564-1578 — 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 (15 lines × 2) compiler/crates/project-fixture/src/lib.rs:151 — compiler/crates/project-fixture/src/lib.rs:151-165 | compiler/crates/project-fixture/src/lib.rs:175-189 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×7
  • Duplicated block (14 lines × 2) compiler/crates/relay-lsp/src/completion.rs:918 — compiler/crates/relay-lsp/src/completion.rs:918-931 | compiler/crates/relay-lsp/src/completion.rs:1207-1220 — 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) compiler/crates/relay-typegen/src/writer.rs:113 — compiler/crates/relay-typegen/src/writer.rs:113-126 | compiler/crates/relay-typegen/src/writer.rs:183-196 — 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) compiler/crates/schema-set/src/from_schema.rs:273 — compiler/crates/schema-set/src/from_schema.rs:273-286 | compiler/crates/schema-set/src/from_schema.rs:305-318 — 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) compiler/crates/schema-set/src/from_schema.rs:512 — compiler/crates/schema-set/src/from_schema.rs:512-525 | compiler/crates/schema-set/src/schema_set_collector.rs:954-967 — 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 (14 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:428 — compiler/crates/schema/src/flatbuffer/wrapper.rs:428-441 | compiler/crates/schema/src/in_memory.rs:2158-2171 — before extracting anything, compare `compiler/crates/schema/src/flatbuffer/wrapper.rs` and `compiler/crates/schema/src/in_memory.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 (14 lines × 2) compiler/crates/schema/src/graphql_schema.rs:140 — compiler/crates/schema/src/graphql_schema.rs:140-153 | compiler/crates/schema/src/graphql_schema.rs:161-174 — 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) compiler/crates/relay-compiler/src/status_reporter.rs:620 — compiler/crates/relay-compiler/src/status_reporter.rs:620-633 | compiler/crates/relay-compiler/src/status_reporter.rs:647-660 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×6
  • Duplicated block (16 lines × 2) compiler/crates/graphql-syntax/src/parser.rs:1506 — compiler/crates/graphql-syntax/src/parser.rs:1506-1521 | compiler/crates/graphql-syntax/src/parser.rs:1538-1553 — 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) compiler/crates/relay-compiler/src/artifact_content/content.rs:264 — compiler/crates/relay-compiler/src/artifact_content/content.rs:264-279 | compiler/crates/relay-compiler/src/artifact_content/content.rs:532-547 — 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) compiler/crates/relay-transforms/src/transform_connections.rs:556 — compiler/crates/relay-transforms/src/transform_connections.rs:556-571 | compiler/crates/relay-transforms/src/transform_connections.rs:584-599 — 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) compiler/crates/schema-set/src/find_subset_violations.rs:333 — compiler/crates/schema-set/src/find_subset_violations.rs:333-348 | compiler/crates/schema-set/src/find_subset_violations.rs:493-508 — 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) compiler/crates/schema/src/flatbuffer/serialize.rs:265 — compiler/crates/schema/src/flatbuffer/serialize.rs:265-280 | compiler/crates/schema/src/flatbuffer/serialize.rs:299-314 — 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) compiler/crates/schema-set/src/ir_collector.rs:143 — compiler/crates/schema-set/src/ir_collector.rs:143-158 | compiler/crates/schema-set/src/ir_collector.rs:171-186 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×6
  • Duplicated block (13 lines × 2) compiler/crates/relay-lsp/src/completion.rs:510 — compiler/crates/relay-lsp/src/completion.rs:510-522 | compiler/crates/relay-lsp/src/completion.rs:565-577 — 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) compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:337 — compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:337-349 | compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:358-370 — 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) compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:67 — compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:67-79 | compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:85-97 — 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) compiler/crates/relay-typegen/src/write.rs:1277 — compiler/crates/relay-typegen/src/write.rs:1277-1289 | compiler/crates/relay-typegen/src/write.rs:1376-1388 — 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) compiler/crates/schema-set/src/ir_collector.rs:203 — compiler/crates/schema-set/src/ir_collector.rs:203-215 | compiler/crates/schema-set/src/ir_collector.rs:259-271 — 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) compiler/crates/schema-set/src/set_remove_defined_references.rs:245 — compiler/crates/schema-set/src/set_remove_defined_references.rs:245-257 | compiler/crates/schema-set/src/set_remove_defined_references.rs:496-508 — 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×6
  • Swallowed exception (empty catch) packages/relay-runtime/util/RelayError.js:45 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:346 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/relay-runtime/handlers/connection/MutationHandlers.js:110 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/relay-runtime/handlers/connection/MutationHandlers.js:114 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/relay-runtime/handlers/connection/MutationHandlers.js:188 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/relay-runtime/handlers/connection/MutationHandlers.js:192 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D2 · Cognitive Complexity · relay_transforms · ×5
  • relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects (cognitive 38) compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:465 — relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_transforms::client_edges::validate_s2c_selections (cognitive 29) compiler/crates/relay-transforms/src/client_edges.rs:1890 — relay_transforms::client_edges::validate_s2c_selections has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (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.
  • relay_transforms::server_documents::validate_server_documents (cognitive 27) compiler/crates/relay-transforms/src/server_documents.rs:126 — relay_transforms::server_documents::validate_server_documents has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 4 (6 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.
  • relay_transforms::connections::connection_util::assert_connection_selections (cognitive 19) compiler/crates/relay-transforms/src/connections/connection_util.rs:34 — relay_transforms::connections::connection_util::assert_connection_selections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 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.
  • relay_transforms::handle_fields::handle_field_util::extract_handle_field_directive_args_helper (cognitive 19) compiler/crates/relay-transforms/src/handle_fields/handle_field_util.rs:161 — relay_transforms::handle_fields::handle_field_util::extract_handle_field_directive_args_helper has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · relay_lsp · ×5
  • relay_lsp::docblock_resolution_info::create_docblock_resolution_info (cognitive 30) compiler/crates/relay-lsp/src/docblock_resolution_info.rs:23 — relay_lsp::docblock_resolution_info::create_docblock_resolution_info has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 1 (3 pts), match/switch 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.
  • relay_lsp::rename::create_rename_request (cognitive 26) compiler/crates/relay-lsp/src/rename.rs:129 — relay_lsp::rename::create_rename_request has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (11 pts), loops 1 (2 pts) (nesting depth added 17). 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.
  • relay_lsp::node_resolution_info::build_node_resolution_info_from_selections (cognitive 22) compiler/crates/relay-lsp/src/node_resolution_info.rs:208 — relay_lsp::node_resolution_info::build_node_resolution_info_from_selections has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_lsp::completion::get_abstract_type_suggestions (cognitive 17) compiler/crates/relay-lsp/src/completion.rs:1404 — relay_lsp::completion::get_abstract_type_suggestions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 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.
  • relay_lsp::node_resolution_info::create_node_resolution_info (cognitive 17) compiler/crates/relay-lsp/src/node_resolution_info.rs:96 — relay_lsp::node_resolution_info::create_node_resolution_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · schema_set · ×5
  • schema_set::find_subset_violations::walk_directive_def_violations (cognitive 23) compiler/crates/schema-set/src/find_subset_violations.rs:512 — schema_set::find_subset_violations::walk_directive_def_violations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts), boolean chains 3, 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.
  • schema_set::find_subset_violations::walk_same_kind_violations (cognitive 18) compiler/crates/schema-set/src/find_subset_violations.rs:174 — schema_set::find_subset_violations::walk_same_kind_violations has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 4 (7 pts), if/else 1 (3 pts) (nesting depth added 9). 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.
  • schema_set::from_schema::convert_output_type_reference_with_semantic_nonnull (cognitive 16) compiler/crates/schema-set/src/from_schema.rs:490 — schema_set::from_schema::convert_output_type_reference_with_semantic_nonnull has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (4 pts), 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.
  • schema_set::merge_sdl_document::build_output_type_reference_with_semantic_nonnull_levels (cognitive 16) compiler/crates/schema-set/src/merge_sdl_document.rs:707 — schema_set::merge_sdl_document::build_output_type_reference_with_semantic_nonnull_levels has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (4 pts), 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.
  • schema_set::schema_set_collector::stringkey_output_type_ref_from_schema_type_with_semantic_nonnull (cognitive 16) compiler/crates/schema-set/src/schema_set_collector.rs:931 — schema_set::schema_set_collector::stringkey_output_type_ref_from_schema_type_with_semantic_nonnull has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (4 pts), 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.
D2 · Cognitive Complexity · SchemaSet · ×4
  • SchemaSet::fix_all_types_impl (cognitive 48) compiler/crates/schema-set/src/schema_set.rs:327 — SchemaSet::fix_all_types_impl has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • SchemaSet::remove_defined_references (cognitive 34) compiler/crates/schema-set/src/set_remove_defined_references.rs:57 — SchemaSet::remove_defined_references has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • SchemaSet::print_definitions_for_used_schema (cognitive 26) compiler/crates/schema-set/src/print_schema_set.rs:72 — SchemaSet::print_definitions_for_used_schema has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 7 (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.
  • SchemaSet::touch_field_argument (cognitive 19) compiler/crates/schema-set/src/schema_set_collector.rs:578 — SchemaSet::touch_field_argument has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CompilerState · ×4
  • CompilerState::merge_file_source_changes (cognitive 46) compiler/crates/relay-compiler/src/compiler_state.rs:720 — CompilerState::merge_file_source_changes has cognitive complexity 46 (threshold 15). Drivers by points: loops 9 (34 pts), if/else 2 (9 pts), match/switch 1 (3 pts) (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • CompilerState::get_dirty_artifact_sources (cognitive 35) compiler/crates/relay-compiler/src/compiler_state.rs:840 — CompilerState::get_dirty_artifact_sources has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 24). 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.
  • CompilerState::from_file_source_changes (cognitive 27) compiler/crates/relay-compiler/src/compiler_state.rs:444 — CompilerState::from_file_source_changes has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (25 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • CompilerState::schema_change_safety (cognitive 27) compiler/crates/relay-compiler/src/compiler_state.rs:626 — CompilerState::schema_change_safety has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 4 (9 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · CompletionRequestBuilder · ×4
  • CompletionRequestBuilder::build_request_from_selections (cognitive 38) compiler/crates/relay-lsp/src/completion.rs:235 — CompletionRequestBuilder::build_request_from_selections has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (32 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • CompletionRequestBuilder::build_request_from_arguments (cognitive 30) compiler/crates/relay-lsp/src/completion.rs:480 — CompletionRequestBuilder::build_request_from_arguments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (9 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • CompletionRequestBuilder::build_request_from_directives (cognitive 22) compiler/crates/relay-lsp/src/completion.rs:605 — CompletionRequestBuilder::build_request_from_directives has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • CompletionRequestBuilder::create_completion_request (cognitive 17) compiler/crates/relay-lsp/src/completion.rs:172 — CompletionRequestBuilder::create_completion_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · relay_docblock · ×4
  • relay_docblock::untyped_representation::parse_untyped_docblock_representation (cognitive 19) compiler/crates/relay-docblock/src/untyped_representation.rs:123 — relay_docblock::untyped_representation::parse_untyped_docblock_representation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_docblock::validate_resolver_schema::validate_output_type_resolver_types (cognitive 17) compiler/crates/relay-docblock/src/validate_resolver_schema.rs:64 — relay_docblock::validate_resolver_schema::validate_output_type_resolver_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2 (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.
  • relay_docblock::validate_resolver_schema::validate_strong_object_implements_client_interface_with_id_field (cognitive 17) compiler/crates/relay-docblock/src/validate_resolver_schema.rs:196 — relay_docblock::validate_resolver_schema::validate_strong_object_implements_client_interface_with_id_field has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • relay_docblock::docblock_ir::validate_fragment_arguments (cognitive 16) compiler/crates/relay-docblock/src/docblock_ir.rs:669 — relay_docblock::docblock_ir::validate_fragment_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, loops 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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×4
  • Duplicated block (13–14 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs:428 — compiler/crates/relay-compiler/src/artifact_content/content.rs:428-440 | compiler/crates/relay-compiler/src/artifact_content/content.rs:790-803 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13–14 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs:608 — compiler/crates/relay-compiler/src/artifact_content/content.rs:608-621 | compiler/crates/relay-compiler/src/artifact_content/content.rs:775-787 — 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–14 lines × 2) compiler/crates/relay-transforms/src/declarative_connection.rs:250 — compiler/crates/relay-transforms/src/declarative_connection.rs:250-262 | compiler/crates/relay-transforms/src/declarative_connection.rs:338-351 — 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–14 lines × 2) compiler/crates/relay-transforms/src/flatten.rs:306 — compiler/crates/relay-transforms/src/flatten.rs:306-319 | compiler/crates/relay-transforms/src/flatten.rs:456-468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (25 lines × 2 locations) · ×4
  • Duplicated block (25 lines × 2 locations) packages/react-relay/ReactRelayFragmentContainer.js:168 — packages/react-relay/ReactRelayFragmentContainer.js:168 · REDACTED:464 — 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 (25 lines × 2 locations) packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:25 — packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:25 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:24 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
  • Duplicated block (25 lines × 2 locations) packages/react-relay/relay-hooks/readFragmentInternal.js:183 — packages/react-relay/relay-hooks/readFragmentInternal.js:183 · REDACTED:385 — 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 (25 lines × 2 locations) packages/relay-runtime/store/cloneRelayHandleSourceField.js:33 — packages/relay-runtime/store/cloneRelayHandleSourceField.js:33 · packages/relay-runtime/store/cloneRelayScalarHandleSourceField.js:32 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
D1 · Cyclomatic Complexity · relay_typegen · ×3
  • relay_typegen::visit::raw_response_selections_to_babel (cyclomatic 21) compiler/crates/relay-typegen/src/visit.rs:1760 — relay_typegen::visit::raw_response_selections_to_babel has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_typegen::write::write_fragment_type_exports_section (cyclomatic 21) compiler/crates/relay-typegen/src/write.rs:714 — relay_typegen::write::write_fragment_type_exports_section has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_typegen::visit::make_prop (cyclomatic 18) compiler/crates/relay-typegen/src/visit.rs:2076 — relay_typegen::visit::make_prop has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · relay_lsp · ×3
  • relay_lsp::docblock_resolution_info::create_docblock_resolution_info (cyclomatic 19) compiler/crates/relay-lsp/src/docblock_resolution_info.rs:23 — relay_lsp::docblock_resolution_info::create_docblock_resolution_info 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.
  • relay_lsp::completion::completion_items_for_request (cyclomatic 18) compiler/crates/relay-lsp/src/completion.rs:669 — relay_lsp::completion::completion_items_for_request has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to one function item inside it that branches. 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.
  • relay_lsp::rename::create_rename_request (cyclomatic 17) compiler/crates/relay-lsp/src/rename.rs:129 — relay_lsp::rename::create_rename_request has cyclomatic complexity 17 (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.
D2 · Cognitive Complexity · schema_diff · ×3
  • schema_diff::diff (cognitive 83) compiler/crates/schema-diff/src/lib.rs:407 — schema_diff::diff has cognitive complexity 83 (threshold 15). Drivers by points: if/else 14 (52 pts), match/switch 7 (20 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • schema_diff::detect_changes_from_schemas (cognitive 61) compiler/crates/schema-diff/src/lib.rs:827 — schema_diff::detect_changes_from_schemas has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 6 (19 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • schema_diff::compare_fields (cognitive 24) compiler/crates/schema-diff/src/lib.rs:121 — schema_diff::compare_fields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · InMemorySchema · ×3
  • InMemorySchema::add_definition (cognitive 54) compiler/crates/schema/src/in_memory.rs:1445 — InMemorySchema::add_definition has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 8 (15 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 29). 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.
  • InMemorySchema::build_impl (cognitive 49) compiler/crates/schema/src/in_memory.rs:784 — InMemorySchema::build_impl has cognitive complexity 49 (threshold 15). Drivers by points: loops 10 (19 pts), match/switch 6 (18 pts), if/else 6 (12 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • InMemorySchema::validate_non_repeatable_directives (cognitive 16) compiler/crates/schema/src/in_memory.rs:1068 — InMemorySchema::validate_non_repeatable_directives has cognitive complexity 16 (threshold 15). Drivers by points: loops 12 (16 pts) (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · MatchTransform · ×3
  • MatchTransform::validate_transform_fragment_spread (cognitive 43) compiler/crates/relay-transforms/src/match_/match_transform.rs:332 — MatchTransform::validate_transform_fragment_spread has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 5, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • MatchTransform::validate_transform_linked_field_with_match_directive (cognitive 39) compiler/crates/relay-transforms/src/match_/match_transform.rs:659 — MatchTransform::validate_transform_linked_field_with_match_directive has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), match/switch 2 (3 pts), loops 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.
  • MatchTransform::get_js_field_args (cognitive 34) compiler/crates/relay-transforms/src/match_/match_transform.rs:229 — MatchTransform::get_js_field_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 1, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ClientEdgesTransform · ×3
  • ClientEdgesTransform::transform_linked_field_impl (cognitive 28) compiler/crates/relay-transforms/src/client_edges.rs:1242 — ClientEdgesTransform::transform_linked_field_impl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, 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.
  • ClientEdgesTransform::get_client_object_for_abstract_type (cognitive 26) compiler/crates/relay-transforms/src/client_edges.rs:805 — ClientEdgesTransform::get_client_object_for_abstract_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ClientEdgesTransform::get_edge_to_client_object_metadata_directive (cognitive 18) compiler/crates/relay-transforms/src/client_edges.rs:585 — ClientEdgesTransform::get_edge_to_client_object_metadata_directive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ValidateSelectionConflict · ×3
  • ValidateSelectionConflict::validate_field_in_set (cognitive 21) compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs:430 — ValidateSelectionConflict::validate_field_in_set has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValidateSelectionConflict::validate_field_pair (cognitive 19) compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs:340 — ValidateSelectionConflict::validate_field_pair has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • ValidateSelectionConflict::prewarm_fragments (cognitive 17) compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs:117 — ValidateSelectionConflict::prewarm_fragments has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D3 · God Classes · TooManyFields · ×3
  • TooManyFields: CodegenConstants compiler/crates/relay-codegen/src/constants.rs:13 — TooManyFields — 134 stored fields. The bar is 30 stored fields; this is 104 over it, 4.47× 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.
  • TooManyFields: FeatureFlags compiler/crates/common/src/feature_flags.rs:32 — TooManyFields — 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30× 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.
  • TooManyFields: Config compiler/crates/relay-compiler/src/config.rs:313 — TooManyFields — 38 stored fields beside 20 methods. The bar is 30 stored fields; this is 8 over it, 1.27× 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.
D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×3
  • Duplicated block (20 lines × 2) compiler/crates/relay-codegen/src/build_ast.rs:1355 — compiler/crates/relay-codegen/src/build_ast.rs:1355-1374 | compiler/crates/relay-codegen/src/build_ast.rs:1455-1474 — 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 (20 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs:205 — compiler/crates/relay-compiler/src/artifact_content/content.rs:205-224 | compiler/crates/relay-compiler/src/artifact_content/content.rs:750-769 — 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 (20 lines × 2) compiler/crates/relay-transforms/src/defer_stream.rs:128 — compiler/crates/relay-transforms/src/defer_stream.rs:128-147 | compiler/crates/relay-transforms/src/defer_stream.rs:232-251 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×3
  • Duplicated block (18 lines × 2) compiler/crates/relay-transforms/src/apply_transforms.rs:256 — compiler/crates/relay-transforms/src/apply_transforms.rs:256-273 | compiler/crates/relay-transforms/src/apply_transforms.rs:771-788 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (18 lines × 2) compiler/crates/relay-transforms/src/client_component_boundaries.rs:329 — compiler/crates/relay-transforms/src/client_component_boundaries.rs:329-346 | compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:666-683 — before extracting anything, compare `compiler/crates/relay-transforms/src/client_component_boundaries.rs` and `compiler/crates/relay-transforms/src/rsc_resolver_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 (18 lines × 2) compiler/crates/schema-set/src/schema_set_collector.rs:433 — compiler/crates/schema-set/src/schema_set_collector.rs:433-450 | compiler/crates/schema-set/src/schema_set_collector.rs:470-487 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×3
  • Duplicated block (15–16 lines × 2) compiler/crates/relay-typegen/src/write.rs:1316 — compiler/crates/relay-typegen/src/write.rs:1316-1331 | compiler/crates/relay-typegen/src/write.rs:1416-1430 — 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 (15–16 lines × 2) compiler/crates/schema-diff/src/lib.rs:843 — compiler/crates/schema-diff/src/lib.rs:843-857 | compiler/crates/schema-diff/src/lib.rs:992-1007 — 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 (15–16 lines × 2) compiler/crates/schema/src/in_memory.rs:678 — compiler/crates/schema/src/in_memory.rs:678-692 | compiler/crates/schema/src/in_memory.rs:915-930 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×3
  • Duplicated block (12–13 lines × 2) compiler/crates/graphql-text-printer/src/print_to_text.rs:555 — compiler/crates/graphql-text-printer/src/print_to_text.rs:555-567 | compiler/crates/graphql-text-printer/src/print_to_text.rs:620-631 — 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–13 lines × 2) compiler/crates/relay-lsp/src/server/lsp_state.rs:320 — compiler/crates/relay-lsp/src/server/lsp_state.rs:320-331 | compiler/crates/relay-lsp/src/utils.rs:217-229 — 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 (12–13 lines × 2) compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:97 — compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:97-108 | compiler/crates/relay-transforms/src/refetchable_fragment/node_query_generator.rs:144-156 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×3
  • Duplicated block (6 lines × 3) compiler/crates/graphql-ir/src/ir.rs:134 — compiler/crates/graphql-ir/src/ir.rs:134-139 | compiler/crates/graphql-ir/src/ir.rs:186-191 | compiler/crates/graphql-ir/src/signatures.rs:110-115 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
  • Duplicated block (6 lines × 3) compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_regular_queries.rs:310 — compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_regular_queries.rs:310-315 | compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs:226-231 | compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs:256-261 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
  • Duplicated block (6 lines × 3) compiler/crates/relay-transforms/src/client_extensions.rs:34 — compiler/crates/relay-transforms/src/client_extensions.rs:34-39 | compiler/crates/relay-transforms/src/client_extensions_abstract_types.rs:33-38 | compiler/crates/relay-transforms/src/sort_selections.rs:25-30 — 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.
R10 · Code Duplication · Duplicated block (18 lines × 2 locations) · ×3
  • Duplicated block (18 lines × 2 locations) packages/react-relay/relay-hooks/EntryPointContainer.react.js:55 — packages/react-relay/relay-hooks/EntryPointContainer.react.js:55 · packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:219 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
  • Duplicated block (18 lines × 2 locations) REDACTED:300 — REDACTED:300 · REDACTED:351 — 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 (18 lines × 2 locations) REDACTED:1321 — REDACTED:1321 · REDACTED:1494 — 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.
D1 · Cyclomatic Complexity · schema_diff · ×2
  • schema_diff::detect_changes_from_schemas (cyclomatic 43) compiler/crates/schema-diff/src/lib.rs:827 — schema_diff::detect_changes_from_schemas has cyclomatic complexity 43 (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.
  • schema_diff::diff (cyclomatic 39) compiler/crates/schema-diff/src/lib.rs:407 — schema_diff::diff has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · InMemorySchema · ×2
  • InMemorySchema::add_definition (cyclomatic 37) compiler/crates/schema/src/in_memory.rs:1445 — InMemorySchema::add_definition has cyclomatic complexity 37 (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.
  • InMemorySchema::build_impl (cyclomatic 36) compiler/crates/schema/src/in_memory.rs:784 — InMemorySchema::build_impl has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Compiler · ×2
  • Compiler::watch (cyclomatic 23) compiler/crates/relay-compiler/src/compiler.rs:174 — Compiler::watch has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Compiler::incremental_build_loop (cyclomatic 20) compiler/crates/relay-compiler/src/compiler.rs:392 — Compiler::incremental_build_loop has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlattenTransform · ×2
  • FlattenTransform::can_flatten_selections (cyclomatic 23) compiler/crates/relay-transforms/src/flatten.rs:406 — FlattenTransform::can_flatten_selections has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • FlattenTransform::flatten_selections (cyclomatic 17) compiler/crates/relay-transforms/src/flatten.rs:286 — FlattenTransform::flatten_selections has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · MatchTransform · ×2
  • MatchTransform::validate_transform_fragment_spread (cyclomatic 22) compiler/crates/relay-transforms/src/match_/match_transform.rs:332 — MatchTransform::validate_transform_fragment_spread 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.
  • MatchTransform::validate_transform_linked_field_with_match_directive (cyclomatic 22) compiler/crates/relay-transforms/src/match_/match_transform.rs:659 — MatchTransform::validate_transform_linked_field_with_match_directive has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SchemaSet · ×2
  • SchemaSet::fix_all_types_impl (cyclomatic 19) compiler/crates/schema-set/src/schema_set.rs:327 — SchemaSet::fix_all_types_impl 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.
  • SchemaSet::remove_defined_references (cyclomatic 18) compiler/crates/schema-set/src/set_remove_defined_references.rs:57 — SchemaSet::remove_defined_references has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CompilerState · ×2
  • CompilerState::schema_change_safety (cyclomatic 18) compiler/crates/relay-compiler/src/compiler_state.rs:626 — CompilerState::schema_change_safety 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.
  • CompilerState::merge_file_source_changes (cyclomatic 17) compiler/crates/relay-compiler/src/compiler_state.rs:720 — CompilerState::merge_file_source_changes has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · relay_transforms · ×2
  • relay_transforms::client_edges::validate_s2c_selections (cyclomatic 18) compiler/crates/relay-transforms/src/client_edges.rs:1890 — relay_transforms::client_edges::validate_s2c_selections has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects (cyclomatic 16) compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:465 — relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CodegenBuilder · ×2
  • CodegenBuilder::build_inline_fragment (cyclomatic 17) compiler/crates/relay-codegen/src/build_ast.rs:2697 — CodegenBuilder::build_inline_fragment 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.
  • CodegenBuilder::build_reader_client_edge (cyclomatic 16) compiler/crates/relay-codegen/src/build_ast.rs:2552 — CodegenBuilder::build_reader_client_edge 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.
D17 · Explicit Debt · FixmeComment · ×2
  • FixmeComment compiler/crates/relay-compiler/src/build_project/build_resolvers_schema/ir_to_schema.rs:21 — // FIXME: Use the base project's schema config where needed — 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.
  • FixmeComment compiler/crates/relay-compiler/src/build_project/build_resolvers_schema/ir_to_schema.rs:22 — /// FIXME: Move to relay-docblock crate — 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.
D2 · Cognitive Complexity · graphql_ir · ×2
  • graphql_ir::signatures::build_fragment_variable_definitions (cognitive 64) compiler/crates/graphql-ir/src/signatures.rs:265 — graphql_ir::signatures::build_fragment_variable_definitions has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 3 (15 pts) (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • graphql_ir::transform::transform_list_multi (cognitive 17) compiler/crates/graphql-ir/src/transform.rs:516 — graphql_ir::transform::transform_list_multi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Compiler · ×2
  • Compiler::incremental_build_loop (cognitive 51) compiler/crates/relay-compiler/src/compiler.rs:392 — Compiler::incremental_build_loop has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (42 pts), match/switch 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Compiler::watch (cognitive 44) compiler/crates/relay-compiler/src/compiler.rs:174 — Compiler::watch has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlattenTransform · ×2
  • FlattenTransform::can_flatten_selections (cognitive 47) compiler/crates/relay-transforms/src/flatten.rs:406 — FlattenTransform::can_flatten_selections has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 5 (17 pts), boolean chains 7, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • FlattenTransform::flatten_selections (cognitive 37) compiler/crates/relay-transforms/src/flatten.rs:286 — FlattenTransform::flatten_selections has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 6 (21 pts), if/else 4 (13 pts), boolean chains 2, loops 1 (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RelayResolverSpreadTransform · ×2
  • RelayResolverSpreadTransform::rebind_selection (cognitive 46) compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs:458 — RelayResolverSpreadTransform::rebind_selection has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 4 (9 pts), boolean chains 5 (nesting depth added 25). 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.
  • RelayResolverSpreadTransform::clone_shadowed_path (cognitive 16) compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs:333 — RelayResolverSpreadTransform::clone_shadowed_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser · ×2
  • Parser::parse_optional_arguments (cognitive 40) compiler/crates/graphql-syntax/src/parser.rs:2211 — Parser::parse_optional_arguments has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Parser::parse_value (cognitive 21) compiler/crates/graphql-syntax/src/parser.rs:2443 — Parser::parse_value has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (6 pts), loops 2 (6 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FileCategorizer · ×2
  • FileCategorizer::categorize (cognitive 40) compiler/crates/relay-compiler/src/file_source/file_categorizer.rs:247 — FileCategorizer::categorize has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 1 (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.
  • FileCategorizer::from_config (cognitive 20) compiler/crates/relay-compiler/src/file_source/file_categorizer.rs:152 — FileCategorizer::from_config has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (9 pts), if/else 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · RelayResolverExtractor · ×2
  • RelayResolverExtractor::parse_document (cognitive 32) compiler/crates/relay-schema-generation/src/lib.rs:246 — RelayResolverExtractor::parse_document has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • RelayResolverExtractor::extract_function (cognitive 20) compiler/crates/relay-schema-generation/src/lib.rs:842 — RelayResolverExtractor::extract_function has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 5 (7 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · JSONPrinter · ×2
  • JSONPrinter::print_ast (cognitive 30) compiler/crates/relay-codegen/src/printer.rs:472 — JSONPrinter::print_ast has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • JSONPrinter::collect_value_duplicates (cognitive 19) compiler/crates/relay-codegen/src/printer.rs:439 — JSONPrinter::collect_value_duplicates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · (anonymous) · ×2
  • (anonymous)::invalidateDataIDs (cognitive 30) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:726 — (anonymous)::invalidateDataIDs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::_setResolverValue (cognitive 26) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:536 — (anonymous)::_setResolverValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LSPStateResources · ×2
  • LSPStateResources::internal_watch (cognitive 24) compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:82 — LSPStateResources::internal_watch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (4 pts), loops 2 (3 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.
  • LSPStateResources::build_programs (cognitive 23) compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:425 — LSPStateResources::build_programs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 7 (11 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Printer · ×2
  • Printer::print_value (cognitive 23) compiler/crates/graphql-text-printer/src/print_to_text.rs:550 — Printer::print_value has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). 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.
  • Printer::print_constant_value (cognitive 22) compiler/crates/graphql-text-printer/src/print_to_text.rs:605 — Printer::print_constant_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · (anonymous) (cognitive 19) · ×2
  • (anonymous) (cognitive 19) packages/react-relay/relay-hooks/useQueryLoader.js:252 — (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (2 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.
  • (anonymous) (cognitive 19) packages/relay-runtime/handlers/connection/MutationHandlers.js:169 — (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1, other 1 (nesting depth added 7). None of this is in the body itself: all 19 points belong to 3 function items inside it that branch (a function literal at line 170, nodeUpdater, a function literal at line 218). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · (anonymous) (cognitive 16) · ×2
  • (anonymous) (cognitive 16) packages/react-relay/relay-hooks/useLoadMoreFunction.js:154 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). Of this number, 11 points are the body's own statements and 5 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous) (cognitive 16) packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js:149 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). Of this number, 11 points are the body's own statements and 5 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium advisory (unsound) · ×2
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium vulnerability · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) compiler/crates/relay-codegen/src/printer.rs:220 — compiler/crates/relay-codegen/src/printer.rs:220-245 | compiler/crates/relay-codegen/src/printer.rs:277-292 | compiler/crates/relay-codegen/src/printer.rs:299-314 | compiler/crates/relay-codegen/src/printer.rs:322-338 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) compiler/crates/relay-compiler-playground/src/lib.rs:130 — compiler/crates/relay-compiler-playground/src/lib.rs:130-158 | compiler/crates/relay-compiler-playground/src/lib.rs:177-201 | compiler/crates/relay-compiler-playground/src/lib.rs:223-265 | compiler/crates/relay-compiler-playground/src/lib.rs:280-311 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×2
  • Duplicated block (28 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs:64 — compiler/crates/relay-compiler/src/artifact_content/content.rs:64-91 | compiler/crates/relay-compiler/src/artifact_content/content.rs:324-351 — 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 (28 lines × 2) compiler/crates/relay-typegen/src/visit.rs:1846 — compiler/crates/relay-typegen/src/visit.rs:1846-1873 | compiler/crates/relay-typegen/src/visit.rs:1902-1929 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×2
  • Duplicated block (23 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs:246 — compiler/crates/relay-compiler/src/artifact_content/content.rs:246-268 | compiler/crates/relay-compiler/src/artifact_content/content.rs:433-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.
  • Duplicated block (23 lines × 2) compiler/crates/relay-compiler/src/build_project.rs:386 — compiler/crates/relay-compiler/src/build_project.rs:386-408 | compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:488-510 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×2
  • Duplicated block (19 lines × 2) compiler/crates/graphql-ir/src/transform.rs:123 — compiler/crates/graphql-ir/src/transform.rs:123-141 | compiler/crates/graphql-ir/src/transform.rs:164-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:105 — compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:105-123 | compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:180-198 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (17–18 lines × 2) · ×2
  • Duplicated block (17–18 lines × 2) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:295 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:295-312 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:319-335 — 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–18 lines × 2) compiler/crates/schema/src/in_memory.rs:1696 — compiler/crates/schema/src/in_memory.rs:1696-1713 | compiler/crates/schema/src/in_memory.rs:1756-1772 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (12–14 lines × 2) · ×2
  • Duplicated block (12–14 lines × 2) compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:248 — compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:248-261 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:315-326 — 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–14 lines × 2) compiler/crates/schema-set/src/schema_set_collector.rs:420 — compiler/crates/schema-set/src/schema_set_collector.rs:420-431 | compiler/crates/schema-set/src/schema_set_collector.rs:455-468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×2
  • Duplicated block (9 lines × 3) compiler/crates/relay-compiler-playground/src/lib.rs:133 — compiler/crates/relay-compiler-playground/src/lib.rs:133-141 | compiler/crates/relay-compiler-playground/src/lib.rs:180-188 | compiler/crates/relay-compiler-playground/src/lib.rs:283-291 — 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 (9 lines × 3) compiler/crates/relay-transforms/src/match_/match_transform.rs:252 — compiler/crates/relay-transforms/src/match_/match_transform.rs:252-262 | compiler/crates/relay-transforms/src/match_/match_transform.rs:267-275 | compiler/crates/relay-transforms/src/match_/match_transform.rs:281-293 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×2
  • Duplicated block (7 lines × 3) compiler/crates/relay-transforms/src/connections/connection_util.rs:236 — compiler/crates/relay-transforms/src/connections/connection_util.rs:236-242 | compiler/crates/relay-transforms/src/connections/connection_util.rs:256-262 | compiler/crates/relay-transforms/src/connections/connection_util.rs:276-282 — 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 (7 lines × 3) compiler/crates/schema-set/src/find_subset_violations.rs:401 — compiler/crates/schema-set/src/find_subset_violations.rs:401-407 | compiler/crates/schema-set/src/find_subset_violations.rs:469-475 | compiler/crates/schema-set/src/find_subset_violations.rs:555-562 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×2
  • Duplicated block (6–7 lines × 2) compiler/crates/graphql-syntax/src/parser.rs:2824 — compiler/crates/graphql-syntax/src/parser.rs:2824-2830 | compiler/crates/graphql-syntax/src/parser.rs:2888-2893 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6–7 lines × 2) compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:240 — compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:240-246 | compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:250-255 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×2
  • Duplicated block (10 lines × 3) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:525 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:525-534 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:540-549 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:625-634 — 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 (10 lines × 3) compiler/crates/schema-set/src/find_subset_violations.rs:202 — compiler/crates/schema-set/src/find_subset_violations.rs:202-211 | compiler/crates/schema-set/src/find_subset_violations.rs:231-240 | compiler/crates/schema-set/src/find_subset_violations.rs:267-276 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×2
  • Duplicated block (8 lines × 3) compiler/crates/schema/src/flatbuffer/wrapper.rs:202 — compiler/crates/schema/src/flatbuffer/wrapper.rs:202-209 | compiler/crates/schema/src/flatbuffer/wrapper.rs:238-245 | compiler/crates/schema/src/flatbuffer/wrapper.rs:258-265 — 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 (8 lines × 3) compiler/crates/graphql-syntax/src/parser.rs:859 — compiler/crates/graphql-syntax/src/parser.rs:859-866 | compiler/crates/graphql-syntax/src/parser.rs:1186-1193 | compiler/crates/graphql-syntax/src/parser.rs:1380-1387 — 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×2
  • Low cohesion: SchemaSet (LCOM4 5) compiler/crates/schema-set/src/schema_set.rs:76 — SchemaSet'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: EnsureCatch (LCOM4 4) compiler/crates/relay-transforms/src/validations/validate_client_schema_extensions_use_catch.rs:45 — EnsureCatch'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.
R10 · Code Duplication · Duplicated block (62 lines × 2 locations) · ×2
  • Duplicated block (62 lines × 2 locations) flow-typed/npm/chalk_v4.x.x.js:39 — flow-typed/npm/chalk_v4.x.x.js:39 · flow-typed/npm/chalk_v4.x.x.js:107 — all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
  • Duplicated block (62 lines × 2 locations) packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js:32 — packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js:32 · packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js:32 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block with local edits (49 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (49 matched lines × 2 locations) packages/react-relay/relay-hooks/useEntryPointLoader.js:112 — packages/react-relay/relay-hooks/useEntryPointLoader.js:112 · packages/react-relay/relay-hooks/useQueryLoader.js:179 — the two spans are one implementation copied and then locally edited — 269 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (49 matched lines × 2 locations) packages/react-relay/relay-hooks/usePaginationFragment.js:34 — packages/react-relay/relay-hooks/usePaginationFragment.js:34 · packages/react-relay/relay-hooks/useRefetchableFragment.js:27 — the two spans are one implementation copied and then locally edited — 259 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (20 lines × 2 locations) · ×2
  • Duplicated block (20 lines × 2 locations) packages/relay-runtime/store/RelayModernSelector.js:264 — packages/relay-runtime/store/RelayModernSelector.js:264 · packages/relay-runtime/store/RelayModernSelector.js:367 — 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 (20 lines × 2 locations) packages/relay-runtime/store/RelayStoreSubscriptions.js:147 — packages/relay-runtime/store/RelayStoreSubscriptions.js:147 · packages/relay-runtime/store/RelayStoreSubscriptions.js:168 — 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.
R7 · Dead Code · Dead file (~25 LoC) · ×2
  • Dead file (~25 LoC) packages/react-relay/relay-hooks/InternalLogger.js — no import path from any entry point (38 application, 104 tooling, 396 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 (~25 LoC) packages/relay-runtime/store/generateTypenamePrefixedDataID.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~23 LoC) · ×2
  • Dead file (~23 LoC) flow-typed/npm/invariant_v2.x.x.js — no import path from any entry point (38 application, 104 tooling, 396 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) packages/react-relay/rsc-client_EXPERIMENTAL.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~22 LoC) · ×2
  • Dead file (~22 LoC) packages/react-relay/__flowtests__/RelayModernFlowtest_badref.graphql.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
  • Dead file (~22 LoC) packages/react-relay/__flowtests__/RelayModernFlowtest_notref.graphql.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~20 LoC) · ×2
  • Dead file (~20 LoC) packages/react-relay/__flowtests__/RelayModernFlowtest_user.graphql.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 3 in-repo import(s) from 3 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js, packages/react-relay/__flowtests__/RelayModernFlowtest_badref.graphql.js, packages/react-relay/__flowtests__/RelayModernFlowtest_notref.graphql.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
  • Dead file (~20 LoC) packages/react-relay/__flowtests__/RelayModernFlowtest_users.graphql.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R8 · Dependency Hygiene · Unlisted import 'JSResourceReference' · ×2
  • Unlisted import 'JSResourceReference' packages/react-relay/relay-hooks/EntryPointTypes.flow.js:16 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
  • Unlisted import 'JSResourceReference' packages/relay-runtime/util/NormalizationNode.js:16 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
D1 · Cyclomatic Complexity · createContainerWithFragments (cyclomatic 68) · ×1
  • createContainerWithFragments (cyclomatic 68) REDACTED:319 — createContainerWithFragments has cyclomatic complexity 68 (threshold 15). Of this number, 57 points are the body's own statements and 11 belong to 15 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 48) · ×1
  • (anonymous) (cyclomatic 48) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:405 — (anonymous) has cyclomatic complexity 48 (threshold 15). Most of this is not in the body itself: 1 of the 48 points is its own statement and the rest belongs to 17 function items inside it that branch (_setResolverValue, invalidateDataIDs, _isInvalid, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · createContainerWithFragments (cyclomatic 45) · ×1
  • createContainerWithFragments (cyclomatic 45) packages/react-relay/ReactRelayRefetchContainer.js:70 — createContainerWithFragments has cyclomatic complexity 45 (threshold 15). Of this number, 28 points are the body's own statements and 17 belong to 15 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · update (cyclomatic 41) · ×1
  • update (cyclomatic 41) packages/relay-runtime/handlers/connection/ConnectionHandler.js:50 — update has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _traverseSelections (cyclomatic 36) · ×1
  • _traverseSelections (cyclomatic 36) REDACTED:567 — _traverseSelections has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · readWithIdentifier (cyclomatic 36) · ×1
  • readWithIdentifier (cyclomatic 36) packages/react-relay/relay-hooks/legacy/FragmentResource.js:238 — readWithIdentifier has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 35) · ×1
  • (anonymous) (cyclomatic 35) REDACTED:233 — (anonymous) has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 12 function items inside it that branch (_runWithoutNotifying, run, _publishSourceFromPayload, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · ExecTimeS2CDataChecker.toChecks (cyclomatic 34) · ×1
  • ExecTimeS2CDataChecker.toChecks (cyclomatic 34) packages/relay-runtime/store/ExecTimeS2CDataChecker.js:215 — ExecTimeS2CDataChecker.toChecks has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to one function literal inside it that branches (line 222). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · extract_graphql · ×1
  • extract_graphql::extract (cyclomatic 31) compiler/crates/extract-graphql/src/lib.rs:121 — extract_graphql::extract has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _readClientEdge (cyclomatic 30) · ×1
  • _readClientEdge (cyclomatic 30) REDACTED:1039 — _readClientEdge has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · loadQuery (cyclomatic 30) · ×1
  • loadQuery (cyclomatic 30) packages/react-relay/relay-hooks/loadQuery.js:90 — loadQuery has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 27 function items inside it that branch (cancelNetworkRequest, checkAvailabilityAndExecute, a function literal at line 356, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · updateProxyFromSelections (cyclomatic 30) · ×1
  • updateProxyFromSelections (cyclomatic 30) REDACTED:55 — updateProxyFromSelections has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · readFragmentInternal (cyclomatic 29) · ×1
  • readFragmentInternal (cyclomatic 29) packages/react-relay/relay-hooks/readFragmentInternal.js:152 — readFragmentInternal has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RelayResolverSpreadTransform · ×1
  • RelayResolverSpreadTransform::rebind_selection (cyclomatic 28) compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs:458 — RelayResolverSpreadTransform::rebind_selection has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DataChecker._traverseSelections (cyclomatic 28) · ×1
  • DataChecker._traverseSelections (cyclomatic 28) packages/relay-runtime/store/DataChecker.js:358 — DataChecker._traverseSelections has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to one function literal inside it that branches (line 362). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · RelayResponseNormalizer._traverseSelections (cyclomatic 27) · ×1
  • RelayResponseNormalizer._traverseSelections (cyclomatic 27) REDACTED:243 — RelayResponseNormalizer._traverseSelections has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · recycleNodesInto.recycleNodesIntoImpl (cyclomatic 27) · ×1
  • recycleNodesInto.recycleNodesIntoImpl (cyclomatic 27) packages/relay-runtime/util/recycleNodesInto.js:22 — recycleNodesInto.recycleNodesIntoImpl has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · RelayObservable.subscribe (cyclomatic 27) · ×1
  • RelayObservable.subscribe (cyclomatic 27) packages/relay-runtime/network/RelayObservable.js:506 — RelayObservable.subscribe has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · Executor._handleNext (cyclomatic 26) · ×1
  • Executor._handleNext (cyclomatic 26) REDACTED:587 — Executor._handleNext has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RelayReferenceMarker._traverseSelections (cyclomatic 25) · ×1
  • RelayReferenceMarker._traverseSelections (cyclomatic 25) packages/relay-runtime/store/RelayReferenceMarker.js:128 — RelayReferenceMarker._traverseSelections has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 132). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · SchemaChange · ×1
  • SchemaChange::get_safety (cyclomatic 24) compiler/crates/schema-diff/src/check.rs:69 — SchemaChange::get_safety has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RelayModernStore.notify (cyclomatic 24) · ×1
  • RelayModernStore.notify (cyclomatic 24) REDACTED:471 — RelayModernStore.notify has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rangeDelete (cyclomatic 24) · ×1
  • rangeDelete (cyclomatic 24) packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js:235 — rangeDelete has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 253, 270, 296). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · ConnectionTransform · ×1
  • ConnectionTransform::transform_connection_selections (cyclomatic 23) compiler/crates/relay-transforms/src/transform_connections.rs:132 — ConnectionTransform::transform_connection_selections has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · readFromCacheOrEvaluate (cyclomatic 23) · ×1
  • readFromCacheOrEvaluate (cyclomatic 23) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:111 — readFromCacheOrEvaluate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _traverseSelections (cyclomatic 23) · ×1
  • _traverseSelections (cyclomatic 23) packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:257 — _traverseSelections has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RelayResponseNormalizer._normalizeField (cyclomatic 22) · ×1
  • RelayResponseNormalizer._normalizeField (cyclomatic 22) REDACTED:609 — RelayResponseNormalizer._normalizeField has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · preloadQueryDeduped (cyclomatic 22) · ×1
  • preloadQueryDeduped (cyclomatic 22) packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:147 — preloadQueryDeduped has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SourcePrinter · ×1
  • SourcePrinter::write_span_with_highlight_style (cyclomatic 21) compiler/crates/graphql-cli/src/source_printer.rs:31 — SourcePrinter::write_span_with_highlight_style has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DeclarativeConnectionMutationTransform · ×1
  • DeclarativeConnectionMutationTransform::transform_linked_field (cyclomatic 21) compiler/crates/relay-transforms/src/declarative_connection.rs:181 — DeclarativeConnectionMutationTransform::transform_linked_field has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · SkipRedundantNodesTransform · ×1
  • SkipRedundantNodesTransform::transform_selection (cyclomatic 21) compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:208 — SkipRedundantNodesTransform::transform_selection has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _collect (cyclomatic 21) · ×1
  • _collect (cyclomatic 21) REDACTED:891 — _collect has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · graphql_ir · ×1
  • graphql_ir::signatures::build_fragment_variable_definitions (cyclomatic 20) compiler/crates/graphql-ir/src/signatures.rs:265 — graphql_ir::signatures::build_fragment_variable_definitions has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Parser · ×1
  • Parser::parse_optional_arguments (cyclomatic 20) compiler/crates/graphql-syntax/src/parser.rs:2211 — Parser::parse_optional_arguments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: Parser::parse_directive_location (cyclomatic 22) 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.
D1 · Cyclomatic Complexity · relay_codegen · ×1
  • relay_codegen::printer::write_constant_value (cyclomatic 20) compiler/crates/relay-codegen/src/printer.rs:890 — relay_codegen::printer::write_constant_value has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · RelayModernStore.updateTargetFromSource (cyclomatic 20) · ×1
  • RelayModernStore.updateTargetFromSource (cyclomatic 20) REDACTED:1045 — RelayModernStore.updateTargetFromSource has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · update (cyclomatic 20) · ×1
  • update (cyclomatic 20) packages/relay-runtime/store/RelayModernRecord.js:346 — update has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _fetchAndSaveQuery (cyclomatic 20) · ×1
  • _fetchAndSaveQuery (cyclomatic 20) packages/react-relay/relay-hooks/QueryResource.js:397 — _fetchAndSaveQuery has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body's own statements and 8 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LSPStateResources · ×1
  • LSPStateResources::build_programs (cyclomatic 19) compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:425 — LSPStateResources::build_programs 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.
D1 · Cyclomatic Complexity · ShadowResolversTransform · ×1
  • ShadowResolversTransform::validate_resolver_metadata (cyclomatic 19) compiler/crates/relay-transforms/src/relay_resolvers/shadow_transform.rs:98 — ShadowResolversTransform::validate_resolver_metadata has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · RscResolverFieldTransform · ×1
  • RscResolverFieldTransform::open_rsc_field (cyclomatic 19) compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:315 — RscResolverFieldTransform::open_rsc_field has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · rewrite-modules.default (cyclomatic 19) · ×1
  • rewrite-modules.default (cyclomatic 19) scripts/rewrite-modules.js:39 — rewrite-modules.default has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (transformRequireCall, transformJestHelper, transformImport, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · ArtifactGeneratedTypes · ×1
  • ArtifactGeneratedTypes::from_operation (cyclomatic 18) compiler/crates/relay-compiler/src/build_project/artifact_generated_types.rs:28 — ArtifactGeneratedTypes::from_operation has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · relay_schema_generation · ×1
  • relay_schema_generation::return_type_to_type_annotation (cyclomatic 18) compiler/crates/relay-schema-generation/src/lib.rs:1120 — relay_schema_generation::return_type_to_type_annotation 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.
D1 · Cyclomatic Complexity · ClientEdgesTransform · ×1
  • ClientEdgesTransform::transform_linked_field_impl (cyclomatic 18) compiler/crates/relay-transforms/src/client_edges.rs:1242 — ClientEdgesTransform::transform_linked_field_impl has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _propagateResolverMetadata (cyclomatic 18) · ×1
  • _propagateResolverMetadata (cyclomatic 18) REDACTED:935 — _propagateResolverMetadata has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · constructor (cyclomatic 18) · ×1
  • constructor (cyclomatic 18) REDACTED:108 — constructor has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FileCategorizer · ×1
  • FileCategorizer::categorize (cyclomatic 17) compiler/crates/relay-compiler/src/file_source/file_categorizer.rs:247 — FileCategorizer::categorize has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RelayResolverExtractor · ×1
  • RelayResolverExtractor::parse_document (cyclomatic 17) compiler/crates/relay-schema-generation/src/lib.rs:246 — RelayResolverExtractor::parse_document has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · createContainerWithFragments (cyclomatic 17) · ×1
  • createContainerWithFragments (cyclomatic 17) packages/react-relay/ReactRelayFragmentContainer.js:47 — createContainerWithFragments has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GenerateDataDrivenDependencyMetadata · ×1
  • GenerateDataDrivenDependencyMetadata::extract_module_entries_from_selections (cyclomatic 16) compiler/crates/relay-transforms/src/generate_data_driven_dependency_metadata.rs:71 — GenerateDataDrivenDependencyMetadata::extract_module_entries_from_selections has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _registerPlaceholders (cyclomatic 16) · ×1
  • _registerPlaceholders (cyclomatic 16) REDACTED:581 — _registerPlaceholders has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · getSingularSelector (cyclomatic 16) · ×1
  • getSingularSelector (cyclomatic 16) packages/relay-runtime/store/RelayModernSelector.js:67 — getSingularSelector has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D17 · Explicit Debt · HackComment · ×1
  • HackComment compiler/crates/extract-graphql/src/lib.rs:226 — // Hack for template literals containing /*, see D21256605: — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D2 · Cognitive Complexity · _readClientEdge (cognitive 96) · ×1
  • _readClientEdge (cognitive 96) REDACTED:1039 — _readClientEdge has cognitive complexity 96 (threshold 15). Drivers by points: if/else 24 (63 pts), ternaries 6 (22 pts), boolean chains 4, other 4, loops 1 (3 pts) (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · createContainerWithFragments (cognitive 76) · ×1
  • createContainerWithFragments (cognitive 76) REDACTED:319 — createContainerWithFragments has cognitive complexity 76 (threshold 15). Drivers by points: if/else 28 (33 pts), ternaries 20 (22 pts), boolean chains 17, loops 2, other 2 (nesting depth added 7). Of this number, 65 points are the body's own statements and 11 belong to 15 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · update (cognitive 71) · ×1
  • update (cognitive 71) packages/relay-runtime/handlers/connection/ConnectionHandler.js:50 — update has cognitive complexity 71 (threshold 15). Drivers by points: if/else 27 (52 pts), boolean chains 16, ternaries 1 (2 pts), other 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · extract_graphql · ×1
  • extract_graphql::extract (cognitive 68) compiler/crates/extract-graphql/src/lib.rs:121 — extract_graphql::extract has cognitive complexity 68 (threshold 15). Drivers by points: if/else 9 (36 pts), loops 5 (14 pts), match/switch 4 (14 pts), boolean chains 4 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SourcePrinter · ×1
  • SourcePrinter::write_span_with_highlight_style (cognitive 54) compiler/crates/graphql-cli/src/source_printer.rs:31 — SourcePrinter::write_span_with_highlight_style has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (47 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · updateTargetFromSource (cognitive 53) · ×1
  • updateTargetFromSource (cognitive 53) REDACTED:1045 — updateTargetFromSource has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 2 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 33). Of this number, 43 points are the body's own statements and 10 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · createContainerWithFragments (cognitive 51) · ×1
  • createContainerWithFragments (cognitive 51) packages/react-relay/ReactRelayRefetchContainer.js:70 — createContainerWithFragments has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 15, ternaries 11, other 2, loops 1 (nesting depth added 5). Of this number, 34 points are the body's own statements and 17 belong to 15 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · SchemaChange · ×1
  • SchemaChange::get_safety (cognitive 49) compiler/crates/schema-diff/src/check.rs:69 — SchemaChange::get_safety has cognitive complexity 49 (threshold 15). Drivers by points: if/else 8 (32 pts), loops 3 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 35). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · readWithIdentifier (cognitive 47) · ×1
  • readWithIdentifier (cognitive 47) packages/react-relay/relay-hooks/legacy/FragmentResource.js:238 — readWithIdentifier has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 7, ternaries 5 (7 pts), other 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.
D2 · Cognitive Complexity · (anonymous) (cognitive 46) · ×1
  • (anonymous) (cognitive 46) REDACTED:233 — (anonymous) has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 11, ternaries 1 (nesting depth added 8). None of this is in the body itself: all 46 points belong to 12 function items inside it that branch (_runWithoutNotifying, _applyUpdates::processUpdate, run, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · _traverseSelections (cognitive 45) · ×1
  • _traverseSelections (cognitive 45) REDACTED:567 — _traverseSelections has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 4, match/switch 1 (2 pts), other 2, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _collect (cognitive 45) · ×1
  • _collect (cognitive 45) REDACTED:891 — _collect has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 3 (5 pts), boolean chains 3, other 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · loadQuery (cognitive 45) · ×1
  • loadQuery (cognitive 45) packages/react-relay/relay-hooks/loadQuery.js:90 — loadQuery has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 5 (11 pts), boolean chains 10, other 2 (nesting depth added 13). Of this number, 16 points are the body's own statements and 29 belong to 27 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _handleNext (cognitive 44) · ×1
  • _handleNext (cognitive 44) REDACTED:587 — _handleNext has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 5, loops 1 (2 pts), ternaries 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · readFromCacheOrEvaluate (cognitive 43) · ×1
  • readFromCacheOrEvaluate (cognitive 43) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:111 — readFromCacheOrEvaluate has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 1 (4 pts), boolean chains 3, other 3, ternaries 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DeclarativeConnectionMutationTransform · ×1
  • DeclarativeConnectionMutationTransform::transform_linked_field (cognitive 42) compiler/crates/relay-transforms/src/declarative_connection.rs:181 — DeclarativeConnectionMutationTransform::transform_linked_field has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 7 (18 pts), boolean chains 3 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · SkipRedundantNodesTransform · ×1
  • SkipRedundantNodesTransform::transform_selection (cognitive 42) compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:208 — SkipRedundantNodesTransform::transform_selection has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 2, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · _processFollowupPayload (cognitive 40) · ×1
  • _processFollowupPayload (cognitive 40) REDACTED:1109 — _processFollowupPayload has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 3 (9 pts), error handling 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 23). Most of this is not in the body itself: 10 of the 40 points are its own statements and the rest belongs to 10 function items inside it that branch ((anonymous)::next, (anonymous)::next::publishModuleImportPayload, a function literal at line 1157, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · GenerateDataDrivenDependencyMetadata · ×1
  • GenerateDataDrivenDependencyMetadata::extract_module_entries_from_selections (cognitive 39) compiler/crates/relay-transforms/src/generate_data_driven_dependency_metadata.rs:71 — GenerateDataDrivenDependencyMetadata::extract_module_entries_from_selections has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (12 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ConnectionTransform · ×1
  • ConnectionTransform::transform_connection_selections (cognitive 39) compiler/crates/relay-transforms/src/transform_connections.rs:132 — ConnectionTransform::transform_connection_selections has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _normalizeField (cognitive 39) · ×1
  • _normalizeField (cognitive 39) REDACTED:609 — _normalizeField has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _registerPlaceholders (cognitive 37) · ×1
  • _registerPlaceholders (cognitive 37) REDACTED:581 — _registerPlaceholders has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (10 pts), ternaries 1 (4 pts), other 3, boolean chains 1 (nesting depth added 19). Of this number, 36 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · readFragmentInternal (cognitive 37) · ×1
  • readFragmentInternal (cognitive 37) packages/react-relay/relay-hooks/readFragmentInternal.js:152 — readFragmentInternal has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 7 (11 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · subscribe (cognitive 36) · ×1
  • subscribe (cognitive 36) packages/relay-runtime/network/RelayObservable.js:506 — subscribe has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 7 (13 pts), boolean chains 9 (nesting depth added 8). Most of this is not in the body itself: 11 of the 36 points are its own statements and the rest belongs to 8 function items inside it that branch (doCleanup, error, unsubscribe, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · ArtifactGeneratedTypes · ×1
  • ArtifactGeneratedTypes::from_operation (cognitive 34) compiler/crates/relay-compiler/src/build_project/artifact_generated_types.rs:28 — ArtifactGeneratedTypes::from_operation has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 5, 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.
D2 · Cognitive Complexity · _propagateResolverMetadata (cognitive 34) · ×1
  • _propagateResolverMetadata (cognitive 34) REDACTED:935 — _propagateResolverMetadata has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (9 pts), boolean chains 2, other 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _traverseSelections (cognitive 34) · ×1
  • _traverseSelections (cognitive 34) packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:257 — _traverseSelections has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 1 (2 pts), other 2, boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RefetchableDirective · ×1
  • RefetchableDirective::from_directive (cognitive 33) compiler/crates/relay-transforms/src/refetchable_fragment/refetchable_directive.rs:54 — RefetchableDirective::from_directive has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (11 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RelayReferenceMarker._traverseClientEdgeToClientObject (cognitive 33) · ×1
  • RelayReferenceMarker._traverseClientEdgeToClientObject (cognitive 33) packages/relay-runtime/store/RelayReferenceMarker.js:247 — RelayReferenceMarker._traverseClientEdgeToClientObject has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 2 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · update (cognitive 31) · ×1
  • update (cognitive 31) packages/relay-runtime/store/RelayModernRecord.js:346 — update has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, other 4, ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LiveResolverCache.invalidateDataIDs (cognitive 30) · ×1
  • LiveResolverCache.invalidateDataIDs (cognitive 30) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:726 — LiveResolverCache.invalidateDataIDs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rangeDelete (cognitive 30) · ×1
  • rangeDelete (cognitive 30) packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js:235 — rangeDelete has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 7, loops 1 (2 pts), ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 253, 270, 296). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · preloadQueryDeduped (cognitive 30) · ×1
  • preloadQueryDeduped (cognitive 30) packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:147 — preloadQueryDeduped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 7 (9 pts), boolean chains 5, other 2 (nesting depth added 7). Of this number, 23 points are the body's own statements and 7 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · (anonymous) (cognitive 29) · ×1
  • (anonymous) (cognitive 29) REDACTED:275 — (anonymous) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 2 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). None of this is in the body itself: all 29 points belong to 9 function items inside it that branch (a function literal at line 280, a function literal at line 319, subscribeToSnapshot, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · DataChecker._traverseSelections (cognitive 28) · ×1
  • DataChecker._traverseSelections (cognitive 28) packages/relay-runtime/store/DataChecker.js:358 — DataChecker._traverseSelections has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 1 (nesting depth added 11). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 362). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · useFragmentInternal_CURRENT.subscribeToSnapshot (cognitive 28) · ×1
  • useFragmentInternal_CURRENT.subscribeToSnapshot (cognitive 28) REDACTED:246 — useFragmentInternal_CURRENT.subscribeToSnapshot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (8 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 292, 256, 325). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · (anonymous) (cognitive 28) · ×1
  • (anonymous) (cognitive 28) REDACTED:251 — (anonymous) has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (8 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). None of this is in the body itself: all 28 points belong to 9 function items inside it that branch (a function literal at line 292, a function literal at line 256, subscribeToSnapshot, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · RelayResolverFieldTransform · ×1
  • RelayResolverFieldTransform::extract_resolver_field_directives (cognitive 27) compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:145 — RelayResolverFieldTransform::extract_resolver_field_directives has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RelayResponseNormalizer._traverseSelections (cognitive 27) · ×1
  • RelayResponseNormalizer._traverseSelections (cognitive 27) REDACTED:243 — RelayResponseNormalizer._traverseSelections has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), ternaries 2 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · notify (cognitive 27) · ×1
  • notify (cognitive 27) REDACTED:471 — notify has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 9 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · _fetchAndSaveQuery (cognitive 27) · ×1
  • _fetchAndSaveQuery (cognitive 27) packages/react-relay/relay-hooks/QueryResource.js:397 — _fetchAndSaveQuery has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (error, start, complete, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · ResolverIr · ×1
  • ResolverIr::field_relay_resolver_directive (cognitive 26) compiler/crates/relay-docblock/src/ir.rs:491 — ResolverIr::field_relay_resolver_directive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ExecTimeS2CDataChecker.toChecks (cognitive 26) · ×1
  • ExecTimeS2CDataChecker.toChecks (cognitive 26) packages/relay-runtime/store/ExecTimeS2CDataChecker.js:215 — ExecTimeS2CDataChecker.toChecks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, ternaries 1 (2 pts), match/switch 1 (nesting depth added 10). None of this is in the body itself: all 26 points belong to one function literal inside it that branches (line 222). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · dependency_analyzer · ×1
  • dependency_analyzer::ir::get_reachable_ir (cognitive 25) compiler/crates/dependency-analyzer/src/ir.rs:58 — dependency_analyzer::ir::get_reachable_ir has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · relay_schema_generation · ×1
  • relay_schema_generation::return_type_to_type_annotation (cognitive 25) compiler/crates/relay-schema-generation/src/lib.rs:1120 — relay_schema_generation::return_type_to_type_annotation has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 5 (9 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · createContainerWithFragments (cognitive 25) · ×1
  • createContainerWithFragments (cognitive 25) packages/react-relay/ReactRelayFragmentContainer.js:47 — createContainerWithFragments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, other 2, ternaries 2, loops 1 (nesting depth added 6). Of this number, 24 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · updateProxyFromSelections (cognitive 24) · ×1
  • updateProxyFromSelections (cognitive 24) REDACTED:55 — updateProxyFromSelections has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (6 pts), other 5, match/switch 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 19 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UpdatableDirective · ×1
  • UpdatableDirective::validate_inline_fragments_with_parent (cognitive 23) compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:163 — UpdatableDirective::validate_inline_fragments_with_parent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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.
D2 · Cognitive Complexity · validateField (cognitive 23) · ×1
  • validateField (cognitive 23) packages/relay-runtime/mutations/validateMutation.js:178 — validateField has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, match/switch 1 (nesting depth added 10). Of this number, 19 points are the body's own statements and 4 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · SkipUnreachableNodeTransform · ×1
  • SkipUnreachableNodeTransform::transform_program (cognitive 22) compiler/crates/relay-transforms/src/skip_unreachable_node.rs:94 — SkipUnreachableNodeTransform::transform_program has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DeprecatedFields · ×1
  • DeprecatedFields::validate_directive (cognitive 22) compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:151 — DeprecatedFields::validate_directive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · LiveResolverCache._setResolverValue (cognitive 22) · ×1
  • LiveResolverCache._setResolverValue (cognitive 22) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:536 — LiveResolverCache._setResolverValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ApplyFragmentArgumentsTransform · ×1
  • ApplyFragmentArgumentsTransform::transform_no_inline_fragment (cognitive 21) compiler/crates/relay-transforms/src/apply_fragment_arguments.rs:511 — ApplyFragmentArgumentsTransform::transform_no_inline_fragment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot (cognitive 21) · ×1
  • useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot (cognitive 21) REDACTED:271 — useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 280, 319, 358). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · (anonymous) (cognitive 21) · ×1
  • (anonymous) (cognitive 21) packages/relay-runtime/handlers/connection/MutationHandlers.js:96 — (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1, other 1 (nesting depth added 8). None of this is in the body itself: all 21 points belong to 3 function items inside it that branch (a function literal at line 97, edgeUpdater, a function literal at line 147). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · MutationHandlers.edgeUpdater (cognitive 20) · ×1
  • MutationHandlers.edgeUpdater (cognitive 20) packages/relay-runtime/handlers/connection/MutationHandlers.js:94 — MutationHandlers.edgeUpdater has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 97). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · _normalizeActorChange (cognitive 20) · ×1
  • _normalizeActorChange (cognitive 20) REDACTED:724 — _normalizeActorChange has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · merge (cognitive 20) · ×1
  • merge (cognitive 20) packages/relay-runtime/store/RelayModernRecord.js:417 — merge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 4, other 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.
D2 · Cognitive Complexity · ProjectArtifactMap · ×1
  • ProjectArtifactMap::fmt (cognitive 19) compiler/crates/relay-compiler/src/compiler_state.rs:368 — ProjectArtifactMap::fmt has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 2 (6 pts), if/else 1 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RelayDirective · ×1
  • RelayDirective::find (cognitive 19) compiler/crates/relay-transforms/src/relay_directive.rs:49 — RelayDirective::find has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ShadowResolversTransform · ×1
  • ShadowResolversTransform::validate_resolver_metadata (cognitive 19) compiler/crates/relay-transforms/src/relay_resolvers/shadow_transform.rs:98 — ShadowResolversTransform::validate_resolver_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, 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.
D2 · Cognitive Complexity · RelayResolverAbstractTypesTransform · ×1
  • RelayResolverAbstractTypesTransform::transform_selections_given_parent_type (cognitive 19) compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:222 — RelayResolverAbstractTypesTransform::transform_selections_given_parent_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowPrinter · ×1
  • FlowPrinter::write_object (cognitive 19) compiler/crates/relay-typegen/src/flow.rs:234 — FlowPrinter::write_object has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ValidationContext · ×1
  • ValidationContext::validate_type_implements_interface (cognitive 19) compiler/crates/schema-validate/src/lib.rs:414 — ValidationContext::validate_type_implements_interface has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rewrite-modules.default (cognitive 19) · ×1
  • rewrite-modules.default (cognitive 19) scripts/rewrite-modules.js:39 — rewrite-modules.default has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (transformRequireCall, transformJestHelper, transformImport, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · RelayErrorTrie.buildErrorTrie (cognitive 19) · ×1
  • RelayErrorTrie.buildErrorTrie (cognitive 19) packages/relay-runtime/store/RelayErrorTrie.js:55 — RelayErrorTrie.buildErrorTrie has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RelayReader._readInlineFragment (cognitive 19) · ×1
  • RelayReader._readInlineFragment (cognitive 19) REDACTED:1668 — RelayReader._readInlineFragment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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.
D2 · Cognitive Complexity · recycleNodesInto.recycleNodesIntoImpl (cognitive 19) · ×1
  • recycleNodesInto.recycleNodesIntoImpl (cognitive 19) packages/relay-runtime/util/recycleNodesInto.js:22 — recycleNodesInto.recycleNodesIntoImpl has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 3, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · GraphModeHandler._populateRecord (cognitive 19) · ×1
  • GraphModeHandler._populateRecord (cognitive 19) packages/relay-runtime/store/RelayExperimentalGraphResponseHandler.js:79 — GraphModeHandler._populateRecord has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (5 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). Of this number, 14 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · constructor (cognitive 19) · ×1
  • constructor (cognitive 19) REDACTED:108 — constructor has cognitive complexity 19 (threshold 15). Drivers by points: other 11, if/else 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UpdatableFragmentSpread · ×1
  • UpdatableFragmentSpread::validate_fragment_spread_and_mark_enclosing_linked_field (cognitive 18) compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs:84 — UpdatableFragmentSpread::validate_fragment_spread_and_mark_enclosing_linked_field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ClientExtensionsTransform · ×1
  • ClientExtensionsTransform::transform_selections (cognitive 18) compiler/crates/relay-transforms/src/client_extensions.rs:128 — ClientExtensionsTransform::transform_selections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RequiredDirective · ×1
  • RequiredDirective::assert_compatible_required_children (cognitive 18) compiler/crates/relay-transforms/src/required_directive.rs:305 — RequiredDirective::assert_compatible_required_children has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2, 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.
D2 · Cognitive Complexity · RscResolverFieldTransform · ×1
  • RscResolverFieldTransform::open_rsc_field (cognitive 18) compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:315 — RscResolverFieldTransform::open_rsc_field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · TypeScriptPrinter · ×1
  • TypeScriptPrinter::write_object_literal (cognitive 18) compiler/crates/relay-typegen/src/typescript.rs:279 — TypeScriptPrinter::write_object_literal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UsedSchemaIRCollector · ×1
  • UsedSchemaIRCollector::add_used_type_definitions (cognitive 18) compiler/crates/schema-set/src/ir_collector.rs:83 — UsedSchemaIRCollector::add_used_type_definitions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MutationHandlers.nodeUpdater (cognitive 18) · ×1
  • MutationHandlers.nodeUpdater (cognitive 18) packages/relay-runtime/handlers/connection/MutationHandlers.js:167 — MutationHandlers.nodeUpdater has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 170). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · _processPayloadFollowups (cognitive 18) · ×1
  • _processPayloadFollowups (cognitive 18) REDACTED:1013 — _processPayloadFollowups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, other 2, ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 1019, 1027, 1038, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · act (cognitive 18) · ×1
  • act (cognitive 18) packages/react-relay/jest-react/internalAct.js:39 — act has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (nesting depth added 3). Of this number, 13 points are the body's own statements and 5 belong to 7 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · SchemaChangeDefinitionFinder · ×1
  • SchemaChangeDefinitionFinder::add_type_changes (cognitive 17) compiler/crates/dependency-analyzer/src/schema_change_analyzer.rs:133 — SchemaChangeDefinitionFinder::add_type_changes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · relay_codegen · ×1
  • relay_codegen::printer::write_argument_value (cognitive 17) compiler/crates/relay-codegen/src/printer.rs:819 — relay_codegen::printer::write_argument_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ClientProjection · ×1
  • ClientProjection::project_selection_set (cognitive 17) compiler/crates/relay-transforms/src/client_normalization.rs:184 — ClientProjection::project_selection_set has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProvidedVariableDefinitions · ×1
  • ProvidedVariableDefinitions::get_errors (cognitive 17) compiler/crates/relay-transforms/src/provided_variable_fragment_transform.rs:80 — ProvidedVariableDefinitions::get_errors has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 3 (7 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ValidateOperationVariables · ×1
  • ValidateOperationVariables::transform_operation (cognitive 17) compiler/crates/relay-transforms/src/validate_operation_variables.rs:77 — ValidateOperationVariables::transform_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RelayReferenceMarker._traverseSelections (cognitive 17) · ×1
  • RelayReferenceMarker._traverseSelections (cognitive 17) packages/relay-runtime/store/RelayReferenceMarker.js:128 — RelayReferenceMarker._traverseSelections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 6). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 132). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · checkMissedUpdates (cognitive 17) · ×1
  • checkMissedUpdates (cognitive 17) packages/react-relay/relay-hooks/legacy/FragmentResource.js:695 — checkMissedUpdates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · getSingularSelector (cognitive 17) · ×1
  • getSingularSelector (cognitive 17) packages/relay-runtime/store/RelayModernSelector.js:67 — getSingularSelector has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · handleFieldErrors (cognitive 17) · ×1
  • handleFieldErrors (cognitive 17) packages/relay-runtime/util/handlePotentialSnapshotErrors.js:22 — handleFieldErrors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 1 (5 pts), match/switch 1 (3 pts), 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.
D2 · Cognitive Complexity · Transformer · ×1
  • Transformer::default_transform_program (cognitive 16) compiler/crates/graphql-ir/src/transform.rs:35 — Transformer::default_transform_program has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LinkedField · ×1
  • LinkedField::resolve (cognitive 16) compiler/crates/resolution-path/src/lib.rs:771 — LinkedField::resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · graphql_text_printer · ×1
  • graphql_text_printer::prettier_schema_printer::expanded_directive_doc (cognitive 16) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:973 — graphql_text_printer::prettier_schema_printer::expanded_directive_doc has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (7 pts), if/else 3 (5 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Scope · ×1
  • Scope::push (cognitive 16) compiler/crates/relay-transforms/src/apply_fragment_arguments/scope.rs:60 — Scope::push has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compileGraphQLTag.createNode (cognitive 16) · ×1
  • compileGraphQLTag.createNode (cognitive 16) packages/babel-plugin-relay/compileGraphQLTag.js:229 — compileGraphQLTag.createNode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (3 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · RelayModernRecord.setErrors (cognitive 16) · ×1
  • RelayModernRecord.setErrors (cognitive 16) packages/relay-runtime/store/RelayModernRecord.js:488 — RelayModernRecord.setErrors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RelayReader._readClientSideDirectiveField (cognitive 16) · ×1
  • RelayReader._readClientSideDirectiveField (cognitive 16) REDACTED:745 — RelayReader._readClientSideDirectiveField has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RelayReferenceMarker.mark (cognitive 16) · ×1
  • RelayReferenceMarker.mark (cognitive 16) packages/relay-runtime/store/RelayReferenceMarker.js:89 — RelayReferenceMarker.mark has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · insertEdgeBefore (cognitive 16) · ×1
  • insertEdgeBefore (cognitive 16) packages/relay-runtime/handlers/connection/ConnectionHandler.js:471 — insertEdgeBefore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commitMutation (cognitive 16) · ×1
  • commitMutation (cognitive 16) packages/relay-runtime/mutations/commitMutation.js:81 — commitMutation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (next, complete, a function literal at line 162). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (62 shared lines) · ×1
  • Near-duplicate member pair (62 shared lines) compiler/crates/relay-typegen/src/write.rs:1274 — compiler/crates/relay-typegen/src/write.rs:1274-1351 | compiler/crates/relay-typegen/src/write.rs:1371-1451 — These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (27 shared lines) · ×1
  • Near-duplicate member pair (27 shared lines) compiler/crates/relay-typegen/src/flow.rs:234 — compiler/crates/relay-typegen/src/flow.rs:234-309 | compiler/crates/relay-typegen/src/typescript.rs:279-348 — These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) compiler/crates/intern/src/atomic_arena.rs:229 — compiler/crates/intern/src/atomic_arena.rs:229-262 | compiler/crates/intern/src/atomic_arena.rs:626-660 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) compiler/crates/errors/src/error_combinators.rs:29 — compiler/crates/errors/src/error_combinators.rs:29-57 | compiler/crates/errors/src/error_combinators.rs:64-99 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (8 members, 50+ identical tokens) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:168 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:168-189 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:191-211 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:217-238 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:240-260 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:371-391 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:393-412 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:448-468 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:470-489 — These 8 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 8 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 8 times.
D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (7 members, 50+ identical tokens) compiler/crates/relay-compiler/src/artifact_content/content.rs:55 — compiler/crates/relay-compiler/src/artifact_content/content.rs:55-156 | compiler/crates/relay-compiler/src/artifact_content/content.rs:169-279 | compiler/crates/relay-compiler/src/artifact_content/content.rs:295-547 | compiler/crates/relay-compiler/src/artifact_content/content.rs:560-660 | compiler/crates/relay-compiler/src/artifact_content/content.rs:713-831 | compiler/crates/relay-compiler/src/artifact_content/content.rs:840-935 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1128-1208 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) compiler/crates/schema-set/src/from_schema.rs:211 — compiler/crates/schema-set/src/from_schema.rs:211-226 | compiler/crates/schema-set/src/from_schema.rs:239-255 | compiler/crates/schema-set/src/from_schema.rs:269-286 | compiler/crates/schema-set/src/from_schema.rs:301-318 | compiler/crates/schema-set/src/from_schema.rs:333-349 — 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.
D4 · Code Duplication · Duplicated block (24–36 lines × 2) · ×1
  • Duplicated block (24–36 lines × 2) compiler/crates/relay-typegen/src/write.rs:325 — compiler/crates/relay-typegen/src/write.rs:325-348 | compiler/crates/relay-typegen/src/write.rs:1129-1164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (34 lines × 2) · ×1
  • Duplicated block (34 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:503 — compiler/crates/schema/src/flatbuffer/wrapper.rs:503-536 | compiler/crates/schema/src/in_memory.rs:2105-2138 — before extracting anything, compare `compiler/crates/schema/src/flatbuffer/wrapper.rs` and `compiler/crates/schema/src/in_memory.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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.
D4 · Code Duplication · Duplicated block (25–32 lines × 2) · ×1
  • Duplicated block (25–32 lines × 2) compiler/crates/errors/src/error_combinators.rs:30 — compiler/crates/errors/src/error_combinators.rs:30-54 | compiler/crates/errors/src/error_combinators.rs:65-96 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (26–27 lines × 2) · ×1
  • Duplicated block (26–27 lines × 2) compiler/crates/schema-set/src/schema_set_collector.rs:182 — compiler/crates/schema-set/src/schema_set_collector.rs:182-207 | compiler/crates/schema-set/src/schema_set_collector.rs:242-268 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) compiler/crates/schema-set/src/find_subset_violations.rs:186 — compiler/crates/schema-set/src/find_subset_violations.rs:186-211 | compiler/crates/schema-set/src/find_subset_violations.rs:215-240 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (19–23 lines × 2) · ×1
  • Duplicated block (19–23 lines × 2) compiler/crates/relay-compiler/src/artifact_content/content.rs:802 — compiler/crates/relay-compiler/src/artifact_content/content.rs:802-824 | compiler/crates/relay-compiler/src/artifact_content/content.rs:895-913 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (22–23 lines × 2) · ×1
  • Duplicated block (22–23 lines × 2) compiler/crates/relay-compiler/src/build_project/build_schema.rs:114 — compiler/crates/relay-compiler/src/build_project/build_schema.rs:114-136 | compiler/crates/relay-compiler/src/build_project/build_schema.rs:191-212 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:444 — compiler/crates/schema/src/flatbuffer/wrapper.rs:444-465 | compiler/crates/schema/src/in_memory.rs:2227-2248 — before extracting anything, compare `compiler/crates/schema/src/flatbuffer/wrapper.rs` and `compiler/crates/schema/src/in_memory.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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.
D4 · Code Duplication · Duplicated block (21 lines × 4) · ×1
  • Duplicated block (21 lines × 4) compiler/crates/relay-compiler/src/artifact_content/content.rs:179 — compiler/crates/relay-compiler/src/artifact_content/content.rs:179-199 | compiler/crates/relay-compiler/src/artifact_content/content.rs:561-581 | compiler/crates/relay-compiler/src/artifact_content/content.rs:714-734 | compiler/crates/relay-compiler/src/artifact_content/content.rs:841-861 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) compiler/crates/relay-typegen/src/flow.rs:63 — compiler/crates/relay-typegen/src/flow.rs:63-83 | compiler/crates/relay-typegen/src/typescript.rs:76-96 — before extracting anything, compare `compiler/crates/relay-typegen/src/flow.rs` and `compiler/crates/relay-typegen/src/typescript.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 140 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.
D4 · Code Duplication · Duplicated block (20–21 lines × 2) · ×1
  • Duplicated block (20–21 lines × 2) compiler/crates/schema-set/src/partition_base_extensions.rs:246 — compiler/crates/schema-set/src/partition_base_extensions.rs:246-265 | compiler/crates/schema-set/src/partition_base_extensions.rs:273-293 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (20 lines × 3) · ×1
  • Duplicated block (20 lines × 3) compiler/crates/relay-compiler/src/artifact_content/content.rs:569 — compiler/crates/relay-compiler/src/artifact_content/content.rs:569-588 | compiler/crates/relay-compiler/src/artifact_content/content.rs:849-868 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1136-1155 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (17–19 lines × 2) · ×1
  • Duplicated block (17–19 lines × 2) compiler/crates/relay-typegen/src/write.rs:409 — compiler/crates/relay-typegen/src/write.rs:409-427 | compiler/crates/relay-typegen/src/write.rs:835-851 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (17 lines × 4) · ×1
  • Duplicated block (17 lines × 4) compiler/crates/relay-compiler/src/artifact_content/content.rs:187 — compiler/crates/relay-compiler/src/artifact_content/content.rs:187-203 | compiler/crates/relay-compiler/src/artifact_content/content.rs:569-585 | compiler/crates/relay-compiler/src/artifact_content/content.rs:849-865 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1136-1152 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) compiler/crates/relay-compiler/src/artifact_content/content.rs:72 — compiler/crates/relay-compiler/src/artifact_content/content.rs:72-88 | compiler/crates/relay-compiler/src/artifact_content/content.rs:332-348 | compiler/crates/relay-compiler/src/artifact_content/content.rs:722-738 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×1
  • Duplicated block (16–17 lines × 2) compiler/crates/schema-set/src/schema_set_collector.rs:217 — compiler/crates/schema-set/src/schema_set_collector.rs:217-233 | compiler/crates/schema-set/src/schema_set_collector.rs:278-293 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15 lines × 4) · ×1
  • Duplicated block (15 lines × 4) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:175 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:175-189 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:197-211 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:224-238 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:246-260 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (13–15 lines × 2) · ×1
  • Duplicated block (13–15 lines × 2) compiler/crates/relay-codegen/src/build_ast.rs:1117 — compiler/crates/relay-codegen/src/build_ast.rs:1117-1131 | compiler/crates/relay-codegen/src/build_ast.rs:1231-1243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (14 lines × 6) · ×1
  • Duplicated block (14 lines × 6) compiler/crates/relay-compiler/src/artifact_content/content.rs:71 — compiler/crates/relay-compiler/src/artifact_content/content.rs:71-84 | compiler/crates/relay-compiler/src/artifact_content/content.rs:186-199 | compiler/crates/relay-compiler/src/artifact_content/content.rs:331-344 | compiler/crates/relay-compiler/src/artifact_content/content.rs:568-581 | compiler/crates/relay-compiler/src/artifact_content/content.rs:721-734 | compiler/crates/relay-compiler/src/artifact_content/content.rs:848-861 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10–14 lines × 6) · ×1
  • Duplicated block (10–14 lines × 6) compiler/crates/schema-set/src/print_schema_set.rs:91 — compiler/crates/schema-set/src/print_schema_set.rs:91-104 | compiler/crates/schema-set/src/print_schema_set.rs:106-119 | compiler/crates/schema-set/src/print_schema_set.rs:121-134 | compiler/crates/schema-set/src/print_schema_set.rs:136-149 | compiler/crates/schema-set/src/print_schema_set.rs:151-164 | compiler/crates/schema-set/src/print_schema_set.rs:165-174 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) compiler/crates/relay-transforms/src/generate_id_field.rs:104 — compiler/crates/relay-transforms/src/generate_id_field.rs:104-116 | compiler/crates/relay-transforms/src/generate_typename.rs:179-191 | compiler/crates/relay-transforms/src/generate_typename_union.rs:191-203 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (12 lines × 4) · ×1
  • Duplicated block (12 lines × 4) compiler/crates/relay-codegen/src/printer.rs:234 — compiler/crates/relay-codegen/src/printer.rs:234-245 | compiler/crates/relay-codegen/src/printer.rs:281-292 | compiler/crates/relay-codegen/src/printer.rs:303-314 | compiler/crates/relay-codegen/src/printer.rs:327-338 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) compiler/crates/schema-diff/src/lib.rs:723 — compiler/crates/schema-diff/src/lib.rs:723-734 | compiler/crates/schema-diff/src/lib.rs:788-797 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×1
  • Duplicated block (11–12 lines × 2) compiler/crates/schema/src/flatbuffer/wrapper.rs:416 — compiler/crates/schema/src/flatbuffer/wrapper.rs:416-426 | compiler/crates/schema/src/in_memory.rs:2145-2156 — before extracting anything, compare `compiler/crates/schema/src/flatbuffer/wrapper.rs` and `compiler/crates/schema/src/in_memory.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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.
D4 · Code Duplication · Duplicated block (10 lines × 8) · ×1
  • Duplicated block (10 lines × 8) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:175 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:175-184 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:197-206 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:224-233 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:246-255 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:377-386 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:398-407 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:454-463 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:475-484 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10 lines × 5) · ×1
  • Duplicated block (10 lines × 5) compiler/crates/schema-set/src/from_schema.rs:214 — compiler/crates/schema-set/src/from_schema.rs:214-223 | compiler/crates/schema-set/src/from_schema.rs:242-251 | compiler/crates/schema-set/src/from_schema.rs:272-281 | compiler/crates/schema-set/src/from_schema.rs:304-313 | compiler/crates/schema-set/src/from_schema.rs:336-345 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • Duplicated block (9–10 lines × 2) compiler/crates/relay-transforms/src/required_directive.rs:395 — compiler/crates/relay-transforms/src/required_directive.rs:395-404 | compiler/crates/relay-transforms/src/skip_unreachable_node.rs:193-201 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5–10 lines × 2) · ×1
  • Duplicated block (5–10 lines × 2) compiler/crates/schema-diff/src/lib.rs:889 — compiler/crates/schema-diff/src/lib.rs:889-893 | compiler/crates/schema-diff/src/lib.rs:955-964 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×1
  • Duplicated block (9 lines × 4) compiler/crates/relay-transforms/src/connections/connection_util.rs:246 — compiler/crates/relay-transforms/src/connections/connection_util.rs:246-254 | compiler/crates/relay-transforms/src/connections/connection_util.rs:266-274 | compiler/crates/relay-transforms/src/connections/connection_util.rs:283-291 | compiler/crates/relay-transforms/src/connections/connection_util.rs:298-306 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (7–9 lines × 2) · ×1
  • Duplicated block (7–9 lines × 2) compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs:170 — compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs:170-176 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:342-350 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:907 — compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:907-914 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:952-958 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7 lines × 4) · ×1
  • Duplicated block (7 lines × 4) compiler/crates/relay-compiler-playground/src/lib.rs:131 — compiler/crates/relay-compiler-playground/src/lib.rs:131-137 | compiler/crates/relay-compiler-playground/src/lib.rs:178-184 | compiler/crates/relay-compiler-playground/src/lib.rs:224-230 | compiler/crates/relay-compiler-playground/src/lib.rs:281-287 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (5 lines × 5) · ×1
  • Duplicated block (5 lines × 5) compiler/crates/schema/src/compact.rs:1090 — compiler/crates/schema/src/compact.rs:1090-1094 | compiler/crates/schema/src/compact.rs:1103-1107 | compiler/crates/schema/src/compact.rs:1116-1120 | compiler/crates/schema/src/compact.rs:1129-1133 | compiler/crates/schema/src/compact.rs:1142-1146 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) compiler/crates/graphql-syntax/src/parser.rs:969 — compiler/crates/graphql-syntax/src/parser.rs:969-976 | compiler/crates/graphql-syntax/src/parser.rs:1066-1073 | compiler/crates/graphql-syntax/src/parser.rs:1112-1119 | compiler/crates/graphql-syntax/src/parser.rs:1260-1267 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D44 · Platform End-of-Life · End-of-life runtime · ×1
  • End-of-life runtime: Node.js 18 packages/eslint-plugin-relay-internal/package.json:23 — packages/eslint-plugin-relay-internal/package.json declares Node.js 18 as this project's engines.node, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the jest suite in the repository root ran and not one test passed (FAIL packages/react-relay/relay-hooks/__tests__/usePaginationFragment-test.js), so the coverage would describe the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×1
  • Outbound HTTP without resilience compiler/crates/persist-query/src/lib.rs:112 — `Client::builder(TokioExecutor` 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.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×1
  • Sync-over-async blocking packages/relay-test-utils-internal/generateTestsFromFixtures.js:60 — `fs.readFileSync` in `anonymous function` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 0 typed · 642 plain JS — the untyped files are flow-typed/dev.js, flow-typed/npm/chalk_v4.x.x.js, flow-typed/npm/invariant_v2.x.x.js, flow-typed/npm/jest_v29.x.x.js, packages/babel-plugin-relay/BabelPluginRelay.js, packages/babel-plugin-relay/BabelPluginRelay.macro.js (+636 more).
R10 · Code Duplication · Duplicated block with local edits (489 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (489 matched lines × 2 locations) REDACTED:53 — REDACTED:53 · REDACTED:65 — the two spans are one implementation copied and then locally edited — 2399 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (266 identical lines × 2 files) · ×1
  • Wholesale file copy (266 identical lines × 2 files) REDACTED:16 — REDACTED:16 · REDACTED:15 — these 2 files are line-for-line copies of one another — 266 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Wholesale file copy (221 identical lines × 2 files) · ×1
  • Wholesale file copy (221 identical lines × 2 files) REDACTED:14 — REDACTED:14 · REDACTED:14 — these 2 files are line-for-line copies of one another — 221 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (141 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (141 matched lines × 2 locations) packages/react-relay/relay-hooks/useLoadMoreFunction.js:44 — packages/react-relay/relay-hooks/useLoadMoreFunction.js:44 · packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js:42 — the two spans are one implementation copied and then locally edited — 571 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (116 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (116 matched lines × 2 locations) REDACTED:278 — REDACTED:278 · REDACTED:231 — the two spans are one implementation copied and then locally edited — 491 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (81 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (81 matched lines × 2 locations) packages/react-relay/ReactRelayFragmentContainer.js:80 — packages/react-relay/ReactRelayFragmentContainer.js:80 · packages/react-relay/ReactRelayRefetchContainer.js:136 — the two spans are one implementation copied and then locally edited — 397 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (60 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (60 matched lines × 2 locations) packages/relay-runtime/store/DataChecker.js:456 — packages/relay-runtime/store/DataChecker.js:456 · packages/relay-runtime/store/RelayReferenceMarker.js:177 — the two spans are one implementation copied and then locally edited — 281 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (56 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (56 matched lines × 2 locations) REDACTED:406 — REDACTED:406 · REDACTED:1535 — the two spans are one implementation copied and then locally edited — 317 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (55 lines × 2 locations) · ×1
  • Duplicated block (55 lines × 2 locations) packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 — packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:82 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (51 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (51 matched lines × 2 locations) packages/react-relay/relay-hooks/useQueryLoader.js:49 — packages/react-relay/relay-hooks/useQueryLoader.js:49 · packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js:38 — the two spans are one implementation copied and then locally edited — 268 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (47 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (47 matched lines × 2 locations) packages/react-relay/relay-hooks/legacy/FragmentResource.js:637 — packages/react-relay/relay-hooks/legacy/FragmentResource.js:637 · packages/react-relay/relay-hooks/legacy/FragmentResource.js:767 — the two spans are one implementation copied and then locally edited — 177 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (42 lines × 3 locations) · ×1
  • Duplicated block (42 lines × 3 locations) packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:77 — packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:77 · packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:82 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (42 lines × 2 locations) · ×1
  • Duplicated block (42 lines × 2 locations) packages/relay-runtime/handlers/connection/MutationHandlers.js:107 — packages/relay-runtime/handlers/connection/MutationHandlers.js:107 · packages/relay-runtime/handlers/connection/MutationHandlers.js:185 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block with local edits (36 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (36 matched lines × 2 locations) REDACTED:303 — REDACTED:303 · REDACTED:815 — the two spans are one implementation copied and then locally edited — 129 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (35 lines × 2 locations) · ×1
  • Duplicated block (35 lines × 2 locations) packages/relay-runtime/util/getPaginationVariables.js:34 — packages/relay-runtime/util/getPaginationVariables.js:34 · packages/relay-runtime/util/getPaginationVariables.js:71 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (31 lines × 2 locations) · ×1
  • Duplicated block (31 lines × 2 locations) packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:89 — packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:89 · packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:49 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (30 lines × 2 locations) · ×1
  • Duplicated block (30 lines × 2 locations) packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:64 — packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:64 · packages/react-relay/relay-hooks/loadEntryPoint.js:25 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (27 lines × 2 locations) · ×1
  • Duplicated block (27 lines × 2 locations) packages/relay-runtime/store/RelayModernRecord.js:336 — packages/relay-runtime/store/RelayModernRecord.js:336 · packages/relay-runtime/store/RelayModernRecord.js:408 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (26 lines × 2 locations) · ×1
  • Duplicated block (26 lines × 2 locations) packages/relay-runtime/mutations/RelayRecordSourceProxy.js:176 — packages/relay-runtime/mutations/RelayRecordSourceProxy.js:176 · packages/relay-runtime/mutations/RelayRecordSourceSelectorProxy.js:132 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (25 lines × 3 locations) · ×1
  • Duplicated block (25 lines × 3 locations) REDACTED:152 — REDACTED:152 · REDACTED:290 · REDACTED:802 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (24 lines × 3 locations) · ×1
  • Duplicated block (24 lines × 3 locations) packages/react-relay/relay-hooks/readFragmentInternal.js:265 — packages/react-relay/relay-hooks/readFragmentInternal.js:265 · REDACTED:672 · REDACTED:786 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (23 lines × 2 locations) · ×1
  • Duplicated block (23 lines × 2 locations) REDACTED:1384 — REDACTED:1384 · REDACTED:1411 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (22 lines × 2 locations) · ×1
  • Duplicated block (22 lines × 2 locations) packages/react-relay/index.js:101 — packages/react-relay/index.js:101 · packages/react-relay/legacy.js:62 — the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour — the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator's options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents.
R10 · Code Duplication · Duplicated block (21 lines × 2 locations) · ×1
  • Duplicated block (21 lines × 2 locations) packages/relay-runtime/handlers/connection/ConnectionHandler.js:330 — packages/relay-runtime/handlers/connection/ConnectionHandler.js:330 · packages/relay-runtime/handlers/connection/ConnectionHandler.js:434 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (20 lines × 5 locations) · ×1
  • Duplicated block (20 lines × 5 locations) packages/react-relay/relay-hooks/readFragmentInternal.js:60 — packages/react-relay/relay-hooks/readFragmentInternal.js:60 · REDACTED:68 · REDACTED:89 · REDACTED:80 · +1 more site(s) not listed — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (18 lines × 3 locations) · ×1
  • Duplicated block (18 lines × 3 locations) packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:47 — packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:47 · packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:32 · packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:31 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (17 lines × 2 locations) · ×1
  • Duplicated block (17 lines × 2 locations) REDACTED:182 — REDACTED:182 · REDACTED:834 — 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.
R2 · Cyclomatic Complexity · Complex function createContainerWithFragments (cyclomatic 57, cognitive 65) · ×1
  • Complex function createContainerWithFragments (cyclomatic 57, cognitive 65) REDACTED:319 — createContainerWithFragments has cyclomatic complexity 57 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 56, cognitive 69) · ×1
  • Complex function (anonymous) (cyclomatic 56, cognitive 69) REDACTED:268 — (anonymous) has cyclomatic complexity 56 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function update (cyclomatic 41, cognitive 71) · ×1
  • Complex function update (cyclomatic 41, cognitive 71) packages/relay-runtime/handlers/connection/ConnectionHandler.js:50 — update has cyclomatic complexity 41 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function readWithIdentifier (cyclomatic 36, cognitive 47) · ×1
  • Complex function readWithIdentifier (cyclomatic 36, cognitive 47) packages/react-relay/relay-hooks/legacy/FragmentResource.js:238 — readWithIdentifier has cyclomatic complexity 36 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _traverseSelections (cyclomatic 36, cognitive 45) · ×1
  • Complex function _traverseSelections (cyclomatic 36, cognitive 45) REDACTED:567 — _traverseSelections has cyclomatic complexity 36 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 34, cognitive 26) · ×1
  • Complex function (anonymous) (cyclomatic 34, cognitive 26) packages/relay-runtime/store/ExecTimeS2CDataChecker.js:222 — (anonymous) has cyclomatic complexity 34 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 sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _readClientEdge (cyclomatic 30, cognitive 96) · ×1
  • Complex function _readClientEdge (cyclomatic 30, cognitive 96) REDACTED:1039 — _readClientEdge has cyclomatic complexity 30 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function readFragmentInternal (cyclomatic 29, cognitive 37) · ×1
  • Complex function readFragmentInternal (cyclomatic 29, cognitive 37) packages/react-relay/relay-hooks/readFragmentInternal.js:152 — readFragmentInternal has cyclomatic complexity 29 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function createContainerWithFragments (cyclomatic 28, cognitive 34) · ×1
  • Complex function createContainerWithFragments (cyclomatic 28, cognitive 34) packages/react-relay/ReactRelayRefetchContainer.js:70 — createContainerWithFragments has cyclomatic complexity 28 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 28, cognitive 28) · ×1
  • Complex function (anonymous) (cyclomatic 28, cognitive 28) packages/relay-runtime/store/DataChecker.js:362 — (anonymous) has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _traverseSelections (cyclomatic 27, cognitive 27) · ×1
  • Complex function _traverseSelections (cyclomatic 27, cognitive 27) REDACTED:243 — _traverseSelections has cyclomatic complexity 27 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function updateProxyFromSelections (cyclomatic 27, cognitive 19) · ×1
  • Complex function updateProxyFromSelections (cyclomatic 27, cognitive 19) REDACTED:55 — updateProxyFromSelections has cyclomatic complexity 27 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _handleNext (cyclomatic 26, cognitive 44) · ×1
  • Complex function _handleNext (cyclomatic 26, cognitive 44) REDACTED:587 — _handleNext has cyclomatic complexity 26 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 25, cognitive 17) · ×1
  • Complex function (anonymous) (cyclomatic 25, cognitive 17) packages/relay-runtime/store/RelayReferenceMarker.js:132 — (anonymous) has cyclomatic complexity 25 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function notify (cyclomatic 24, cognitive 27) · ×1
  • Complex function notify (cyclomatic 24, cognitive 27) REDACTED:471 — notify has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function readFromCacheOrEvaluate (cyclomatic 23, cognitive 43) · ×1
  • Complex function readFromCacheOrEvaluate (cyclomatic 23, cognitive 43) packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:111 — readFromCacheOrEvaluate has cyclomatic complexity 23 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _traverseSelections (cyclomatic 23, cognitive 34) · ×1
  • Complex function _traverseSelections (cyclomatic 23, cognitive 34) packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:257 — _traverseSelections has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function recycleNodesIntoImpl (cyclomatic 23, cognitive 20) · ×1
  • Complex function recycleNodesIntoImpl (cyclomatic 23, cognitive 20) packages/relay-runtime/util/recycleNodesInto.js:22 — recycleNodesIntoImpl has cyclomatic complexity 23 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _normalizeField (cyclomatic 22, cognitive 39) · ×1
  • Complex function _normalizeField (cyclomatic 22, cognitive 39) REDACTED:609 — _normalizeField has cyclomatic complexity 22 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _collect (cyclomatic 21, cognitive 45) · ×1
  • Complex function _collect (cyclomatic 21, cognitive 45) REDACTED:891 — _collect has cyclomatic complexity 21 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 1885 lines of code REDACTED:1 — REDACTED has 1885 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 1763 lines of code REDACTED:1 — REDACTED has 1763 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/RelayStoreTypes.js · ×1
  • packages/relay-runtime/store/RelayStoreTypes.js: 1515 lines of code packages/relay-runtime/store/RelayStoreTypes.js:1 — packages/relay-runtime/store/RelayStoreTypes.js has 1515 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · flow-typed/npm/jest_v29.x.x.js · ×1
  • flow-typed/npm/jest_v29.x.x.js: 1235 lines of code flow-typed/npm/jest_v29.x.x.js:1 — flow-typed/npm/jest_v29.x.x.js has 1235 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 1113 lines of code REDACTED:1 — REDACTED has 1113 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/live-resolvers/LiveResolverCache.js · ×1
  • packages/relay-runtime/store/live-resolvers/LiveResolverCache.js: 1012 lines of code packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:1 — packages/relay-runtime/store/live-resolvers/LiveResolverCache.js has 1012 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 1003 lines of code REDACTED:1 — REDACTED has 1003 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 983 lines of code REDACTED:1 — REDACTED has 983 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 876 lines of code REDACTED:1 — REDACTED has 876 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/react-relay/relay-hooks/legacy/FragmentResource.js · ×1
  • packages/react-relay/relay-hooks/legacy/FragmentResource.js: 846 lines of code packages/react-relay/relay-hooks/legacy/FragmentResource.js:1 — packages/react-relay/relay-hooks/legacy/FragmentResource.js has 846 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 808 lines of code REDACTED:1 — REDACTED has 808 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 789 lines of code REDACTED:1 — REDACTED has 789 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/RelayModernRecord.js · ×1
  • packages/relay-runtime/store/RelayModernRecord.js: 709 lines of code packages/relay-runtime/store/RelayModernRecord.js:1 — packages/relay-runtime/store/RelayModernRecord.js has 709 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 672 lines of code REDACTED:1 — REDACTED has 672 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/DataChecker.js · ×1
  • packages/relay-runtime/store/DataChecker.js: 645 lines of code packages/relay-runtime/store/DataChecker.js:1 — packages/relay-runtime/store/DataChecker.js has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/network/RelayObservable.js · ×1
  • packages/relay-runtime/network/RelayObservable.js: 606 lines of code packages/relay-runtime/network/RelayObservable.js:1 — packages/relay-runtime/network/RelayObservable.js has 606 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/handlers/connection/ConnectionHandler.js · ×1
  • packages/relay-runtime/handlers/connection/ConnectionHandler.js: 589 lines of code packages/relay-runtime/handlers/connection/ConnectionHandler.js:1 — packages/relay-runtime/handlers/connection/ConnectionHandler.js has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 579 lines of code REDACTED:1 — REDACTED has 579 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 576 lines of code REDACTED:1 — REDACTED has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/react-relay/relay-hooks/QueryResource.js · ×1
  • packages/react-relay/relay-hooks/QueryResource.js: 574 lines of code packages/react-relay/relay-hooks/QueryResource.js:1 — packages/react-relay/relay-hooks/QueryResource.js has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-test-utils/RelayModernMockEnvironment.js · ×1
  • packages/relay-test-utils/RelayModernMockEnvironment.js: 561 lines of code packages/relay-test-utils/RelayModernMockEnvironment.js:1 — packages/relay-test-utils/RelayModernMockEnvironment.js has 561 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 529 lines of code REDACTED:1 — REDACTED has 529 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 528 lines of code REDACTED:1 — REDACTED has 528 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/RelayModernSelector.js · ×1
  • packages/relay-runtime/store/RelayModernSelector.js: 518 lines of code packages/relay-runtime/store/RelayModernSelector.js:1 — packages/relay-runtime/store/RelayModernSelector.js has 518 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 487 lines of code REDACTED:1 — REDACTED has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/react-relay/ReactRelayRefetchContainer.js · ×1
  • packages/react-relay/ReactRelayRefetchContainer.js: 464 lines of code packages/react-relay/ReactRelayRefetchContainer.js:1 — packages/react-relay/ReactRelayRefetchContainer.js has 464 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 454 lines of code REDACTED:1 — REDACTED has 454 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 453 lines of code REDACTED:1 — REDACTED has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js · ×1
  • packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js: 453 lines of code packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:1 — packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/react-relay/relay-hooks/loadQuery.js · ×1
  • packages/react-relay/relay-hooks/loadQuery.js: 447 lines of code packages/react-relay/relay-hooks/loadQuery.js:1 — packages/react-relay/relay-hooks/loadQuery.js has 447 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/store/RelayModernFragmentSpecResolver.js · ×1
  • packages/relay-runtime/store/RelayModernFragmentSpecResolver.js: 442 lines of code packages/relay-runtime/store/RelayModernFragmentSpecResolver.js:1 — packages/relay-runtime/store/RelayModernFragmentSpecResolver.js has 442 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/relay-runtime/index.js · ×1
  • packages/relay-runtime/index.js: 441 lines of code packages/relay-runtime/index.js:1 — packages/relay-runtime/index.js has 441 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/react-relay/ReactRelayQueryRenderer.js · ×1
  • packages/react-relay/ReactRelayQueryRenderer.js: 440 lines of code packages/react-relay/ReactRelayQueryRenderer.js:1 — packages/react-relay/ReactRelayQueryRenderer.js has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 427 lines of code REDACTED:1 — REDACTED has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R7 · Dead Code · Dead file (~1278 LoC) · ×1
  • Dead file (~1278 LoC) flow-typed/npm/jest_v29.x.x.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~488 LoC) · ×1
  • Dead file (~488 LoC) REDACTED — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~265 LoC) · ×1
  • Dead file (~265 LoC) packages/react-relay/__flowtests__/RelayModern-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~261 LoC) · ×1
  • Dead file (~261 LoC) scripts/release-notes/App.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~175 LoC) · ×1
  • Dead file (~175 LoC) flow-typed/npm/chalk_v4.x.x.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~171 LoC) · ×1
  • Dead file (~171 LoC) packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~154 LoC) · ×1
  • Dead file (~154 LoC) packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~147 LoC) · ×1
  • Dead file (~147 LoC) packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~146 LoC) · ×1
  • Dead file (~146 LoC) packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~145 LoC) · ×1
  • Dead file (~145 LoC) packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~124 LoC) · ×1
  • Dead file (~124 LoC) scripts/release-notes.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~110 LoC) · ×1
  • Dead file (~110 LoC) packages/react-relay/relay-hooks/__flowtests__/useRefetchableFragment-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~106 LoC) · ×1
  • Dead file (~106 LoC) packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/NestedEntrypoints-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~94 LoC) · ×1
  • Dead file (~94 LoC) packages/react-relay/relay-hooks/__flowtests__/utils.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 6 in-repo import(s) from 3 other file(s) do name it (packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js, packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js, packages/react-relay/relay-hooks/__flowtests__/useRefetchableFragment-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~91 LoC) · ×1
  • Dead file (~91 LoC) packages/react-relay/relay-hooks/__flowtests__/useFragment-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~90 LoC) · ×1
  • Dead file (~90 LoC) packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/ExtractQueryTypes-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~56 LoC) · ×1
  • Dead file (~56 LoC) packages/react-relay/multi-actor/ActorChange.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/multi-actor/index.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~52 LoC) · ×1
  • Dead file (~52 LoC) scripts/jest/preprocessor.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~50 LoC) · ×1
  • Dead file (~50 LoC) packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/EntryPointElementConfig-flowtest.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~47 LoC) · ×1
  • Dead file (~47 LoC) packages/react-relay/multi-actor/useRelayActorEnvironment.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/multi-actor/ActorChange.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~39 LoC) · ×1
  • Dead file (~39 LoC) packages/react-relay/relay-hooks/NestedRelayEntryPointBuilderUtils.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/NestedEntrypoints-flowtest.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~15 LoC) · ×1
  • Dead file (~15 LoC) flow-typed/dev.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~14 LoC) · ×1
  • Dead file (~14 LoC) packages/react-relay/multi-actor/index.js — no import path from any entry point (38 application, 104 tooling, 396 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unused dependency 'flow-bin' · ×1
  • Unused dependency 'flow-bin' — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'gulp-chmod' · ×1
  • Unused dependency 'gulp-chmod' — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
X15 · Unvalidated length from an untrusted reader · Length read from the parsed input is spent without ever being bounded · ×1
  • Length read from the parsed input is spent without ever being bounded compiler/crates/schema/src/compact.rs:836 — `count` is read from the bytes being parsed at line 834 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 836 — and nowhere in its scope is `count` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `count` against the bytes actually remaining and a maximum the format allows before allocating.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×1
  • Recursive walk over a caller-supplied document has no depth cap packages/relay-runtime/util/stableCopy.js:50 — `hasCycle` is exported and takes `value: unknown` from its caller, and it calls itself at line 50 (`hasCycle`) with a piece of `value` — and nowhere in `hasCycle` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `hasCycle` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Minor — 144 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×72
  • Orphaned file compiler/crates/common/src/diagnostic.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-lsp/src/node_resolution_info.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/schema/src/suggestion_list.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/schema/src/definitions/interface.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_regular_queries.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-lsp/src/code_action.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/schema/src/graphql_schema.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/resolution-path/src/constant_value_root.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/match_/subscription_transform.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-lsp/src/find_field_usages.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/assignable_fragment_spread/errors.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/graphql-syntax/src/node/executable.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/interner/src/bytes.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/sort_selections.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/intern/src/small_bytes.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/graphql-ir/src/visitor.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/dependency-analyzer/src/minimized_executable.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/generate_typename_union.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-transforms/src/refetchable_fragment/refetchable_directive.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/relay-docblock/src/untyped_representation.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/intern/src/path.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/schema-diff/src/definitions.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file compiler/crates/resolution-path/src/argument_root.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 47 more in this group — see findings.md.
D10 · Test Quality · Mock-dominated test · ×29
  • Mock-dominated test: applies payload on @defer fragments in a query with modules packages/relay-runtime/store/__tests__/RelayModernEnvironment-CommitPayload-test.js:295 — This test sets up 3 test doubles (for example `jest.fn`) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: publishes the source to the store packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:792 — This test sets up 5 test doubles (for example `jest.fn`) against 3 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: invalidates the store if invalidated via updater packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1337 — This test sets up 6 test doubles (for example `jest.fn`) against 3 real object(s) of its own, and its only verification is 8 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: invalidates any ids marked as invalid via the updater packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1404 — This test sets up 6 test doubles (for example `jest.fn`) against 3 real object(s) of its own, and its only verification is 9 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: publishes the source to the store packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1478 — This test sets up 5 test doubles (for example `jest.fn`) against 3 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: publishes the source to the store packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1679 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: invalidates the store if invalidated via updater packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1709 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: invalidates any ids marked as invalid via the updater packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1734 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: publishes handle field payloads now, notifies on the continuation packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1809 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: records the operation when it publishes, not when it notifies packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1871 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: records every publish sharing a flush, not just one of them packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1899 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: holds no state in the continuation: extra calls no-op packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1925 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: falls back to the next run() when the continuation is dropped packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:1959 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: does not notify the store if no mutations have occurred packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2128 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: notifies the store if an optimistic mutation is applied packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2149 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: notifies the store if an optimistic mutation is reverted packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2172 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: notifies the store if a server mutation is committed packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2203 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should disable CG if there are any applied optimistic updates packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2239 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should not disable GC if there are no optimistic updates packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2261 — This test sets up 5 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should dispose gc hold, when there are no optimistic updates are in the queue packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2280 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should release the gc hold when that is the only work left packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js:2318 — This test sets up 6 test doubles (for example `jest.fn`) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: Cleans up when unsubscribed packages/relay-runtime/network/__tests__/RelayObservable-test.js:1562 — This test sets up 5 test doubles (for example `jest.fn`) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: Calls next and complete when the promise resolves packages/relay-runtime/network/__tests__/RelayObservable-test.js:1583 — This test sets up 5 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: Calls error when the promise rejects packages/relay-runtime/network/__tests__/RelayObservable-test.js:1602 — This test sets up 5 test doubles (for example `jest.fn`) against 1 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: send a network request with actor specific params packages/relay-runtime/multi-actor-environment/__tests__/actorEnvironment_execute-test.js:27 — This test sets up 4 test doubles (for example `jest.fn`) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • + 4 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate packages/react-relay/ReactRelayFragmentContainer.js:185 — `!fragments.hasOwnProperty(key) && !isScalarAndEqual(nextProps[key], this.props[key])` appears character-identically in 3 files — packages/react-relay/ReactRelayFragmentContainer.js, REDACTED, packages/react-relay/ReactRelayRefetchContainer.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:351 — `!isLoadingMoreRef.current && !isLoadingMore && !isRefetching && !disablePrefetching && !hasPrefetchErroredRef.current && hasNext && (sourceS…` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:279 — `!isLoadingMoreRef.current && availableSizeRef.current < 0` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:262 — `!isLoadingMoreRef.current || availableSizeRef.current >= 0` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:564 — `RelayFeatureFlags.ENABLE_RELAY_OPERATION_TRACKER_SUSPENSE || environment !== previousEnvironment || committedFragmentSelectorRef.current ===…` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/legacy/useFragmentNode.js:102 — `RelayFeatureFlags.LOG_MISSING_RECORDS_IN_PROD || __DEV__` appears character-identically in 4 files — packages/react-relay/relay-hooks/legacy/useFragmentNode.js, packages/react-relay/relay-hooks/readFragmentInternal.js, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:786 — `cacheConfig != null && options?.metadata != null` appears character-identically in 2 files — REDACTED, packages/react-relay/ReactRelayRefetchContainer.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:208 — `environment !== mirroredEnvironment || fragmentIdentifier !== mirroredFragmentIdentifier` appears character-identically in 4 files — REDACTED, packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:618 — `fieldPayload.dataID === parentID || fieldID === parentID` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/readFragmentInternal.js:218 — `fragmentNode.metadata?.hasClientEdges === true || RelayFeatureFlags.CHECK_ALL_FRAGMENTS_FOR_MISSING_CLIENT_EDGES` appears character-identically in 3 files — packages/react-relay/relay-hooks/readFragmentInternal.js, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/readFragmentInternal.js:190 — `fragmentRef == null || (isPlural && Array.isArray(fragmentRef) && fragmentRef.length === 0) || fragmentSelector != null` appears character-identically in 3 files — packages/react-relay/relay-hooks/readFragmentInternal.js, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/readFragmentInternal.js:168 — `fragmentRef == null || Array.isArray(fragmentRef)` appears character-identically in 3 files — packages/react-relay/relay-hooks/readFragmentInternal.js, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:598 — `fragmentRefPathInResponse.length !== 1 || fragmentRefPathInResponse[0] !== 'node' || id == null` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/useLoadMoreFunction.js:203 — `fragmentSelector != null && fragmentSelector.kind !== 'PluralReaderSelector'` appears character-identically in 2 files — packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:469 — `identifierInfo != null && !providedRefetchVariables.hasOwnProperty( identifierInfo.identifierQueryVariableName, )` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/useLoadMoreFunction.js:111 — `identifierInfo?.identifierField != null && internalFragmentData != null && typeof internalFragmentData === 'object'` appears character-identically in 3 files — packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/useLoadMoreFunction.js:151 — `internalFragmentData == null || isParentQueryActive` appears character-identically in 2 files — packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:256 — `maxFetchSize != null && maxFetchSize > 0` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/ReactRelayRefetchContainer.js:392 — `observer.complete && observer.complete()` appears character-identically in 4 files — packages/react-relay/ReactRelayRefetchContainer.js, packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js, packages/relay-runtime/network/RelayObservable.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/ReactRelayRefetchContainer.js:438 — `observer.start && observer.start(subscription)` appears character-identically in 4 files — packages/react-relay/ReactRelayRefetchContainer.js, packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js, packages/relay-runtime/network/RelayObservable.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/react-relay/relay-hooks/useQueryLoader.js:217 — `options != null && options.hasOwnProperty('__environment')` appears character-identically in 2 files — packages/react-relay/relay-hooks/useQueryLoader.js, packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:540 — `previousIDAndTypename == null || refetchedFragmentRef == null` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/relay-compiler/index.js:26 — `process.platform === 'darwin' && process.arch === 'arm64'` appears character-identically in 2 files — packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/relay-compiler/index.js:24 — `process.platform === 'darwin' && process.arch === 'x64'` appears character-identically in 2 files — packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/relay-compiler/index.js:30 — `process.platform === 'linux' && process.arch === 'arm64'` appears character-identically in 2 files — packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D30 · Dependency Vulnerabilities · Low CVE · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D16 · Bus Factor · Off-boarding risk · ×3
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: compiler/crates/relay-transforms/src/skip_redundant_nodes.rs, compiler/crates/relay-compiler/src/build_project/shadow_return_conversion.rs, compiler/crates/relay-schema/src/definitions.rs, compiler/crates/graphql-text-printer/src/print_full_operation.rs, compiler/crates/dependency-analyzer/src/query_stats.rs, compiler/crates/relay-transforms/src/apply_fragment_arguments/scope.rs, compiler/crates/relay-compiler/src/build_project/get_artifacts_file_hash_map.rs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: compiler/crates/schema-set/src/build_schema_document.rs, compiler/crates/schema-set/src/build_in_memory_schema.rs, compiler/crates/schema-set/src/from_schema.rs, compiler/crates/schema-set/src/set_type_reference.rs, compiler/crates/graphql-text-printer/src/prettier_document_printer.rs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: compiler/crates/project-fixture/src/lib.rs, compiler/crates/relay-transforms/src/validations/disallow_readtime_features_in_mutations.rs, compiler/crates/relay-compiler/src/path_validator.rs, compiler/crates/relay-compiler/src/build_project/build_resolvers_schema/ir_to_schema.rs. Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 7 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (27 single-owned of 334 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 334 of the 438 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) (+1 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: compiler/crates/relay-compiler/src/server_daemon.rs, compiler/crates/relay-compiler/src/server_daemon/vcs_state.rs, compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs, compiler/crates/schema-set/src/transform.rs, compiler/crates/graphql-ir/src/validator.rs, compiler/crates/fixture-tests/src/main.rs, compiler/crates/relay-lsp/src/server/lsp_request_dispatch.rs, compiler/crates/js-config-loader/src/lib.rs.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 2 of 7 project(s) overshoot their size bounds, lowering Project Cohesion to 4.3/10. The most over is `compiler` (140435 LoC, 1089 module-visible types across 75 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.
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 72 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: compiler/crates/common/src/diagnostic.rs, compiler/crates/relay-lsp/src/node_resolution_info.rs, compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs, compiler/crates/schema/src/suggestion_list.rs, compiler/crates/schema/src/definitions/interface.rs, compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_regular_queries.rs, compiler/crates/relay-lsp/src/code_action.rs, compiler/crates/schema/src/graphql_schema.rs (and 64 more) (77 orphaned of 336 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 336 of the 438 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D7 · Architectural Integrity · Classify ADR enforcement · ×1
  • Classify ADR enforcement: H1 2016 meta/roadmaps/2016-H1.md — This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 6/11 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `compiler/crates/fixture-tests`, `compiler/crates/persist-query`, `compiler/crates/prettier-format`, `compiler/crates/schema-validate`, `packages/relay-compiler`.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
R8 · Dependency Hygiene · Test-only dependency 'nullthrows' in production deps · ×1
  • Test-only dependency 'nullthrows' in production deps package.json:78 — Only test files import it (first: packages/react-relay/relay-hooks/__tests__/loadQuery-test.js:41) — move it to devDependencies.
X7 · Silent fallback defaults · Silent fallback default on Err · ×1
  • Silent fallback default on Err compiler/crates/persist-query/src/lib.rs:170 — `sanitize_endpoint` turns every `Err` into `"<invalid endpoint>".to_string()` — 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.
Minor — 4 finding(s)
D12 · Dependency Hygiene · Outdated · ×4
  • Outdated: schemars — `schemars` is locked at 1.2.2 but 1.2.3 is the current stable release on crates.io, and it already satisfies the `"1.2.2"` requirement declared in compiler/crates/common/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p schemars` and commit the updated REDACTED.
  • Outdated: smallvec — `smallvec` is locked at 1.16.2 but 1.16.4 is the current stable release on crates.io, and it already satisfies the `"1.16.2"` requirement declared in compiler/crates/intern/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p smallvec` and commit the updated REDACTED.
  • Outdated: tokio — `tokio` is locked at 1.53.2 but 1.54.1 is the current stable release on crates.io, and it already satisfies the `"1.53.2"` requirement declared in compiler/crates/fixture-tests/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio` and commit the updated REDACTED.
  • Outdated: zstd — `zstd` is locked at 0.14.0 but 0.14.3 is the current stable release on crates.io, and it already satisfies the `"0.14.0"` requirement declared in compiler/crates/relay-compiler/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p zstd` and commit the updated REDACTED.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-be4656dc9ec241ecaf1d695be757cb95/history.json --exit-code 0 --source .4artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-be4656dc9ec241ecaf1d695be757cb95/tree.json --exit-code 0 --source .1artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude compiler/test-project --exclude packages/react-relay/__flowtests__/__generated__ --exclude packages/react-relay/__tests__/__generated__ --exclude packages/react-relay/relay-hooks/__flowtests__/__generated__ --exclude packages/react-relay/relay-hooks/__tests__/__generated__ --exclude packages/react-relay/relay-hooks/rsc/__tests__/__generated__ --exclude packages/relay-runtime/handlers/connection/__tests__/__generated__ --exclude packages/relay-runtime/multi-actor-environment/__tests__/__generated__ --exclude packages/relay-runtime/mutations/__tests__/__generated__ --exclude packages/relay-runtime/query/__tests__/__generated__ --exclude packages/relay-runtime/store/__tests__/__generated__ --exclude packages/relay-runtime/store/__tests__/no_inline/__generated__ --exclude packages/relay-runtime/store/__tests__/no_inline/some/deeply/nested/__generated__ --exclude packages/relay-runtime/store/__tests__/resolvers/__generated__ --exclude packages/relay-runtime/subscription/__tests__/__generated__ --exclude packages/relay-runtime/util/__tests__/__generated__ --exclude packages/relay-test-utils/__flowtests__/__generated__ --exclude packages/relay-test-utils/__tests__/__generated__ --exclude vscode-extension/.vscode --exclude vscode-extension/src --exclude website/components --exclude website/docs --exclude website/plugins --exclude website/spec --exclude website/src --exclude website/static/graphql --exclude website/versioned_docs --exclude website/versioned_sidebars .122artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update64artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 115 file(s) — `flow-typed/npm/chalk_v4.x.x.js`, `flow-typed/npm/invariant_v2.x.x.js`, `flow-typed/npm/jest_v29.x.x.js`, `packages/babel-plugin-relay/BabelPluginRelay.js`, `packages/babel-plugin-relay/compileGraphQLTag.js`, … (+110 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0artifacts/raw/trivy-fs.json

Run 01a176d6-4bb0-7485-ac4b-f2e528b074e8 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Issues: 100 · Warnings: 1097 · Recommendations: 144 · Info: 4 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 06:11 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.

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